Comparing performance of algorithms for generating concept lattices
Comparing performance of algorithms for generating concept lattices
复制标题
DOI：
10.1080/09528130210164170
复制
发表时间：
2002-04-01
影响因子：
2.2
通讯作者：
Obiedkov, SA
中科院分区：
文献类型：
--
作者：
Kuznetsov, SO;Obiedkov, SA
近年来，概念格成为智能数据分析中广泛使用的工具。本文研究了几种生成概念格的形式概念集和图的算法。一些著名的算法的修改建议。从理论上（在最坏的情况下）和实验上研究了算法的算法复杂度。根据底层形式背景的密度/稀疏性给出了一些算法的优选使用条件。讨论了算法实际性能比较的原则。
Recently concept lattices became widely used tools for intelligent data analysis. In this paper, several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of well-known 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.