This chapter focuses on two somewhat fundamentally related ways to elicit knowledge structure, network diagrams (usually as concept maps), and essays (see Chapter 4, this volume). Because of the utility of the proven Pathfinder Network approach and its well-established research base, we developed software to convert concept maps and essays into data representations that can be analyzed with Pat...

Knowledge management depends on effective methods for capturing knowledge in useful forms and making it available when needed. Electronic concept maps provide a promising representation for knowledge models that can be developed directly by the experts themselves, but the flexibility of concept mapping raises questions of how to support the knowledge modeling process and to standardize its resu...

BACKGROUND Many educational programs incorporate problem-based learning (PBL) to promote students' learning; however, the knowledge structure developed in PBL remains unclear. The aim of this study was to use concept mapping to generate an understanding of the use of PBL in the development of knowledge structures. METHODS Using a quasi-experimental study design, we employed concept mapping to...

This paper describes a preliminary effort on adapting an existing poetry generation platform, PoeTryMe, to produce poetry from concept maps, extracted from textual documents. Instead of a set of given words that would constrain a general language semantic network, the presented adaptation dynamically sets the semantic network to the given concept map. As the relations in the concept maps are op...

We propose a new concept of generalized di erentiation of setvalued maps that captures rst order information. This concept encompasses the standard notions of Fréchet di erentiability, strict di erentiability, calmness and Lipschitz continuity in single-valued maps, and the Aubin property and Lipschitz continuity in set-valued maps. We present calculus rules, sharpen the relationship between th...

In order to better understand the structure of students’ knowledge in computer science, we are trying to identify patterns – in form of frequently occurring subgraphs – in concept maps. Concept maps are an externalization of a person’s declarative knowledge represented as a graph. We propose an algorithm that can be employed to identify frequently occurring subgraphs, based on existing algorith...

Concept maps can be used to concisely represent important information and bring structure into large document collections. Therefore, we study a variant of multidocument summarization that produces summaries in the form of concept maps. However, suitable evaluation datasets for this task are currently missing. To close this gap, we present a newly created corpus of concept maps that summarize h...

This paper discusses both a new measurement method and a performance scoring method in comparison with concept maps drawn by individual students with the concept map drawn by the teacher. However, it is very difficult to evaluate the degree of similarity between a pair of concept maps. Therefore, this paper presents a quantitative evaluation measure of similarity between a pair of maps by consi...