Name
Abstract | ||
|---|---|---|
This paper presents a combinatorial, structure based approach to the problem of finding a (di)similarity measure between two Conceptual Graphs. With a growing number of ontologies and an increasing need for quick, on the fly knowledge integration and querying, ontology similarity measures are essential for building the foundations of the Semantic Web. Conceptual Graphs benefit from a graph based representation that can be exploited in versatile optimisation techniques. We propose a disimilarity measure based on the content and the structure of two graphs. This disimilarity measure is based on the clique number of the matching graph, a combinatorial structure which encodes the two graphs projection information. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-73681-3_12 | ICCS |
Keywords | Field | DocType |
graphs projection information,ontology similarity measure,clique number,conceptual graphs,similarity measure,matching graph,semantic web,combinatorial structure,disimilarity measure,conceptual graphs benefit,conceptual graph,knowledge integration | Semantic similarity,Ontology (information science),Data mining,Ontology,Graph,Mathematical optimization,Knowledge integration,Similarity measure,Computer science,Conceptual graph,Semantic Web,Theoretical computer science | Conference |
Volume | ISSN | Citations |
4604 | 0302-9743 | 7 |
PageRank | References | Authors |
0.52 | 6 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Madalina Croitoru | 1 | 91 | 10.24 |
| Bo Hu | 2 | 161 | 27.21 |
| Srinandan Dashmapatra | 3 | 29 | 2.35 |
| Paul Lewis | 4 | 175 | 16.00 |
| David Dupplaw | 5 | 257 | 26.86 |
| Liang Xiao | 6 | 431 | 65.25 |