Attributed concept maps: fuzzy integration and fuzzy matching
A concept map, typically depicted as a connected graph, is composed of a collection of propositions. Each proposition forming a semantic unit consists of a small set of concept nodes interconnected to one another with relation links. Concept maps possess a number of appealing features which make the...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on cybernetics 2001-10, Vol.31 (5), p.842-852 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | A concept map, typically depicted as a connected graph, is composed of a collection of propositions. Each proposition forming a semantic unit consists of a small set of concept nodes interconnected to one another with relation links. Concept maps possess a number of appealing features which make them a promising tool for teaching, learning, evaluation, and curriculum planning. We extend concept maps by associating their concept nodes and relation links with attribute values which indicate the relative significance of concepts and relationships in knowledge representation. The resulting maps are called attributed concept maps (ACM). Assessing students will be conducted by matching their ACMs with those prebuilt by experts. The associated techniques are referred to as map matching techniques. The building of an expert ACM has in the past been done by only one specialist. We integrate a number of maps developed by separate experts into a single map, called the master map (MM), which will serve as a prototypical map in map matching. Both map integration and map matching are conceptualized in terms of fuzzy set discipline. Experimental results have shown that the proposed ideas of ACM, MM, fuzzy map integration, and fuzzy map matching are well suited for students with high performances and difficult subject materials. |
---|---|
ISSN: | 1083-4419 2168-2267 1941-0492 2168-2275 |
DOI: | 10.1109/3477.956047 |