Abstract | ||
---|---|---|
. This paper presents a new similarity metric and algorithmfor situations represented as graphs. The metric is based on the conceptof shared information, and there is discussion of how this would apply fordifferent forms of similarity---including surface, structural and thematicsimilarity. An algorithm is presented which will determine the similarityof two conceptual graphs for any given measure of information content,which can, as a result, be used for any similarity measure that is... |
Year | DOI | Venue |
---|---|---|
1995 | 10.1007/3-540-60161-9_45 | ICCS |
Keywords | Field | DocType |
matching conceptual,related graphs,novel algorithm,conceptual graph,surface structure | Graph,Application specific,Similarity measure,Computer science,Conceptual graph,Algorithm,Thematic map,State graph,Time complexity | Conference |
Volume | ISBN | Citations |
954 | 3-540-60161-9 | 25 |
PageRank | References | Authors |
3.26 | 8 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jonathan Poole | 1 | 26 | 3.62 |
J. A. Campbell | 2 | 40 | 14.24 |