A fast algorithm for building lattices
Information Processing Letters
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Computing iceberg concept lattices with TITANIC
Data & Knowledge Engineering
Conceptual Knowledge Discovery in Databases Using Formal Concept Analysis Methods
PKDD '98 Proceedings of the Second European Symposium on Principles of Data Mining and Knowledge Discovery
Classification Based Retrieval Using Formal Concept Analysis
ICCBR '01 Proceedings of the 4th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
Incremental pseudo rectangular organization of information relative to a domain
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Hi-index | 0.00 |
As a power tool for analyzing data, concept lattice has been extensively applied in several areas such as knowledge discovery, software engineering and case-based reasoning. However, building concept lattice is time-consuming and complicated; it becomes the bottleneck of application. Therefore, a simple and efficient method for building concept lattice is proposed in this paper. We transform binary formal context into matrix at first, and then discuss how to build concept lattice based on basic concepts and added concepts, which the two concepts can be got from matrix operation. We also present a fast algorithm BCLMO (Building Concept Lattice based on Matrix Operation) for building concept lattice, and analyze the time complexity of BCLMO. The method we proposed could remarkably reduce the time complexity and improve the efficiency of building concept lattice.