Matching knowledge elements in concept maps using a similarity flooding algorithm

作者:

Highlights:

摘要

Concept mapping systems used in education and knowledge management emphasize flexibility of representation to enhance learning and facilitate knowledge capture. Collections of concept maps exhibit terminology variance, informality, and organizational variation. These factors make it difficult to match elements between maps in comparison, retrieval, and merging processes. In this work, we add an element anchoring mechanism to a similarity flooding (SF) algorithm to match nodes and substructures between pairs of simulated maps and student-drawn concept maps. Experimental results show significant improvement over simple string matching with combined recall accuracy of 91% for conceptual nodes and concept → link → concept propositions in student-drawn maps.

论文关键词:Semantic matching,Concept mapping,Semantic networks,Conceptual graphs,Computer assisted instruction

论文评审过程:Received 4 May 2005, Revised 15 August 2005, Accepted 24 October 2005, Available online 29 November 2005.

论文官网地址:https://doi.org/10.1016/j.dss.2005.10.009