Galois Connections in Data Analysis: Contributions from the Soviet Era and Modern Russian Research

A retrospective survey of several research directions at the All-Soviet (now All-Russia) Institute for Scientific and Technical Information (VINITI), as well as research represented in several VINITI editions, is proposed. In a number of papers of the 1970-1980s, taxonomies (classifications) were naturally considered as lattices. Several problems of classification required consideration of tolerance relations as a model of similarity of objects. Such relations define symmetric formal contexts. A JSM-method of inductive plausible reasoning, which has been developed at VINITI since the early 1980s, is considered in terms of Galois connections and concept lattices. Mathematical research around the JSM-method and its applications is discussed.

[1]  Derrick G. Kourie,et al.  AddIntent: A New Incremental Algorithm for Constructing Concept Lattices , 2004, ICFCA.

[2]  Bernhard Ganter,et al.  Conceptual Structures: Logical, Linguistic, and Computational Issues , 2000, Lecture Notes in Computer Science.

[3]  W. L. Davidson.  IV.—THE LOGIC OF CLASSIFICATION , 1887 .

[4]  V. K. Finn,et al.  On axiomatization of many-valued logics associated with formalization of plausible reasonings , 1989, Stud Logica.

[5]  Bernhard Ganter,et al.  Hypotheses and Version Spaces , 2003, ICCS.

[6]  Morris W. Hirsch,et al.  Topology of 3-Manifolds and Related Topics. , 1964 .

[7]  Bernhard Ganter,et al.  Pattern Structures and Their Projections , 2001, ICCS.

[8]  Sergei O. Kuznetsov,et al.  Learning of Simple Conceptual Graphs from Positive and Negative Examples , 1999, PKDD.

[9]  David Maier,et al.  The Theory of Relational Databases , 1983 .

[10]  Tom M. Mitchell,et al.  Generalization as Search , 2002 .

[11]  Merrie Bergmann,et al.  On a three-valued logical calculus and its application to the analysis of the paradoxes of the classical extended functional calculus , 1981 .

[12]  Dagobert Soergel,et al.  Mathematical analysis of documentation systems : An attempt to a theory of classification and search request formulation , 1967, Inf. Storage Retr..

[13]  Bernhard Ganter,et al.  Conceptual Structures for Knowledge Creation and Communication , 2003, Lecture Notes in Computer Science.

[14]  Sergei O. Kuznetsov,et al.  Comparing performance of algorithms for generating concept lattices , 2002, J. Exp. Theor. Artif. Intell..

[15]  Boris A. Galitsky,et al.  Analyzing Conflicts with Concept-Based Learning , 2005, ICCS.

[16]  Harry S. Delugach,et al.  Conceptual Structures at Work , 2004, Lecture Notes in Computer Science.

[17]  Rudolf Wille,et al.  Conceptual Structures of Multicontexts , 1996, ICCS.

[18]  Sergei A. Obiedkov,et al.  Modal Logic for Evaluating Formulas in Incomplete Contexts , 2002, ICCS.

[19]  Galia Angelova,et al.  Conceptual Structures: Integration and Interfaces , 2002, Lecture Notes in Computer Science.

[20]  J. Ross Quinlan,et al.  Induction of Decision Trees , 1986, Machine Learning.

[21]  Sergei O. Kuznetsov.  On Computing the Size of a Lattice and Related Decision Problems , 2001, Order.

[22]  Sergei O. Kuznetsov,et al.  Toxicology Analysis by Means of the JSM-method , 2003, Bioinform..

[23]  Olivier Ridoux,et al.  The Use of Associative Concepts in the Incremental Building of a Logical Context , 2002, ICCS.

[24]  Sergei O. Kuznetsov,et al.  Complexity of learning in concept lattices from positive and negative examples , 2004, Discret. Appl. Math..

[25]  Gerd Stumme,et al.  Conceptual Structures: Common Semantics for Sharing Knowledge. Proc. , 2005 .

[26]  Sergei O. Kuznetsov,et al.  Machine Learning and Formal Concept Analysis , 2004, ICFCA.

[27]  Haym Hirsh,et al.  Generalizing Version Spaces , 1994, Machine Learning.

[28]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[29]  Mike James,et al.  Classification Algorithms , 1986, Encyclopedia of Machine Learning and Data Mining.

[30]  Gerd Stumme,et al.  Conceptual Structures: Broadening the Base , 2001, Lecture Notes in Computer Science.

[31]  Bernhard Ganter,et al.  Formalizing Hypotheses with Concepts , 2000, ICCS.

[32]  Jan Komorowski,et al.  Principles of Data Mining and Knowledge Discovery , 2001, Lecture Notes in Computer Science.

[33]  Jean-Marie Nicolas.  Mutual Dependencies and Some Results on Undecomposable Relations , 1978, VLDB.

[34]  J. Mill.  A System of Logic , 1843 .

[35]  Bernhard Ganter,et al.  Concept-Based Data Mining with Scaled Labeled Graphs , 2004, ICCS.

[36]  Peter A. Grigoriev,et al.  Elements of an Agile Discovery Environment , 2003, Discovery Science.

[37]  Sergei O. Kuznetsov,et al.  Mathematical aspects of concept analysis , 1996 .

[38]  A. Tversky.  Features of Similarity , 1977 .

[39]  Sergei O. Kuznetsov,et al.  On a version of Mill's method of difference , 2002 .

[40]  Sergei O. Kuznetsov,et al.  Learning Closed Sets of Labeled Graphs for Chemical Applications , 2005, ILP.