Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/73489
DC Field | Value | Language |
---|---|---|
dc.contributor | 資管系 | |
dc.creator | 蔡瑞煌 | zh_TW |
dc.creator | Yang, Yu-Hsiang;Tsaih, Rua-Huan;Bhikshu, Huimin | |
dc.date | 2011 | |
dc.date.accessioned | 2015-02-12T04:22:54Z | - |
dc.date.available | 2015-02-12T04:22:54Z | - |
dc.date.issued | 2015-02-12T04:22:54Z | - |
dc.identifier.uri | http://nccur.lib.nccu.edu.tw/handle/140.119/73489 | - |
dc.description.abstract | The purpose of this study was to propose a multi-layer topic map analysis using co-word analysis of informetrics with Growing Hierarchical Self-Organizing Map (GHSOM). The topic map illustrated the delicate intertwining of subject areas and provided a more explicit illustration of the concepts within each subject area. We applied GHSOM, a text-mining Neural Networks tool, to obtain a hierarchical topic map. After taking up one example of altruism in evaluation, we suggest that topic map may disclose some important facts from a whole bunch of data. | |
dc.format.extent | 646754 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.relation | International Journal of Digital Content Technology and its Applications,5(3),355-363 | |
dc.subject | Topic-map; Co-word; Growing Hierarchical Self-Organizing Map; GHSOM; Altruism | |
dc.title | The Research of Multi-Layer Topic Map Analysis using Co-word Analysis with Growing Hierarchical Self-organizing Map | |
dc.type | article | en |
dc.identifier.doi | 10.4156/jdcta.vol5.issue3.35 | en_US |
dc.doi.uri | http://dx.doi.org/10.4156/jdcta.vol5.issue3.35 | en_US |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.grantfulltext | restricted | - |
item.cerifentitytype | Publications | - |
item.fulltext | With Fulltext | - |
item.openairetype | article | - |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
355-363.pdf | 631.6 kB | Adobe PDF2 | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.