Subdirect product construction of concept lattices
Discrete Mathematics
Reengineering class hierarchies using concept analysis
SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
Design of class hierarchies based on concept (Galois) lattices
Theory and Practice of Object Systems - Special issue high availability in CORBA
Efficient mining of association rules using closed itemset lattices
Information Systems
A fast algorithm for building lattices
Information Processing Letters
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Automatic Structuring of Knowledge Bases by Conceptual Clustering
IEEE Transactions on Knowledge and Data Engineering
Scalable Algorithms for Association Mining
IEEE Transactions on Knowledge and Data Engineering
Building Concept (Galois) Lattices from Parts: Generalizing the Incremental Methods
ICCS '01 Proceedings of the 9th International Conference on Conceptual Structures: Broadening the Base
A local approach to concept generation
Annals of Mathematics and Artificial Intelligence
Relational concept discovery in structured datasets
Annals of Mathematics and Artificial Intelligence
A framework for incremental generation of closed itemsets
Discrete Applied Mathematics
A proposal for combining formal concept analysis and description logics for mining relational data
ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
Topological space for attributes set of a formal context
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Using a reinforced concept lattice to incrementally mine association rules from closed itemsets
KDID'06 Proceedings of the 5th international conference on Knowledge discovery in inductive databases
Generating positive and negative exact rules using formal concept analysis: problems and solutions
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
On the merge of factor canonical bases
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
An approach for constructing concept lattices
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Variable precision concepts and its applications for query expansion
ICIC'09 Proceedings of the Intelligent computing 5th international conference on Emerging intelligent computing technology and applications
Incremental construction of alpha lattices and association rules
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part II
AIKED'11 Proceedings of the 10th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
Reduction-Based approaches towards constructing galois (concept) lattices
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Merge-Based computation of minimal generators
ICCS'05 Proceedings of the 13th international conference on Conceptual Structures: common Semantics for Sharing Knowledge
A parallel algorithm for lattice construction
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Alpha galois lattices: an overview
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Distributed formal concept analysis algorithms based on an iterative mapreduce framework
ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
Computing Implications with Negation from a Formal Context
Fundamenta Informaticae - Concept Lattices and Their Applications
Parallel computation of closed itemsets and implication rule bases
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
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
Formal concept analysis based on the topology for attributes of a formal context
Information Sciences: an International Journal
A bottom-up algorithm of vertical assembling concept lattices
International Journal of Data Mining and Bioinformatics
Relational concept analysis: mining concept lattices from multi-relational data
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.05 |
Galois lattices and formal concept analysis of binary relations have proved useful in the resolution of many problems of theoretical or practical interest. Recent studies of practical applications in data mining and software engineering have put the emphasis on the need for both efficient and flexible algorithms to construct the lattice. Our paper presents a novel approach for lattice construction based on the apposition of binary relation fragments. We extend the existing theory to a complete characterization of the global Galois (concept) lattice as a substructure of the direct product of the lattices related to fragments. The structural properties underlie a procedure for extracting the global lattice from the direct product, which is the basis for a full-scale lattice construction algorithm implementing a divide-and-conquer strategy. The paper provides a complexity analysis of the algorithm together with some results about its practical performance and describes a class of binary relations for which the algorithm outperforms the most efficient lattice-constructing methods.