Displaying a framework in a concept map using network graph techniques

Stockwell, Paul, Smith, Andrew E. and Wiles, Janet (2009). Displaying a framework in a concept map using network graph techniques. In: Information Visualisation, 2009 13th International Conference. 2009 13th International Conference on Information Visualisation, Barcelona, Spain, (661-666). 15-17 July 2009. doi:10.1109/IV.2009.36

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads

Author Stockwell, Paul
Smith, Andrew E.
Wiles, Janet
Title of paper Displaying a framework in a concept map using network graph techniques
Conference name 2009 13th International Conference on Information Visualisation
Conference location Barcelona, Spain
Conference dates 15-17 July 2009
Proceedings title Information Visualisation, 2009 13th International Conference
Journal name Proceedings of the International Conference on Information Visualisation
Place of Publication Los Alamitos, CA, United States
Publisher IEEE
Publication Year 2009
Sub-type Fully published paper
DOI 10.1109/IV.2009.36
ISBN 9780769537337
ISSN 1550-6037
Volume IV
Start page 661
End page 666
Total pages 6
Language eng
Abstract/Summary Concepts maps are a useful method for visualizing how concepts are associated within a domain. Automated tools can extract the key concepts from a corpus and display their relationships in a two-dimensional representation. However, it may be difficult to quickly perceive the overall structure of a concept map. The aim of this research is to provide a framework on a concept map to identify primary concepts and nearby, related concepts providing context for them using network graph techniques. Automated concept maps are usually very highly connected, and full connectivity shows none of the detail or fine structure. Minimum spanning trees based on the strength of the co-occurrence frequency between concepts and their relative distances on the two-dimensional concept map show hierarchical structure, with key concepts acting as hubs within the network structure. The links within the minimum spanning tree can be used to associate concepts that are not directly connected.
Subjects 08 Information and Computing Sciences
Keyword Data visualisation
Co-occurrence frequency
Concept maps
Fine structure
Hierarchical structure
Minimum spanning trees
Network graph techniques
Q-Index Code E1
Q-Index Status Provisional Code
Institutional Status UQ

 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in Thomson Reuters Web of Science Article
Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Created: Tue, 01 Mar 2011, 21:34:34 EST by Mrs Barbara Whittaker on behalf of School of Information Technol and Elec Engineering