Some decision and counting problems of the Duquenne-Guigues basis of implications

Discrete Applied Mathematics

Volumn 156, Issue 11, 2008, Pages 1994-2003

  Kuznetsov, Sergei O ^a   Obiedkov, Sergei ^b  

^a NATIONAL RESEARCH UNIVERSITY HIGHER SCHOOL OF ECONOMICS   (Russian Federation)

^b UNIVERSITY OF PRETORIA   (South Africa)

Author keywords

P completeness; Duquenne Guigues basis; Functional dependencies; Implication basis

Indexed keywords

#P COMPLETE PROBLEM; FORMAL CONTEXTS; FUNCTIONAL DEPENDENCIES (FD); STEM BASE;

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

References (20)

1. Birkhoff G.D. Lattice Theory (1979), American Mathematical Society
2. E. Boros, V. Gurvich, L. Khachiyan, K. Makino, On the complexity of generating maximal frequent and minimal infrequent sets, in: Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS'02), Lecture Notes in Computer Science, vol. 2285, Springer, Berlin, 2002, pp. 133-141.
3. Duquenne V. Contextual implications between attributes and some representation properties for finite lattices. In: Ganter B. (Ed). Beiträge zur Begriffsanalyse (1987), Mannheim 213-239
4. V. Duquenne, J.-L. Guigues, Galois Lattice Revival, in: Communication to the Third Meeting of the Psychometric Society, Jouy en Josas, July 1983.
5. B. Ganter, Two basic algorithms in concept analysis, Preprint No. 831, Technische Hochschule Darmstadt, 1984.
6. B. Ganter, S. Kuznetsov, Formalizing hypotheses with concepts, in: Proceedings of the 8th International Conference on Conceptual Structures (ICCS'00), Lecture Notes in Artificial Intelligence, vol. 1867, 2000, pp. 342-356.
7. Ganter B., and Wille R. Formal Concept Analysis: Mathematical Foundations (1999), Springer, Berlin
8. Garey M., and Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco
9. J.-L. Guigues, V. Duquenne, Informative implications derived from a table of binary data. Preprint, Groupe Mathématiques et Psychologie, Université René Descartes, Paris, 1984.
10. Guigues J.-L., and Duquenne V. Familles minimales d'implications informatives résultant d'un tableau de données binaires. Math. Sci. Hum. 24 95 (1986) 5-18
11. Kuznetsov S.O. On computing the size of a lattice and related decision problems. Order 18 4 (2001) 313-321
12. Kuznetsov S.O., and Obiedkov S.A. Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artif. Intell. 14 2-3 (2002) 189-216
13. Kuznetsov S.O. On the intractability of computing the Duquenne-Guigues base. J. Universal Comput. Sci. 10 8 (2004) 927-933
14. Luxenburger M. Implications partielles dans un contexte. Math. Inform. et Sci. Humaines 113 29 (1991) 35-55
15. Mannila H., and Räihä K.-J. Design of Relational Databases (1992), Addison-Wesley, Reading, MA
16. N. Pasquier, Y. Bastide, R. Taouil, L. Lakhal, Closed set based discovery of small covers for association rules, in: Proceedings of the BDA Conference, 1999, pp. 361-381.
17. Valiant L.G. The complexity of enumeration and reliability problems. SIAM J. Comput. 8 3 (1979) 410-421
18. M. Wild, Computations with finite closure systems and implications, Preprint No. 1708, Technische Hochschule Darmstadt, 1994.
19. Wille R. Restructuring lattice theory: an approach based on Hierarchies of concepts. In: Rival I. (Ed). Ordered Sets (1982), Reidel, Dordrecht-Boston 445-470
20. M.J. Zaki, M. Ogihara, Theoretical foundations of association rules, in: Proceedings of the 3rd SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 1998.