论文信息 - Comparison of Conceptual Graphs

Comparison of Conceptual Graphs

In intelligent knowledge-based systems, the task of approximate matching of knowledge elements has crucial importance. We present the algorithm of comparison of knowledge elements represented with conceptual graphs. The method is based on well-known strategies of text comparison, such as Dice coefficient, with new elements introduced due to the bipartite nature of the conceptual graphs. Examples of comparison of two pieces of knowledge are presented. The method can be used in both semantic processing in natural language interfaces and for reasoning with approximate associations.

[1] Iadh Ounis,et al. Conceptual Graph Aboutness , 1996, ICCS.

[2] John F. Sowa,et al. Conceptual Structures: Fulfilling Peirce's Dream , 1997, Lecture Notes in Computer Science.

[3] Alexander F. Gelbukh,et al. Document Title Patterns in Information Retrieval , 1999, TSD.

[4] Vincent Kanade,et al. Clustering Algorithms , 2021, Wireless RF Energy Transfer in the Massive IoT Era.

[5] Sung Hyon Myaeng. Conceptual Graph Matching as a Plausible Inferencing Technique for Text Retrieval , 1990 .

[6] John F. Sowa,et al. Conceptual Structures: Current Practices , 1994, Lecture Notes in Computer Science.

[7] John F. Sowa,et al. Knowledge representation: logical, philosophical, and computational foundations , 2000 .

[8] Ricardo Baeza-Yates,et al. Information Retrieval: Data Structures and Algorithms , 1992 .

[9] Michel Chein,et al. An Experiment in Document Retrieval Using Conceptual Graphs , 1997, ICCS.

[10] John F. Sowa,et al. Conceptual Structures: Information Processing in Mind and Machine , 1983 .

[11] Aurelio López-López,et al. Conceptual graph matching: a flexible algorithm and experiments , 1992, J. Exp. Theor. Artif. Intell..

[12] Yehuda Lindell,et al. Text Mining at the Term Level , 1998, PKDD.

[13] Gerard Ellis,et al. Exploiting the Induced Order on Type-Labeled Graphs for Fast Knowledge Retrieval , 1994, ICCS.