AddIntent: A New Incremental Algorithm for Constructing Concept Lattices

Autor:	Dean van der Merwe, Sergei Obiedkov, Derrick G. Kourie
Rok vydání:	2004
Předmět:	Combinatorics Discrete mathematics Efficient algorithm Lattice (order) Incremental algorithm Upper and lower bounds Mathematics
Zdroj:	Concept Lattices ISBN: 9783540210436 ICFCA Scopus-Elsevier
DOI:	10.1007/978-3-540-24651-0_31
Popis:	An incremental concept lattice construction algorithm, called AddIntent, is proposed. In experimental comparison, AddIntent outperformed a selection of other published algorithms for most types of contexts and was close to the most efficient algorithm in other cases. The current best estimate for the algorithm’s upper bound complexity to construct a concept lattice L whose context has a set of objects G, each of which possesses at most max(|g′|) attributes, is O(|L||G|2 max(|g′|)).
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c53dcd85440d7315a743c9f147d3f0b https://doi.org/10.1007/978-3-540-24651-0_31 Zobrazit plný text záznamu