Fast concept analysis (2000)
Cached
Download Links
| Venue: | Working with Conceptual Structures – Contributions to ICCS 2000 |
| Citations: | 27 - 1 self |
BibTeX
@INPROCEEDINGS{Lindig00fastconcept,
author = {Christian Lindig},
title = {Fast concept analysis},
booktitle = {Working with Conceptual Structures – Contributions to ICCS 2000},
year = {2000},
pages = {152--161},
publisher = {Shaker Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Formal concept analysis is increasingly used for large contexts that are built by programs. This paper presents an efficient algorithm for concept analysis that computes concepts together with their explicit lattice structure. An experimental evaluation uses randomly generated contexts to compare the running time of the presented algorithm with two other algorithms. Running time increases quadratically with the number of concepts, but with a small quadratic component. At least contexts with sparsely filled context tables cause concept lattices grow quadratically with respect to the size of their base relation. The growth rate is controlled by the density of context tables. Modest growth combined with efficient algorithms lead to fast concept analysis. 1
