Formal Concept Analysis with Constraints by Closure Operators
The paper presents a general method of imposing constraints in formal concept analysis of tabular data describing objects and their attributes. The constraints represent a user-defined requirements which are supplied along with the input data table. The main effect is to filter-out outputs of the analysis (conceptual clusters and if-then rules) which are not compatible with the constraint, in a computationally efficient way (polynomial time delay algorithm without the need to compute all outputs). Our approach covers several examples studied before, e.g. extraction of closed frequent itemsets in generation of non-redundant association rules. We present motivations, foundations, and examples.
Unable to display preview. Download preview PDF.
- 1.Bělohlávek, R., Sklenář, V., Zacpal, J.: Formal concept analysis with hierarchically ordered attributes. Int. J. General Systems 33(4), 283–294 (2004)Google Scholar
- 5.Dekel, U., Gill, Y.: Visualizing class interfaces with formal concept analysis. In: OOPSLA 2003, Anaheim, CA, pp. 288–289 (October 2003)Google Scholar
- 9.Norris, E.M.: An algorithm for computing the maximal rectangles of a binary relation. Journal of ACM 21, 266–356 (1974)Google Scholar