Decision implication canonical basis: A logical perspective

Journal of Computer and System Sciences

Volumn 81, Issue 1, 2015, Pages 208-218

  Zhai, Yanhui ^a   Li, Deyu ^a   Qu, Kaishe ^a  

^a SHANXI UNIVERSITY   (China)

Author keywords

Canonical basis; Decision context; Decision implication; Formal concept analysis

Indexed keywords

COMPUTATIONAL COMPLEXITY; INFORMATION ANALYSIS;

ATTRIBUTE IMPLICATIONS; CANONICAL BASIS; COMPLETE SETS; DECISION CONTEXT; DECISION IMPLICATION; IMPORTANT FEATURES; NON-REDUNDANT; TIME COMPLEXITY;

FORMAL CONCEPT ANALYSIS;

EID: 84908117980     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2014.06.001     Document Type: Conference Paper

References (29)

1. R. Agrawal, and R. Srikant Fast algorithms for mining association rules J.B. Bocca, M. Jarke, C. Zaniolo, Proceedings of 20th International Conference on Very Large Data Bases 1994 Morgan Kaufmann Santiago de Chile, Chile 487 499
2. M.A. Babin, and S.O. Kuznetsov Computing premises of a minimal cover of functional dependencies is intractable Discrete Appl. Math. 161 2013 742 749
3. R. Bělohlávek, J. Outrata, and V. Vychodil Thresholds and shifted attributes in formal concept analysis of data with fuzzy attributes H. Schärfe, P. Hitzler, P. ∅hrstrøm, 14th International Conference on Conceptual Structures Lect. Notes Comput. Sci. vol. 4068 2006 Springer 117 130
4. C. Carpineto, and G. Romano Concept Data Analysis: Theory and Applications 2004 John Wiley & Sons
5. P. Cordero, M. Enciso, A. Mora, and M. Ojeda-Aciego Computing minimal generators from implications: a logic-guided approach L. Szathmary, U. Priss, Concept Lattices and their Applications CEUR Workshop Proc. vol. 972 2012 CEUR-WS.org 187 198
6. V. Duquenne, and J.L. Guigues Famille minimale d'implications informatives résultant d'un tableau de données binaires Math. Sci. Hum. 24 1986 5 18
7. B. Ganter Two basic algorithms in concept analysis L. Kwuida, B. Sertkaya, Formal Concept Analysis 8th International Conference, ICFCA 2010 Lect. Notes Comput. Sci. vol. 5986 2010 Springer 312 340
8. B. Ganter, and S. Kuznetsov Hypotheses and version spaces B. Ganter, A. Moor, W. Lex, Conceptual Structures for Knowledge Creation and Communication Lect. Notes Comput. Sci. vol. 2746 2003 Springer Berlin, Heidelberg 83 95
9. B. Ganter, and R. Wille Formal Concept Analysis: Mathematical Foundations 1999 Springer
10. S.O. Kuznetsov Mathematical aspects of concept analysis J. Math. Sci. 80 1996 1654 1698
11. S.O. Kuznetsov Machine learning on the basis of formal concept analysis Autom. Remote Control 62 2001 1543 1564
12. S.O. Kuznetsov On the intractability of computing the Duquenne-Guigues base J. Univers. Comput. Sci. 10 2004 927 933
13. S.O. Kuznetsov Galois connections in data analysis: contributions from the Soviet era and modern Russian research B. Ganter, G. Stumme, R. Wille, Formal Concept Analysis Lect. Notes Comput. Sci. vol. 3626 2005 Springer Berlin, Heidelberg 196 225
14. S.O. Kuznetsov, and S.A. Obiedkov Counting pseudo-intents and #P-completeness Formal Concept Analysis 2006 306 308
15. S.O. Kuznetsov, and S.A. Obiedkov Some decision and counting problems of the Duquenne-Guigues basis of implications Discrete Appl. Math. 156 2008 1994 2003
16. S.A. Obiedkov, and V. Duquenne Attribute-incremental construction of the canonical implication basis Ann. Math. Artif. Intell. 49 2007 77 99
17. Z. Pawlak Rough Sets: Theoretical Aspects of Reasoning about Data 1991 Kluwer Academic Publishers
18. U. Priss, Some open problems in formal concept analysis, in: International Conference on Formal Concept Analysis, ICFCA 2006, Dresden.
19. K.S. Qu, and Y.H. Zhai Generating complete set of implications for formal contexts Knowl.-Based Syst. 21 2008 429 433
20. K.S. Qu, Y.H. Zhai, J.Y. Liang, and M. Chen Study of decision implications based on formal concept analysis Int. J. Gen. Syst. 36 2007 147 156
21. H. Saiedian, and T. Spencer An efficient algorithm to compute the candidate keys of a relational database schema Comput. J. 39 1996 124 132
22. G. Stumme Attribute exploration with background implications and exceptions H.H. Bock, W. Polasek, Data Analysis and Information Systems. Statistical and Conceptual Approaches. Proc. GfKl'95 Stud. Classif. Data Anal. Knowl. Organ. vol. 7 1996 Springer Heidelberg 457 469
23. G. Stumme, R. Taouil, Y. Bastide, N. Pasquier, L. Lakhal, Fast computation of concept lattices using data mining techniques, in: M. Bouzeghoub, M. Klusch, W. Nutt, U. Sattler (Eds.), Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases, pp. 129-139.
24. P. Tonella Using a concept lattice of decomposition slices for program understanding and impact analysis IEEE Trans. Softw. Eng. 29 6 2003 495 509
25. P. Valtchev, and V. Duquenne On the merge of factor canonical bases R. Medina, S. Obiedkov, Formal Concept Analysis 6th International Conference, ICFCA 2008 Lect. Notes Comput. Sci. vol. 4933 2008 182 198
26. R. Wille Restructuring lattice theory: an approach based on hierarchies of concepts Formal Concept Analysis 83 1982 445 470
27. Y. Zhai, D. Li, and K. Qu Decision implications: a logical point of view Int. J. Mach. Learn. and Cyber. 2013 10.1007/s13042-013-0204-2 (published online)
28. Y.H. Zhai, D.Y. Li, and K.S. Qu Fuzzy decision implications Knowl.-Based Syst. 37 2013 230 236
29. B. Zupan, M. Bohanec, J. Demsar, and I. Bratko Learning by discovering concept hierarchies Artif. Intell. 109 1999 211 242