Computing premises of a minimal cover of functional dependencies is intractable

Discrete Applied Mathematics

Volumn 161, Issue 6, 2013, Pages 742-749

  Babin, Mikhail A ^a   Kuznetsov, Sergei O ^a  

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

Author keywords

Formal concept analysis; Functional dependencies; Minimum basis; Pseudo intents

Indexed keywords

CLOSED SET; FUNCTIONAL DEPENDENCY; MINIMUM BASIS; PSEUDO-INTENTS; SAMPLING PROBLEMS;

COMBINATORIAL MATHEMATICS; FORMAL CONCEPT ANALYSIS;

MATHEMATICAL TECHNIQUES;

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

References (18)

1. F. Distel Hardness of enumerating pseudo-intents in the lectic order L. Kwuida, B. Sertkaya, ICFCA 2010 Lecture Notes in Artificial Intelligence vol. 5986 2010 Springer 124 137
2. F. Distel, and B. Sertkaya On the complexity of enumerating pseudo-intents Discrete Applied Mathematics 159 6 2011 450 466
3. R. Feldman, and J. Sanger The Text Mining Handbook: Advanced Approaches in Analyzing Unstructured Data 2007 Cambridge University Press
4. B. Ganter, and R. Wille Formal Concept Analysis: Mathematical Foundations 1999 Springer Berlin
5. J.L. Guigues, and V. Duquenne Familles minimales d'implications informatives resultant d'un tableau de données binaries Mathématiques, Informatique et Sciences Humaines 95 1986 5 18
6. T. Ibaraki, A. Kogan, and K. Makino Functional dependencies in Horn theories Artificial Intelligence 108 1-2 1999 1 30
7. R. Khardon Translating between Horn Representations and their characteristic models Journal of AI Research 3 1995 349 372
8. S.O. Kuznetsov Machine learning on the basis of formal concept analysis Automation and Remote Control 62 10 2001
9. S.O. Kuznetsov On the intractability of computing Duquenne-Guigues base Journal of Universal Computer Science 10 8 2004 927 933
10. S.O. Kuznetsov, and S.A. Obiedkov Counting pseudo-intents and #P-completeness R. Missaoui, J. Schmid, ICFCA 2006 Lecture Notes in Computer Science vol. 3874 2006 Springer 306 308 (Pubitemid 43979838)
11. S.O. Kuznetsov, and S.A. Obiedkov Some decision and counting problems of the Duquenne-Guigues basis of implications Discrete Applied Mathematics 156 11 2008 1994 2003
12. D. Loshin Master Data Management 2009 Morgan Kaufmann Publishers
13. D. Maier Theory of Relational Databases first ed. 1983 Computer Science Press
14. S. Rudolph Some notes on pseudo-closed sets ICFCA 2007 Lecture Notes in Computer Science vol. 4390 2007 Springer 151 165
15. B. Sertkaya Towards the complexity of recognizing pseudo-intents F. Dau, S. Rudolph, ICCS 2009 Lecture Notes in Computer Science vol. 5662 2009 Springer 284 292
16. B. Sertkaya Some computational problems related to pseudo-intents S. Ferre, S. Rudolph, ICFCA 2009 Lecture Notes in Computer Science vol. 5662 2009 Springer 284 292
17. R. Singh, and K. Singh A descriptive classification of causes of data quality problems in data warehousing International Journal of Computer Science Issue 7 3 2010 No. 2
18. H. Yao, and H.J. Hamilton Mining functional dependencies from data Journal of Data Mining and Knowledge Discovery 16 2 2008 197 219 (Pubitemid 351185537)