A graph matching algorithm and its application to conceptual system translation

International Journal on Artificial Intelligence Tools

Volumn 14, Issue 1-2, 2005, Pages 77-99

  Feng, Ying ^a   Goldstone, Robert L ^a   Menkov, Vladimir ^b  

^a INDIANA UNIVERSITY   (United States)

^b Aqsaqal Enterprises   (Canada)

Author keywords

Conceptual systems; Graph matching; Knowledge representation; Ontology translation

Indexed keywords

EID: 33746253333     PISSN: 02182130     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218213005002004     Document Type: Conference Paper

References (15)

1. J. Fodor. Concepts: where cognitive science went wrong. Clarendon Press, 1998.
2. D.B. Lenat and E.A. Feigenbaum. On the thresholds of knowledge. Artificial Intelligence, 47:185-250, 1991.
3. Robert L. Goldstone and Brian J. Rogosky. Using relations within conceptual systems to translate across conceptual systems. Cognition, pages 295-320, 2002.
4. Robert L. Goldstone, Ying Feng, and Brian J. Rogosky. Connecting concepts to each other and the world. In Diane Pecher and Rolf Zwaan, editors, Grounding cognition: The role of perception and action in memory, language, and thinking. Cambridge University Press, 2005.
5. Bruno T. Messmer. Efficient Graph Matching Algorithms. PhD thesis, Universität Bern, 1995.
6. Steven Gold and Anand Rangarajan. A graduated assignment algorithm for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(4):377-388, 1996.
7. A. Rangarajan and E. Mjolsness. A Lagrangian relaxation network for graph matching. In Proc. Int. Conf. Neural Networks, volume 7, pages 4629-4634. Inst. Electrical & Electronics Engineers, 1994.
8. Marcello Pelillo. Replicator equations, maximal cliques, and graph isomorphism. Neural Computation, 11:1933-1955, 1999.
9. Kristina Schadler and Fritz Wysotzki. A connectionist approach to structural simiarity determination as a basis of clustering, classification and feature detection. In Principles of Data Mining and Knowledge Discovery, pages 254-264, 1997.
10. Kristina Schädler and Fritz Wysotzki. Comparing structures using a Hopfield-style neural network. Applied Intelligence, 11:15-30, 1999.
11. Sergey Melnik, Hector Garcia-Molina, and Erhard Rahm. Similarity flooding: a versatile graph matching algorithm and its application to schema matching. In 18th International Conference on Data Engineering (ICDE), pages 117-128, 2002.
12. Michael T. Heath. Scientific Computing: An Introductory Survey. McGraw-Hill, New York, 2002.
13. Ying Feng, Robert L. Goldstone, and Vladimir Menkov. The ABSURDIST algorithm for matching concept systems as a converging optimization method, 2004. Preliminary version. Available at http://www.cs.indiana.edu/~yingfeng/ ABSURDIST/.
14. Ying Feng, Robert L. Goldstone, and Vladimir Menkov. ABSURDIST II: A graph matching algorithm and its application to conceptual system translation. In Valerie Barr and Zdravko Markov, editors, Proceedings of the Seventeenth International Florida Artificial Intelligence Research Symposium Conference, Miami Beach, Fla., USA, pages 640-645. AAAI Press, 2004.
15. B. Messmer and H. Bunke. Fast error-correcting graph isomorphism based on model precompilation. Technical report, Institut fur Informatik, Universität Bern, 1996.