Comparing Performance of Algorithms for Generating Concept Lattices (2002)
Cached
Download Links
- [SunSITE.Informatik.RWTH-Aachen.de]
- [sunsite.informatik.rwth-aachen.de]
- DBLP
Other Repositories/Bibliography
| Venue: | JOURNAL OF EXPERIMENTAL AND THEORETICAL ARTIFICIAL INTELLIGENCE |
| Citations: | 65 - 6 self |
BibTeX
@ARTICLE{Kuznetsov02comparingperformance,
author = {Sergei O. Kuznetsov and Sergei Obiedkov},
title = {Comparing Performance of Algorithms for Generating Concept Lattices},
journal = {JOURNAL OF EXPERIMENTAL AND THEORETICAL ARTIFICIAL INTELLIGENCE},
year = {2002},
volume = {14},
pages = {189--216}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of wellknown algorithms are proposed. Algorithmic complexity of the algorithms is studied both theoretically (in the worst case) and experimentally. Conditions of preferable use of some algorithms are given in terms of density/sparseness of underlying formal contexts. Principles of comparing practical performance of algorithms are discussed.
