Sciweavers

FLAIRS
2004

ABSURDIST II: A Graph Matching Algorithm and its Application to Conceptual System Translation

13 years 11 months ago
ABSURDIST II: A Graph Matching Algorithm and its Application to Conceptual System Translation
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.
Ying Feng, Robert L. Goldstone, Vladimir Menkov
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2004
Where FLAIRS
Authors Ying Feng, Robert L. Goldstone, Vladimir Menkov
Comments (0)