Journal
EXPERT SYSTEMS WITH APPLICATIONS
Volume 42, Issue 9, Pages 4474-4481Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2015.01.044
Keywords
Formal Concept Analysis; Concept lattice; Incremental algorithm; Lattice construction
Categories
Funding
- National Natural Science Foundation of China (NSFC) [61379109]
- Research Fund for the Doctoral Program of Higher Education of China [20120162110077]
Ask authors/readers for more resources
Incremental algorithms for constructing concept lattices can update a concept lattice according to new objects added to the formal context. In this paper, we propose an efficient incremental algorithm for concept lattice construction. The algorithm, called FastAddIntent, results as a modification of Addlntent in which we improve two fundamental procedures including searching for canonical generators and fixing the covering relation. We describe the algorithm completely, prove correctness of our improvements, discuss time complexity issues, and present an experimental evaluation of its performance and comparison with AddIntent. Theoretical and empirical analyses show the advantages of our algorithm when applied to large or (and) dense formal contexts. (C) 2015 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available