.png){kind=icon}
Return
A fast incremental algorithm for constructing concept lattices
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2015.01.044.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Formal Concept Analysis
Concept lattice
Incremental algorithm
Lattice construction
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.2W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSave
View more