Building and maintaining analysis-level class hierarchies using Galois Lattices
OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
An incremental concept formation approach for learning from databases
Theoretical Computer Science - Special issue on formal methods in databases and software engineering
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
A partition-based approach towards constructing Galois (concept) lattices
Discrete Mathematics
Stepwise Construction of the Dedekind-MacNeille Completion (Research Note)
ICCS '98 Proceedings of the 6th International Conference on Conceptual Structures: Theory, Tools and Applications
The Use of Associative Concepts in the Incremental Building of a Logical Context
ICCS '02 Proceedings of the 10th International Conference on Conceptual Structures: Integration and Interfaces
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
Merge-Based computation of minimal generators
ICCS'05 Proceedings of the 13th international conference on Conceptual Structures: common Semantics for Sharing Knowledge
On computing the minimal generator family for concept lattices and icebergs
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
A lattice-based approach for mining most generalization association rules
Knowledge-Based Systems
A bottom-up algorithm of vertical assembling concept lattices
International Journal of Data Mining and Bioinformatics
Incrementally building frequent closed itemset lattice
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Formal concept analysis is increasingly used as a data mining technique, whence the need of efficient algorithms for handling large sets of volatile data. Recently, we designed a general framework for constructing concept (Galois) lattices from fragmented and/or evolving data based on a lattice assembly operation. In this paper, the framework is adapted to the maintenance of concept lattices upon the insertion of a set of objects into the context, a problem which generalizes the insertion of individual objects considered by the existing incremental methods. The paper provides a set of structural results for the case of single object insertions which underlie a new incremental algorithm. Our method is shown to improve a key flaw of the major incremental technique.