Element matching in concept maps
- Already Purchased? View Article
- Subscription Options Learn More
Concept maps (CM) are informal, semantic, node-link conceptual graphs used to represent knowledge in a variety of applications. Algorithms that compare concept maps would be useful in supporting educational processes and in leveraging indexed digital collections of concept maps. Map comparison begins with element matching and faces computational challenges arising from vocabulary overlap, informality, and organizational variation. Our implementation of an adapted similarity flooding algorithm improves matching of CM knowledge elements over a simple string matching approach.
Published in:
Digital Libraries, 2004. Proceedings of the 2004 Joint ACM/IEEE Conference on
Date of Conference: 7-11 June 2004