Randomized algorithms
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
On the relative complexity of approximate counting problems
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
On stability of a formal concept
Annals of Mathematics and Artificial Intelligence
Reducing the Representation Complexity of Lattice-Based Taxonomies
ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
Analysis of social communities with iceberg and stability-based concept lattices
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Towards concise representation for taxonomies of epistemic communities
CLA'06 Proceedings of the 4th international conference on Concept lattices and their applications
Approaches to the selection of relevant concepts in the case of noisy data
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Review: Formal Concept Analysis in knowledge processing: A survey on models and techniques
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Concept stability was used in numerous applications for selecting concepts as biclusters of similar objects. However, scalability remains a challenge for computing stability. The best algorithms known so far have algorithmic complexity quadratic in the size of the lattice. In this paper the problem of approximate stability computation is analyzed. An approximate algorithm for computing stability is proposed. Its computational complexity and results of computer experiments in comparing stability index and its approximations are discussed.