Name
Abstract | ||
|---|---|---|
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal structure of systems by itself, or in combination with external information about concept similarities across systems. It supports systems with multiple types of weighted or unweighted, directed or undirected relations between concepts. The algorithm exploits graph sparsity to improve computational efficiency. We present the results of experiments with a number of conceptual systems, including artificially constructed random graphs with introduced distortions. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1142/S0218213005002004 | INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS |
Keywords | Field | DocType |
conceptual systems, graph matching, ontology translation, knowledge representation | Random graph,Computer science,Conceptual system,Theoretical computer science,Artificial intelligence,Conceptual graph,Algorithm,Matching (graph theory),Null graph,Wait-for graph,Machine learning,Graph (abstract data type),Moral graph | Journal |
Volume | Issue | ISSN |
14 | 1-2 | 0218-2130 |
Citations | PageRank | References |
5 | 0.44 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ying Feng | 1 | 9 | 1.06 |
| Robert L. Goldstone | 2 | 154 | 39.53 |
| Vladimir Menkov | 3 | 82 | 9.22 |