On interestingness measures of formal concepts
This work addresses the challenge of managing exponential concept lattices in knowledge discovery, which is incremental as it compares existing measures rather than introducing new ones.
The paper tackles the problem of selecting useful formal concepts from large datasets by evaluating and comparing various interestingness measures based on computational efficiency, noise tolerance, and ranking correlation.
Formal concepts and closed itemsets proved to be of big importance for knowledge discovery, both as a tool for concise representation of association rules and a tool for clustering and constructing domain taxonomies and ontologies. Exponential explosion makes it difficult to consider the whole concept lattice arising from data, one needs to select most useful and interesting concepts. In this paper interestingness measures of concepts are considered and compared with respect to various aspects, such as efficiency of computation and applicability to noisy data and performing ranking correlation.