Cmap
A Concept Map Scoring Algorithm Based On Proposition Chains For Concept Mapping

Yao, Qian and Yang, Kaicheng and Zhao, Guoqing and Huang, Ronghuai (2006) A Concept Map Scoring Algorithm Based On Proposition Chains For Concept Mapping. In: Concept Maps: Theory, Methodology, Technology. Proc. of the Second Int. Conference on Concept Mapping. Universidad de Costa Rica, San José, Costa Rica, pp. 8-15. ISBN 9977-15-148-2

[img]
Preview
PDF - Published Version
Download (1MB) | Preview
Official URL: http://cmc.ihmc.us

Abstract

Concept maps are widely used in education and have a significant impact on teaching and learning, but it’s really a challenge for teachers and researchers to assess concept maps both efficiently and effectively. Computer-based Concept Mapping Systems (CCMS) have been developed to assess concept maps automatically. However, current scoring methods applied in the CCMS mainly focus on the match of concept nodes, relation links or each separate proposition, paying little attention to the relationship between propositions. In this paper we propose a novel scoring algorithm based on Proposition Chains. Considering concept maps as directed graphs, we define a Proposition Chain as a linked list consisted of all the propositions in one of the longest paths in the graph, thus it can show the relationship among a group of propositions. We aim to solve some problems existing in previous scoring methods and we believe that the proposed scoring algorithm can be easily applied in the CCMS because of its simple storage structure and explicit scoring procedure.

Item Type: Book Section
Uncontrolled Keywords: Paper, CMC2006
Subjects: L Education > L Education (General)
Q Science > QA Mathematics > QA76 Computer software
Divisions: UNSPECIFIED
Depositing User: Mr. Ernest Prats
Date Deposited: 04 Oct 2012 21:12
Last Modified: 05 Oct 2012 22:21
URI: http://eprint.ihmc.us/id/eprint/288

Actions (login required)

View Item View Item