Journal
KNOWLEDGE-BASED SYSTEMS
Volume 89, Issue -, Pages 411-419Publisher
ELSEVIER
DOI: 10.1016/j.knosys.2015.07.022
Keywords
Formal concept analysis; Concept lattice; Incremental algorithm; Formal context reduction
Categories
Funding
- National Natural Science Foundation of China [61379109]
- Research Fund for the Doctoral Program of Higher Education of China [20120162110077]
- Young Scientists Fund of the National Natural Science Foundation of China [61402165]
- National Natural Science Foundation of Province Hunan (China) [2015JJ3058]
Ask authors/readers for more resources
The formal context may not be fixed in a real-life application of formal concept analysis, which means that we have to update the present lattice or compute a new lattice from scratch. In this paper, we propose an efficient incremental algorithm, referred to as FastDeletion, to delete objects from a concept lattice. The algorithm improves two fundamental procedures shared by other algorithms. These two procedures include determining which concepts need to be deleted and fixing the covering relation. We describe the algorithm thoroughly, prove correctness of our improvements, discuss time complexity issues, and present an experimental evaluation of its performance and comparison with another algorithm. Empirical analyses demonstrate that our algorithm is superior when applied to various types of formal contexts. (C) 2015 Elsevier B.V. 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