Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Mining Non-Redundant Association Rules
Data Mining and Knowledge Discovery
Formal concept analysis as a framework for business intelligence technologies
ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
| Hi-index | 0.00 |
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The proposed method uses the background knowledge to extract only particular clusters from the input data---those which are compatible with the background knowledge and thus satisfy the constraint. As a result, the method allows for extracting less clusters in a shorter time which are in addition more interesting. The paper presents the idea of constraints formalized by means of closure operators and introduces such constraints to a particular clustering technique, namely to formal concept analysis. Among the benefits of the presented approach are its versatility (the approach covers several examples studied before, e.g. extraction of closed frequent itemsets in generation of non-redundant association rules) and computational efficiency (polynomial time-delay algorithm for computing constrained clusters). Due to scope limitations, we present the main ideas only. Details will be available in a full version of this paper.