Knowledge representation and processing with formal concept analysis

Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery

Volumn 3, Issue 3, 2013, Pages 200-215

  Kuznetsov, Sergei O ^a   Poelmans, Jonas ^a,b  

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

^b UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIONAL KNOWLEDGE; CONCEPTUAL GRAPH; DESCRIPTION LOGIC; KNOWLEDGE DISCOVERY IN DATABASE; KNOWLEDGE PROCESSING; KNOWLEDGE REPRESENTATION AND PROCESSING; ONTOLOGY ENGINEERING; SUPPORT FOR PROCESSING;

DATA DESCRIPTION; INFORMATION ANALYSIS; INTELLIGENT SYSTEMS; KNOWLEDGE REPRESENTATION;

FORMAL CONCEPT ANALYSIS;

EID: 84876739038     PISSN: 19424787     EISSN: 19424795     Source Type: Journal    
DOI: 10.1002/widm.1088     Document Type: Review

References (171)

1. Wille R. Restructuring lattice theory: an approach based on hierarchies of concepts. Rival I, ed. Ordered Sets. Dordrecht, The Netherlands/Boston, MA: Reidel; 1982, 445-470.
2. Arnauld A, Nicole P. La logique ou l'art de penser; 1683.
3. Birkhoff G. Lattice Theory. 3rd ed. Providence, RI: American Mathematical Society Coll. Publ. 25; 1973.
4. Ore O. Galois Connexion. Trans Am Math Soc 1944, 55:493-513.
5. Barbut M, Monjardet B. Ordre et classification, algèbre et combinatoire. Paris: Hachette; 1970.
6. Hereth J. Relational Scaling and Databases ICCS. Heidelberg, Germany: Springer; 2002, 62-76.
7. Carpineto C, Romano G. Concept Data Analysis: Theory and Applications. Chichester, West Sussex, England: John Wiley & Sons; 2004.
8. Poelmans J, Elzinga P, Viaene S, Dedene G, Kuznetsov S. Text mining scientific papers: a survey on FCA-based information retrieval research. Industrial Conference on Data Mining. Berlin, Germany; 2012.
9. Priss U. Formal concept analysis in information science. Blaise C, ed. Annual Review of Information Science and Technology. ASIST. Chichester, West Sussex: John Wiley & Sons; 2006, 40.
10. Tilley T. Tool support for FCA. Eklund P, ed. Proceedings of the 2nd ICFCA, Lect Notes Artif Intell 2961; February 23-26; Sydney, Australia. Berlin, Heidelberg: Springer; 2004, 104-111.
11. Tilley T, Cole R, Becker P, Eklund P. A survey of formal concept analysis support for software engineering activities. Ganter B, Godin R, eds. Formal Concept Analysis, LNAI 3626; February 14-18; Lens, France. Berlin, Heidelberg: Springer; 2005, 250-271.
12. Lakhal L, Stumme G. Efficient mining of association rules based on formal concept analysis. Ganter B, Godin R, eds. Formal Concept Analysis, LNAI 3626; February 14-18; Lens, France. Berlin, Heidelberg: Springer; 2005, 180-195.
13. Doerfel S, Jäschke R, Stumme G. Publication analysis of the FCA community. ICFCA, Lect Notes Comput Sci 7278; May 06-10; Leuven, Belgium. Berlin, Heidelberg: Springer; 2012, 77-95.
14. Baader F, Calvanese D, McGuinness D, Nardi D, Patel-Schneider PF, eds. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press; 2003.
15. Sowa JF. Conceptual Structures: Information Processing in Mind and Machine. Reading, MA: Addison-Wesley; 1984.
16. Agrawal R, Imieliński T, Swami A. Mining association rules between sets of items in large databases. ACM SIGMOD Rec 1993, 22:207-216.
17. Pawlak Z. Rough sets. Int J Comput Inf Sci 1982, 11:341-356.
18. Mirkin B. Mathematical Classification and Clustering. Boston, MA/Dordrecht, The Netherlands: Kluwer Academic Publisher; 1996.
19. Ganter B, Wille R. Formal Concept Analysis. Mathematical Foundations. Berlin, Heidelberg: Springer; 1999.
20. Maier D. The Theory of Relational Databases. Rockville: Computer Science Press; 1983.
21. Guigues J-L, Duquenne V. Familles minimales d'implications informatives résultant d'un tableau de données binaires. Math Sci Hum 1986, 95:5-18.
22. Kuznetsov SO. Interpretation on graphs and complexity characteristics of a search for specific patterns. Autom Document Math Ling 1989, 24:27-35.
23. Kuznetsov SO, Obiedkov SA. Comparing performance of algorithms for generating concept lattices. J Exp Theor Artif Intell 2002, 14:189-216.
24. Kuznetsov SO. (2004) Machine learning and formal concept analysis. Eklund P, ed. Proceedings of the 2nd International Conference on Formal Concept Analysis, ICFCA'04, Lect Notes Artif Intell 2961; February 23-26; Sydney, Australia. Berlin, Heidelberg Springer; 2004, 287-312.
25. Distel F. An approach to exploring description logic knowledge bases. Kwuida L, Sertkaya B, eds. Proceedings of the 8th International Conference on Formal Concept Analysis, (ICFCA 2010), Vol. 5986 of Lecture Notes in Artificial Intelligence; March 15-18; Agadir, Morocco. Berlin, Heidelberg: Springer; 2010, 209-224.
26. Babin MA, Kuznetsov SO. Computing premises of minimal cover of functional dependencies is intractable. Discr Appl Math; 2013, 161:742-749.
27. Ganter B. Two Basic Algorithms in Concept Analysis, FB4-Preprint No. 831. TH-Darmstadt; 1984.
28. Bordat J-P. Calcul pratique du treillis de Galois d'une correspondance. Math Sci Hum 1986, 96:31-47.
29. Kuznetsov SO. A fast algorithm for computing all intersections of objects in a finite semi-lattice. Autom Document Math Ling 1993, 27:11-21.
30. Van der Merwe D, Obiedkov SA, Kourie DG. AddIntent: a new incremental algorithm for constructing concept lattices. ICFCA 2004, 2964:372-385.
31. Berry A, Bordat J-P, Sigayret A. A local approach to concept generation. Ann Math Artif Intell 2007, 49:117-136.
32. Valtchev P, Missaoui R, Godin R. A framework for incremental generation of closed itemsets. Discr Appl Math 2008, 156:924-949.
33. Krajca P, Vychodil V. Distributed algorithm for computing formal concepts using map-reduce framework. IDA; 2009, 333-344.
34. Outrata J, Vychodil V. Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data. Inf Sci 2012, 185:114-127.
35. Krajca P, Outrata J, Vychodil V. Computing formal concepts by attribute sorting. Fundam Inform 2012, 115:395-417.
36. Dias SM, Vieira N. Reducing the size of concept lattices: the JBOS approach. CLA 2010, 2010:80-91.
37. Ganter B, Kuznetsov SO. Scale Coarsening as Feature Selection. Medina R, Obiedkov SA, eds. ICFCA, Lect Notes Artif Intell 4933; February 25-28; Montreal, Canada. Berlin, Heidelberg: Springer; 2008, 217-228.
38. Snasel V, Polovincak M, Abdulla HMD, Horak Z. On concept lattices and implication bases from reduced contexts. ICCS Suppl; 2008, 83-90.
39. Belohlavek R. and Vychodil V. Factorizing Three-Way Binary Data with Triadic Formal Concepts. KES'10. Cardiff, UK/Berlin, Heidelberg: Springer; 2010, 471-480.
40. Belohlávek R, Vychodil V. Discovery of optimal factors in binary data via a novel method of matrix decomposition. J Comput Syst Sci 2010, 76:3-20.
41. Kuznetsov SO. Mathematical aspects of concept analysis. J Math Sci 1996, 80:1654-1698.
42. Pasquier N, Bastide Y, Taouil R, Lakhal L. Efficient mining of association rules using closed itemset lattices. Inf Syst 1999, 24:25-46.
43. Bastide Y, Pasquier N, Taouil R, Stumme G, Lakhal L. Mining minimal non-redundant association rules using frequent closed itemsets. Comput Logic 2000, 2000:972-986.
44. Ventos V, Soldano H. Alpha galois lattices: an overview. Ganter B, Godin R, eds., ICFCA, Lect Notes Artif Intell 3403; February 14-18; Lens, France. Berlin, Heidelberg: Springer; 2005, 299-314.
45. Jay N, Kohler F, Napoli A. Analysis of social communities with iceberg and stability-based concept lattices. Medina R, Obiedkov SA, eds. ICFCA, Lect Notes Artif Intell 4933; February 25-28; Montreal, Canada. Berlin, Heidelberg: Springer; 2008, 258-272.
46. Kuznetsov SO. Stability as an estimate of the degree of substantiation of hypotheses derived on the basis of operational similarity. Autom Document Math Ling 1990, 12:21-29.
47. Kuznetsov SO. On stability of a formal concept. Ann Math Artif Intell 2007, 49:101-115.
48. Klimushkin M, Obiedkov SA, Roth C. Approaches to the selection of relevant concepts in the case of noisy data. ICFCA; March 15-18; Agadir, Morocco. Berlin, Heidelberg: Springer; 2010, 255-266.
49. Babin MA, Kuznetsov SO. Approximating concept stability. Proceedings of the International Conference on Formal Concept Analysis (ICFCA 2012), Lect Notes Artif Intell 7278; 2012, 7-15.
50. Kuznetsov SO. Fitting pattern structures to Knowledge Discovery in Big Data. Cellier P, Distel F, Ganter B, eds. ICFCA 2013, Lect Notes Artif Intell 7880. Berlin, Heidelberg: Springer; 2013, 254-266.
51. Kuznetsov SO, Revenko AV. Finding errors in data tables: an FCA-based approach. Ann Math Artif Intell 2013.
52. Sertkaya B. A survey on how description logic ontologies benefit from FCA. Proceedings of CLA; 2010, 2-21.
53. Prediger S, Wille R. The lattice of concept graphs of a relationally scaled context. Proc ICCS 1999, LNAI 1640; July 12-15; Blacksburg, VA. Berlin, Heidelberg: Springer; 1999, 401-414.
54. Rouane-Hacene M, Huchard M, Napoli A, Valtchev P. A proposal for combining formal concept analysis and description logics for mining relational data. ICFCA; February 12-16; Clermont-Ferrand, France. Berlin, Heidelberg: Springer; 2007, 51-65.
55. Baader F, Ganter B, Sertkaya B, Sattler U. Completing description logic knowledge bases using formal concept analysis. Eklund P, eds. Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 2007); 2007, 230-235.
56. Baader F, Sertkaya B. Applying formal concept analysis to description logics. Eklund P, eds. Proceedings of the 2nd International Conference on Formal Concept Analysis (ICFCA 2004), Vol. 2961 of LNCS. Sydney, Australia: Springer; 2004, 261-286.
57. Rudolph S. Exploring relational structures via FLE. Wolff KE, Pfeiffer HD, Delugach HS, eds. ICCS, LNAI 3127; July 19-23; Huntsville, AL. Berlin, Heidelberg: Springer; 2004, 196-212.
58. Baader F, Distel F. Exploring finite models in the description logic ELgfp. Ferre S, Rudolph S, eds. Proceeding of the 7th International Conference on Formal Concept Analysis, (ICFCA 2009), LNAI 5548; 2009, 146-161.
59. Maio CD, Fenza G, Gaeta M, Loia V, Orciuoli F, Senatore S. RSS-based e-learning recommendations exploiting fuzzy FCA for knowledge modeling. Appl Soft Comput Elsevier 2012, 12:113-124.
60. Stumme G, Maedche A. FCA-Merge: bottom-up merging of ontologies. Proceeding of the IJCAI-2001 2001, 17:225-234.
61. Euzenat J, Valtchev P. Similarity-based ontology alignment in OWL-lite. Proceedings of 16th European Conference on Artificial Intelligence (ECAI); 2004, 333-337.
62. Hotho A, Staab S, Stumme G. Ontologies improve text document clustering. Proceedings of the IEEE International Conference on Data Mining (ICDM); 2003, 541-544.
63. Cimiano A, Hotho A., Staab S. Learning concept hierarchies from text corpora using formal concept analysis. J Artif Intell Res 2005, 24:305-339.
64. Kuznetsov SO, Obiedkov SA, Roth C. Reducing the representation complexity of lattice-based taxonomies. Priss U, Polovina S, Hill R, eds. Proceedings of the ICCS 2007, LNAI 4604; July 22-27; Sheffield, UK. Berlin, Heidelberg: Springer; 2007, 241-254.
65. Roth C, Obiedkov S, Kourie DG. On succint representation of knowledge community taxonomies with formal concept analysis. Int J Found Comput Sci 2008, 19:383-404.
66. Luxenburger M. Implications partielles dans un contexte. Math Inf Sci Hum 1991, 29:35-55.
67. Ben Yahia S, Hamrouni T, Nguifo EM. Frequent closed itemset based algorithms: a thorough structural and analytical survey. ACM SIGKDD Expl Newslett 2006, 8:93-104.
68. Boulicaut J-F. Condensed representations for data mining. Wang J, ed. Encyclopedia of Data Warehousing and Mining. Hershey, PA: Idea Group Reference; 2005, 207-211.
69. Gasmi G, Yahia SB, Nguifo EM, Slimani Y. IGB: a new informative generic base of association rules. PAKDD; 2005, 81-90.
70. Szathmary L, Napoli A, Kuznetsov SO. ZART: a multifunctional itemset mining algorithm. CLA; 2007.
71. Nguifo ME, Njiwoua P. IGLUE: A lattice-based constructive induction system. Intell Data Anal 2001, 5:73-91.
72. Fu H, Fu H, Njiwoua P, Nguifo EM. A comparative study of FCA-based supervised classification algorithms. ICFCA 2004, 2004:313-320.
73. Oosthuizen G. The application of concept lattices to machine learning. Technical Report CSTR 94/01. Pretoria, South Africa: Department of Computer Science, University of Pretoria; 1994.
74. Liquiere M, Mephu Nguifo E. LEGAL: LEarning with GAlois Lattice. Actes des Journees Francaises sur l'Apprentissage (JFA). Lannion, France; 1990, 93-113.
75. Carpineto C, Romano G. Galois: an order-theoretic approach to conceptual clustering. Proceedings of 10th International Conference on Machine Learning (ICML'93). Amherst, MA: Morgan Kaufmann; 1993, 33-40.
76. Sahami M. Learning classification rules using lattices. Crete H, Lavrac GN, Wrobel S, eds. Proceedings of ECML'95; Heraklion, Crete, Greece. Berlin, Heidelberg: Springer 1995, 343-346.
77. Xie Z, Hsu W, Liu Z, Lee M. Concept lattice based composite classifiers for high predictability. J Exp Theor Artif Intell 2002, 14:143-156.
78. Ganter B, Kuznetsov SO. Pattern structures and their projections. Stumme G, Delugach H, eds. Proceedings of 9th International Conference on Conceptual Structures, ICCS'01. LNAI, 2120; July 30-August 3, 2001; Stanford University, CA. Berlin, Heidelberg: Springer 2001, 129-142.
79. Ganter B, Kuznetsov SO. Hypotheses and version spaces. de Moor A, Lex W, Ganter B, eds. ICCS. LNAI 2746. July 21-25; Dresden, Germany, Berlin, Heidelberg: Springer; 2003, 83-95.
80. Ricordeau M. Q-Concept-learning: generalization with concept lattice representation in reinforcement learning. ICTAI 2003, 2003:316-323.
81. Maddouri M. Towards a machine learning approach based on incremental concept formation. Intell Data Anal 2004, 8:267-280.
82. Rudolph S. Using FCA for encoding closure operators into neural networks. Priss U, Polovina S, Hill R, eds. Proceedings of the 15th International Conference on Conceptual Structures: Knowledge Architectures for Smart Applications (ICCS '07). Berlin, Heidelberg: Springer-Verlag; 2007, 321-332.
83. Tsopze N, Mephu Nguifo E, Tindo G. CLANN: concept-lattices-based artificial neural networks. Diatta J, Eklund P, Liquiére M, eds. Proceedings of Fifth International Conference on Concept Lattices and Applications (CLA 2007). Montpellier, France: University of Montpellier; 2007, 157-168.
84. Belohlavek R, De Baets B, Outrata J, Vychodil V. Inducing decision trees via concept lattices. Int J Gen Syst 2009, 38:455-467.
85. Lindig C. Fast concept analysis, Working with Conceptual Structures-Contributions to ICCS 2000; August 14-18; Darmstadt, Germany. Aachen, Germany: Shaker Verlag; 2000, 152-161.
86. Outrata J. Boolean factor analysis for data preprocessing in machine learning. Proceedings of the 2010 Ninth International Conference on Machine Learning and Applications (ICMLA '10). Washington, DC: IEEE Computer Society; 2010, 899-902.
87. Visani M, Bertet K, Ogier J-M. NAVIGALA: an original symbol classifier based on navigation through a galois lattice. Int J Pattern Recogn Artif Intell 2011; 25:449-473.
88. Madeira S, Oliveira A. Biclustering algorithms for biological data analysis: a survey. IEEE/ACM Trans Comput Biol Bioinform 2004, 1:24-45.
89. Hartigan JA. Direct clustering of a data matrix. J Am Stat Assoc 1972, 67:123-129.
90. Cheng Y, Church G. Biclustering of expression data. Altman R, Bailey TL, Bourne P, Gribskov M, Lengauer T, Shindyalov IN, Ten Eyck LF, Weissig H, eds. Proceeding of the 8th International Conference on Intelligent Systems for Molecular Biology (ISBM); August 16-23, 2000, La Jolla, CA. Menlo Park, CA: AAAI Press 2000, 93-103.
91. Adomavicius C, Tuzhilin A. Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions. IEEE Trans Knowl Data Eng 2005, 17:734-749.
92. Ignatov DI, Kuznetsov SO, Poelmans J. Concept-based biclustering for internet advertisement. Vreeken J, Ling C, Zaki MJ, Siebes A, Yu JX, Goethals B, Webb GI, Wu X, eds. ICDM Workshops IEEE Computer Society. Brussels, Belgium; 2012, 123-130.
93. Prelic S, Zimmermann BP, Wille A, Buhlmann P, Gruissem W, Hennig L, Thiele L, Zitzler E. A systematic comparison and evaluation of biclustering methods for gene expression data. Bioinformatics 2006, 22:1122-1129.
94. Kaytoue M, Kuznetsov SO, Macko J, Napoli A. Biclustering Meets Formal Concept Analysis, Annals of Mathematics and Artificial Intelligence, 2013.
95. Pensa RG, Leschi C, Besson J, Boulicaut J-F. Assessment of discretization techniques for relevant pattern discovery from gene expression data. Zaki MJ, Morishita S, Rigoutsos I, eds. Proceedings of the 4th ACM SIGKDD Workshop on Data Mining in Bioinformatics (BIOKDD 2004); August 22nd; Seattle, WA: ACM Press; 2004, 24-30.
96. Besson J, Robardet C, Raedt LD, Boulicaut J-F. Mining bi-sets in numerical data. Dzeroski S, Struyf J, eds. KDID, LNCS 4747. Berlin, Heidelberg: Springer; 2007, 11-23.
97. Cerf L, Besson J, Robardet C, Boulicaut J-F. Closed patterns meet n-ary relations. Trans Knowl Discov Data 2009, 3.
98. Wille R. The basic theorem of triadic concept analysis. Order 1995, 12:149-158.
99. Voutsadakis G. Polyadic concept analysis. Order 2002, 19:295-304.
100. Yao YY. A comparative study of formal concept analysis and rough set theory in data analysis. Tsumoto S, Slowinski R, Komorowski HJ, Grzymala-Busse JW, eds. RSCTC, LNAI 3066; June 1-5; Uppsala, Sweden. Berlin, Heidelberg: Springer; 2004, 59-68.
101. Kent RE. Rough concept analysis: a synthesis of rough sets and formal concept analysis. Fundam Inform 1996, 27:169-181.
102. Saquer J, Deogun JS. Concept approximations based on rough sets and similarity measures. Int. J Appl Math Comput Sci 2001, 11:655-674.
103. Ganter B. Lattices of rough set abstractions as P-products. Medina R, Obiedkov SA, eds. ICFCA, LNAI 4933; February 25-28; Montreal, Canada. Berlin, Heidelberg: Springer; 2008, 199-216.
104. Meschke C. Approximations in concept lattices. Kwuida L, Sertkaya B, eds. Proceedings of the 8th International Conference on Formal Concept Analysis (ICFCA'10). Berlin, Heidelberg: Springer; 2010, 104-123.
105. Ganter B, Meschke C. A formal concept analysis approach to rough data tables. Trans Rough Sets 2011, 14:37-36.
106. Ganter B, Wille R. Conceptual scaling. Roberts F, ed. Applications of Combinatorics and Graph Theory to the Biological and Social Sciences. Berlin, Heidelberg: Springer; 1989, 139-167.
107. Kuznetsov SO. JSM-method as a machine learning method. Itogi Nauki i Tekhniki, ser. Informatika 1991, 15:17-50 (in Russian).
108. Kuznetsov SO. Learning of simple conceptual graphs from positive and negative examples. Zytkow JM, Rauch J, eds. Proceedings of the PKDD 1999, LNAI 1704; September 15-18; Prague, Czech Republic. Berlin, Heidelberg: Springer; 1999, 384-391.
109. Liquiere M, Sallantin J. Structural machine learning with galois lattice and graphs. Proceedings of 15th International Conference on Machine Learning; July 24-27. Madison, WI: Morgan Kaufmann; 1998.
110. Ferré S, Ridoux O. Introduction to logical information systems. Inf Process Manage 2004, 40:383-419.
111. Chaudron L, Maille N. From students to approximately reasoning agents. Skowron A, Komorowski J, eds. Proceedings of ECAI'98 Workshop on Synthesis of Intelligent Agent Systems from Experimental Data. Brighton, UK; 1998.
112. Chaudron L, Maille N, Boyer M. The cube lattice model and its applications. Appl Artif Intell 2003, 17:207-242.
113. Wille R. Conceptual graphs and formal concept analysis. ICCS; August 3-8; Seattle, WA. Berlin, Heidelberg: Springer; 1997, 290-303.
114. Huchard M, Roume C, Valtchev P. When concepts point at other concepts: the case of UML diagram reconstruction. Duquenne V, Ganter B, Liquière M, Mephu E, Stumme Nguifo et G, eds. Proceeding of FCAKDD 2002, Advances in Formal Concept Analysis for Knowledge Discovery in Databases', International Workshop ECAI 2002. Lyon: University of Lyon; 2002, 32-43.
115. Huchard M, Rouane-Hacene M, Roume C, Valtchev P. Relational concept discovery in structured datasets. Ann Math Artif Intell 2007, 49:39-76.
116. Ferré S, Ridoux O, (2000) A logical generalization of formal concept analysis. ICCS; August 14-18; Darmstadt, Germany. Berlin, Heidelberg: Springer; 2000, 371-384.
117. Lehmann F, Wille R. A triadic approach to formal concept analysis. ICCS; August 14-18; Santa Cruz, CA. Berlin, Heidelberg: Springer; 1995, 32-43.
118. Pollandt S. Fuzzy Begriffe. Berlin, Heidelberg: Springer; 1997.
119. Belohlavek R. Fuzzy Galois connections. Math Logic Q 1999, 45:497-504.
120. Georgescu G, Popescu A. Concept lattices and similarity in non-commutative fuzzy logic. Fundam Inform 2002, 55:23-54.
121. Prediger S. Nested concept graphs and triadic power context families. ICCS. Berlin, Heidelberg: Springer; 2000, 249-262.
122. Groh B, Eklund PW. Algorithms for creating relational power context families from conceptual graphs. ICCS; July 12-15; Blacksburg, VA. Berlin, Heidelberg: Springer; 1999, 389-400.
123. Dau F. The Logic System of Concept Graphs with Negation: And its Relationship to Predicate Logic. Lecture Notes in Artificial Intelligence. Berlin, Heidelberg: Springer; 2004, 2892.
124. Dau, F, Klinger J. From formal concept analysis to contextual logic. Stumme G, ed. Formal Concept Analysis: The State of the Art. First International Conference on Formal Concept Analysis. Darmstadt, Germany, 2003, Proceedings of the LNCS 3626. Heidelberg-BerlSpringer; 2005, 81-100.
125. Wille R. Boolean Judgment Logic. ICCS; July 30-August 3; Stanford University, CA. Berlin, Heidelberg: Springer; 2001, 115-128.
126. Wille R. Implicational Concept Graphs. ICCS; July 19-23; Huntsville, AL. Berlin, Heidelberg: Springer; 2004, 52-61.
127. Dolques X, Huchard M, Nebut C, Reitz P. Fixing generalization defects in UML use case diagrams. Fundam Inform 2012, 115:327-356.
128. Ganter B, Grigoriev PA, Kuznetsov SO, Samokhin MV. Concept-based data mining with scaled labeled graphs. Wolff KE, Pfeiffer HD, Delugach HS, eds. ICCS, LNAI 3127; July 19-23; Huntsville, AL. Berlin, Heidelberg: Springer; 2004, 94-108.
129. Kuznetsov SO. Pattern Structures for Analyzing Complex Data. Sakai H, Chakraborty MK, Hassanien AE, Slezak D, Zhu W, eds. Proceeding of the 12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC'09), LNAI 5908; December 15-18; Delhi, India. Berlin, Heidelberg: Springer; 2009, 33-44.
130. Assaghir Z, Napoli A, Kaytoue M, Dubois D, Prade H. Numerical information fusion: lattice of answers with supporting arguments. ICTAI; 2011, 621-628.
131. Pfaltz JL. Representing numeric values in concept lattices. Diatta J, Eklund P, Liquière M, eds. Proceedings of the CLA 2007. LIRMM & University of Montpellier II.
132. Valverde-Albacete FJ, Peláez-Moreno C. Extending conceptualisation modes for generalised formal concept analysis. Inform Sci Elsevier 2011, 181:1888-1909.
133. Gonzalez Calabozo JM, Peláez-Moreno C, Valverde-Albacete FJ. Gene expression array exploration using K-formal concept analysis. ICFCA; May 2-6; Nicosia, Cyprus. Berlin, Heidelberg: Springer; 2011, 119-134.
134. Bain M. Inductive construction of ontologies from formal concept analysis. Aust Conf Artif Intell 2003, 88-99.
135. Wolff KE. States, transitions and life tracks in temporal concept analysis. Ganter B, et al., eds. Formal Concept Analysis, LNAI 3626. Berlin, Heidelberg: Springer; 2005, 127-148.
136. Wolff KE. Temporal relational semantic systems. Croitoru M, Ferre S, Lukose D, eds., Conceptual Structures: From Information to Intelligence. ICCS 2010. LNAI 6208. Heidelberg: Springer; 2010, 165-180.
137. Ganter B. Attribute exploration with background knowledge. Theor Comput Sci 1996, 217:215-233.
138. Belohlavek R, Vychodil V. Formal concept analysis with background knowledge: attribute priorities. IEEE Trans Syst Man Cybern 2009, 39.
139. Pogel A, Ozonoff D. Contingency structures and concept analysis. Medina R, Obiedkov SA, eds. ICFCA, LNAI 4933; February 25-28; Montreal, Canada. Berlin, Heidelberg: Springer; 2008, 305-320.
140. Deogun J, Jiang L, Xie Y, Raghavan V. Probability logic modeling of knowledge discovery in databases. Zhong N, Ras ZW, Tsumoto S, Suzuki E, eds. ISMIS, LNAI 2871; October 28-31; Maebashi City, Japan. Berlin, Heidelberg: Springer; 2003, 402-407.
141. Cellier P, Ferré S, Ridoux O, Ducassé M. A parameterized algorithm to explore formal contexts with a taxonomy. Int J Found Comput Sci 2008, 19:319-343.
142. Stumme G. A finite state model for on-line analytical processing in triadic contexts. Ganter B, Godin R, eds. ICFCA, LNCS 3403; February 14-18; Lens, France. Berlin, Heidelberg: Springer; 2005, 315-328.
143. Jäschke R, Hotho A, Schmitz C, Ganter B, Stumme G. Discovering shared conceptualizations in folksonomies. Web Seman 2008, 6:38-53.
144. Ji L, Tan K-L, Tung AKH. Mining frequent closed cubes in 3D datasets, in VLDB '06. VLDB Endowment; 2006, 811-822.
145. Besson J, Robardet C, Boulicaut J-F, Rome S. Constraint-based concept mining and its application to microarray data analysis. Intell Data Anal 2005, 9:59-82.
146. Zhao L, Zaki MJ. TriCluster: an effective algorithm for mining coherent clusters in 3D microarray data. ACM Press SIGMOD International Conference on Management of Data (ACM SIGMOD'05); June 13-16; Baltimore, Maryland: ACM Press 2005, 694-705.
147. Biedermann K. How triadic diagrams represent conceptual structures. ICCS; 1997:304-317.
148. Ganter B, Obiedkov SA. Implications in triadic formal contexts. ICCS 2004, 186-195.
149. Glodeanu CV. Fuzzy-valued triadic implications. Napoli A, Vychodil V, eds. CLA 2011 INRIA Nancy-Grand Est and LORIA; 2011, 159-173.
150. Missaoui R. and Kwuida L. Mining triadic association rules from ternary relations. Valtchev P, Jaschke R, eds. ICFCA, Vol. 6628 of LNCS; May 2-6; Nicosia, Cyprus. Berlin, Heidelberg: Springer; 2011, 204-218.
151. Ignatov DI, Kuznetsov SO, Poelmans J, Zhukov LE. Can triconcepts become triclusters? Int J Gen Syst 2013.
152. Trabelsi C, Jelassi N, Ben Yahia S. Scalable mining of frequent tri-concepts from folksonomies. PAKDD; 2012, 231-242.
153. Burusco A, Fuentes-Gonzalez R. The study of L-fuzzy concept lattice. Mathw Soft Comput 1994, 3:209-218.
154. Belohlavek R. Fuzzy concepts and conceptual structures: induced similarities. Joint Conference on Information Sciences '98 Proceedings, Vol. I. Durham, NC; 1998, 179-182.
155. Belohlavek R. Fuzzy closure operators. J Math Anal Appl 2001, 262:473-489.
156. Belohlavek R. Fuzzy Relational Systems: Foundations and Principles. New York: Kluwer; 2002.
157. Belohlavek R, Vychodil V. Attribute implications in a fuzzy setting. Missaoui R, Schmid J, eds. ICFCA, LNAI 3874; Feburary 13-17. Berlin, Heidelberg: Springer; 2006, 45-60.
158. Belohlavek R. Concept lattices and order in fuzzy logic. Ann Pure Appl Logic 2004, 128:277-298.
159. Kridlo O, Krajci S. Proto-fuzzy concepts, their retrieval and usage radim belohlavek. Kuznetsov SO, ed. Olomouc: CLA Palacky University; 2008, 83-95.
160. Medina J, Ojeda-Aciego M, Ruiz-Calviño J. Formal concept analysis via multi-adjoint concept lattices. Fuzzy Sets Syst 2009, 160:130-144.
161. Pankratieva VV, Kuznetsov SO. Relations between proto-fuzzy concepts, crisply generated fuzzy concepts, and interval pattern structures. Fundam Inform 2012, 115:265-277.
162. Cuvelier E, Aufaure MA. A buzz and E-reputation monitoring tool for twitter based on galois lattices. ICCS; 2011, 91-103.
163. Blinova VG, Dobrynin DA, Finn VK, Kuznetsov SO, Pankratova ES. Toxicology analysis by means of the JSM-method. Bioinformatics 2003, 19:1201-1207.
164. Godin R, Missaoui R. An incremental concept formation approach for learning from databases. Theor Comput Sci 1994, 133:387-419.
165. Yevtushenko SA. System of data analysis "Concept Explorer". Proceedings of the 7th National Conference on Artificial Intelligence KII-2000. 2000, 127-134 (in Russian).
166. Valtchev P, Grosser D, Roume C. Mohamed Rouane Hacene. GALICIA: an open platform for lattices, in Using Conceptual Structures: Contributions to the 11th Intl. Conference on Conceptual Structures (ICCS'03); July 21-25; Dresden, Germany, Shaker Verlag; 2003, 241-254.
167. Becker P, Hereth J, Stumme G. ToscanaJ: An Open Source Tool for Qualitative Data Analysis, Proc. Workshop FCAKDD of the 15th European Conference on Artificial Intelligence (ECAI 2002); Lyon, France; 2002.
168. Priss U. FcaStone-FCA file format conversion and interoperability software. Conceptual Structures Tool Interoperability Workshop (CS-TIW); 2008.
169. Lahcen B, Kwuida L. Lattice miner: a tool for concept lattice construction and exploration. Boumedjout L, Valtchev P, Kwuida L, Sertkaya B, eds. Supplementary Proceedings of the International Conference on Formal Concept Analysis (ICFCA'10); March 15-18. Agadir, Morocco: University of Quebec 2010.
170. Borza PV, Sabou O, Sacarea C. OpenFCA, an open source formal concept analysis toolbox. Proceedings of IEEE International Conference on Automation Quality and Testing Robotics (AQTR); 28-30 May. Cluj Napoca, Romania: IEEE Press 2010, 1-5.
171. Neznanov AA, Kuznetsov SO. Information retrieval and knowledge discovery with FCART. Proceedings of the Formal Concept Analysis Meets Information Retrieval, Moscow; 2013.