Closure-based constraints in formal concept analysis

Discrete Applied Mathematics

Volumn 161, Issue 13-14, 2013, Pages 1894-1911

  Belohlavek, Radim ^a   Vychodil, Vilem ^a  

^a PALACKÝ UNIVERSITY   (Czech Republic)

Author keywords

Algorithms; Attribute implication; Background knowledge; Binary relation; Closure structure; Formal concept analysis

Indexed keywords

ATTRIBUTE IMPLICATIONS; BACK-GROUND KNOWLEDGE; BINARY RELATION; CLOSED ITEMSETS; CLOSURE OPERATORS; CLOSURE STRUCTURES; GALOIS CONNECTION; PAST AND PRESENT;

ALGORITHMS; INFORMATION ANALYSIS;

FORMAL CONCEPT ANALYSIS;

EID: 84878294306     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2013.02.029     Document Type: Article

References (20)

1. W.W. Armstrong, Dependency structures in data base relationships, in: IFIP Congress, Geneva, Switzerland, 1974, pp. 580-583.
2. R. Belohlavek, and V. Vychodil Formal concept analysis with background knowledge: attribute priorities IEEE Trans. Syst. Man Cybern. Part C-Appl. Rev. 39 4 2009 399 409
3. C. Carpineto, and G. Romano Concept Data Analysis. Theory and Applications 2004 J. Wiley
4. B. Ganter Two basic algorithms in concept analysis, Technical Report FB4-Preprint No. 831, TH Darmstadt 1984
5. B. Ganter Attribute exploration with background knowledge Theoret. Comput. Sci. 217 1999 215 233
6. B. Ganter, and R. Krausse Pseudo-models and propositional Horn inference Discrete Appl. Math. 147 1 2005 43 55
7. B. Ganter, and R. Wille Formal Concept Analysis. Mathematical Foundations 1999 Springer Berlin
8. J.-L. Guigues, and V. Duquenne Familles minimales d'implications informatives resultant d'un tableau de données binaires Math. Sci. Hum. 95 1986 5 18
9. D.S. Johnson, M. Yannakakis, and C.H. Papadimitriou On generating all maximal independent sets Inform. Process. Lett. 27 3 1988 119 123
10. S.O. Kuznetsov A fast algorithm for computing all intersections of objects in a finite semi-lattice Autom. Doc. Math. Linguist. 27 5 1993 11 21
11. S.O. Kuznetsov On the intractability of computing the Duquenne-Guigues base J. Univers. Comput. Sci. 10 8 2004 927 933
12. S.O. Kuznetsov, and S. Obiedkov Comparing performance of algorithms for generating concept lattices J. Exp. Theor. Artif. Intell. 14 2002 189 216
13. C. Lindig Fast concept analysis Working with Conceptual Structures - Contributions to ICCS 2000 2000 Shaker Verlag Aachen 152 161
14. D. Maier The Theory of Relational Databases 1983 Computer Science Press Rockville
15. E. Mendelson Introduction to Mathematical Logic fourth ed. 1997 Chapman & Hall London
16. E.M. Norris An Algorithm for Computing the Maximal Rectangles in a Binary Relation Rev. Roumaine Math. Pures Appl. 23 2 1978 243 250
17. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal Efficient mining of association rules using closed itemset Lattices Inf. Syst. 24 1 1999 25 46
18. Z. Xie, Φ-generalized concept lattice models: from power concepts to formal concepts, and then to robust concepts, in: Proc. CLA 2006, Int. Conference on Concept Lattices and their Applications, pp. 219-230.
19. M.J. Zaki Mining non-redundant association rules Data Min. Knowl. Discov. 9 2004 223 248
20. C. Zhang, and S. Zhang Association Rule Mining. Models and Algorithms 2002 Springer Berlin