Development and application of a metric on semantic nets

Motivated by the properties of spreading activation and conceptual distance, the authors propose a metric, called distance, on the power set of nodes in a semantic net. Distance is the average minimum path length over all pairwise combinations of nodes between two subsets of nodes. Distance can be successfully used to assess the conceptual distance between sets of concepts when used on a semantic net of hierarchical relations. When other kinds of relationships, like 'cause', are used, distance must be amended but then can again be effective. The judgements of distance significantly correlate with the distance judgements that people make and help to determine whether one semantic net is better or worse than another. The authors focus on the mathematical characteristics of distance that presents novel cases and interpretations. Experiments in which distance is applied to pairs of concepts and to sets of concepts in a hierarchical knowledge base show the power of hierarchical relations in representing information about the conceptual distance between concepts. >

[1]  S. Y. Lu,et al.  A Tree-Matching Algorithm Based on Node Splitting and Merging , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  R Rada,et al.  A vocabulary for medical informatics. , 1987, Computers and biomedical research, an international journal.

[3]  David L. Waltz,et al.  Toward memory-based reasoning , 1986, CACM.

[4]  J. P. Schwartz,et al.  A Framework for Task Cooperation within Systems Containing Intelligent Components , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[5]  Dana S. Nau,et al.  Hierarchical representation of problem‐solving knowledge in a frame‐based process planning system , 1986, Int. J. Intell. Syst..

[6]  Lance J. Rips,et al.  Structure and process in semantic memory: A featural model for semantic decisions. , 1974 .

[7]  Richard Fikes,et al.  The role of frame-based representation in reasoning , 1985, CACM.

[8]  Davis B. McCarn Medline: An introduction to on-line searching , 1980, J. Am. Soc. Inf. Sci..

[9]  Peretz Shoval,et al.  Principles, procedures and rules in an expert system for information retrieval , 1985, Inf. Process. Manag..

[10]  Roy Rada,et al.  Ranking documents with a thesaurus , 1989, JASIS.

[11]  King-Sun Fu,et al.  A graph distance measure for image analysis , 1984, IEEE Transactions on Systems, Man, and Cybernetics.

[12]  Roy Rada,et al.  Merging Thesauri: Principles and Evaluation , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Beth Adelson,et al.  Comparing Natural and Abstract Categories: A Case Study from Computer Science , 1985, Cogn. Sci..

[14]  B. Adelson Comparing Natural and Abstract Categories: A Case Study from Computer Science. , 1985 .

[15]  Ronald J. Brachman,et al.  What IS-A Is and Isn't: An Analysis of Taxonomic Links in Semantic Networks , 1983, Computer.

[16]  Edward Fox,et al.  Extending the boolean and vector space models of information retrieval with p-norm queries and multiple concept types , 1983 .

[17]  A. D. Groot The range of automatic spreading activation in word priming , 1983 .

[18]  A. Ortony Beyond Literal Similarity , 1979 .

[19]  Roy Rada,et al.  Gradualness Facilitates Knowledge Refinement , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Ronald J. Brachman,et al.  An overview of the KL-ONE Knowledge Representation System , 1985 .

[21]  Walter Kintsch,et al.  Automatic and Strategic Aspects of Knowledge Retrieval , 1985, Cogn. Sci..

[22]  Allan Collins,et al.  A spreading-activation theory of semantic processing , 1975 .

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

[24]  R Rada,et al.  A Method of Medical Knowledge Base Augmentation , 1987, Methods of Information in Medicine.

[25]  J E Backus,et al.  Searching for patterns in the MeSH vocabulary. , 1987, Bulletin of the Medical Library Association.

[26]  Jean E. Sammet,et al.  The new (1982) Computing Reviews classification system—final version , 1982, CACM.

[27]  Sadaaki Miyamoto,et al.  Directed Graph Representations of Association Structures: A Systematic Approach , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[28]  Gerald M. Powell,et al.  Representing Operational Planning Knowledge , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[29]  Nripendra N. Biswas,et al.  Minimization of Boolean Functions , 1971, IEEE Transactions on Computers.

[30]  Nils S. Peterson,et al.  Representations of Perceived Relations among the Properties and Variables of a Complex System , 1987, IEEE Transactions on Systems, Man, and Cybernetics.