On the efficient stability computation for the selection of interesting formal concepts
Authors:
- 6 September 2018
- journal article
- research article
- Published by Elsevier in Information Sciences
- Vol. 472, 15-34
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- QualityCover: Efficient binary relation coverage guided by induced knowledge qualityInformation Sciences, 2016
- Concept lattices reduction: Definition, analysis and classificationExpert Systems with Applications, 2015
- Efficient unveiling of multi-members in a social networkJournal of Systems and Software, 2014
- Is Concept Stability a Measure for Pattern Selection?Procedia Computer Science, 2014
- ON SUCCINCT REPRESENTATION OF KNOWLEDGE COMMUNITY TAXONOMIES WITH FORMAL CONCEPT ANALYSISInternational Journal of Foundations of Computer Science, 2008
- Maximum entropy based significance of itemsetsKnowledge and Information Systems, 2008
- On stability of a formal conceptAnnals of Mathematics and Artificial Intelligence, 2007
- Mining frequent patterns with counting inferenceACM SIGKDD Explorations Newsletter, 2000
- Efficient mining of association rules using closed itemset latticesInformation Systems, 1999
- Theory of capacitiesAnnales de l'institut Fourier, 1954