Name
Title | ||
|---|---|---|
ABSURDIST II: A Graph Matching Algorithm and its Application to Conceptual System Translation |
Abstract | ||
|---|---|---|
ABSURDIST II, an extension to ABSURDIST, is an al- gorithm using attributed graph matching to find transla- tions 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 ef- ficiency. We present the results of experiments with a number of conceptual systems, including artificially constructed random graphs with introduced distortions. |
Year | Venue | Keywords |
|---|---|---|
2004 | FLAIRS Conference | random graph,graph matching |
Field | DocType | Citations |
Line graph,Graph property,Graph factorization,Computer science,Algorithm,Directed graph,Matching (graph theory),Null graph,Butterfly graph,Graph (abstract data type) | Conference | 4 |
PageRank | References | Authors |
0.62 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ying Feng | 1 | 9 | 1.06 |
| Robert L. Goldstone | 2 | 154 | 39.53 |
| Vladimir Menkov | 3 | 82 | 9.22 |