Topic map construction using bee colony algorithm

碩士 === 元智大學 === 工業工程與管理學系 === 105 === With the rapid development of the information technology, information overload is becoming a serious problem during the information acquisition process. Information overload leads users spend more time to find necessary knowledge. To relieve this difficulty, kno...

Full description

Bibliographic Details
Main Authors: Wei-Jhong Ji, 紀韋仲
Other Authors: Chieh-Yuan Tsai
Format: Others
Language:en_US
Published: 2016
Online Access:http://ndltd.ncl.edu.tw/handle/xb5u77
id ndltd-TW-105YZU05031002
record_format oai_dc
spelling ndltd-TW-105YZU050310022019-05-15T23:16:59Z http://ndltd.ncl.edu.tw/handle/xb5u77 Topic map construction using bee colony algorithm 應用蜂群演算法建構主題知識地圖 Wei-Jhong Ji 紀韋仲 碩士 元智大學 工業工程與管理學系 105 With the rapid development of the information technology, information overload is becoming a serious problem during the information acquisition process. Information overload leads users spend more time to find necessary knowledge. To relieve this difficulty, knowledge map is a systematic approach to reveal the underlying relationships between abundant knowledge sources. However, few studies focused on optimizing the coordinates of objects in the map. In addition, too many parameters should be set which lead them complicated and not intuition. To solve the above problems, this thesis presents a novel knowledge map approach to transform high-dimensional objects into a 2-dimensional space to help understand complicated relatedness among high-dimensional important topics. First, the papers related to certain domains are collected from the knowledge database and papers as the knowledge items that contains many keywords. Second, the collected knowledge items are presented as the vector space model (VSM). In VSM, keywords can be represented as a term vector in m-dimensional space where the term frequency-inverse document frequency (TF-IDF) approach is used for term weighting so that the tf-idf value increases proportionally to the number of times a keyword appears in the knowledge item. Third, hierarchical clustering is used find important topics. Additionally, high-dimensional relationships among objects are transformed into a 2-dimensional space using the multi-dimension scaling method. The optimal transformation coordinate matrix is also determined by using the artificial bee colony (ABC) algorithm. Then, this transformation coordinate matrix is used to construct a two-dimensional knowledge map so that the relationship among all important topics can be visualized easily. According to experiments, it is found that setting appropriate number of clusters is important for visual perception in the knowledge map. In addition, population size and iteration number in ABC algorithm can affect the results. This paper also shows the example of using the proposed topic knowledge map for research trend analysis in IOT during years 2011 to 2016. Chieh-Yuan Tsai 蔡介元 2016 學位論文 ; thesis 91 en_US
collection NDLTD
language en_US
format Others
sources NDLTD
description 碩士 === 元智大學 === 工業工程與管理學系 === 105 === With the rapid development of the information technology, information overload is becoming a serious problem during the information acquisition process. Information overload leads users spend more time to find necessary knowledge. To relieve this difficulty, knowledge map is a systematic approach to reveal the underlying relationships between abundant knowledge sources. However, few studies focused on optimizing the coordinates of objects in the map. In addition, too many parameters should be set which lead them complicated and not intuition. To solve the above problems, this thesis presents a novel knowledge map approach to transform high-dimensional objects into a 2-dimensional space to help understand complicated relatedness among high-dimensional important topics. First, the papers related to certain domains are collected from the knowledge database and papers as the knowledge items that contains many keywords. Second, the collected knowledge items are presented as the vector space model (VSM). In VSM, keywords can be represented as a term vector in m-dimensional space where the term frequency-inverse document frequency (TF-IDF) approach is used for term weighting so that the tf-idf value increases proportionally to the number of times a keyword appears in the knowledge item. Third, hierarchical clustering is used find important topics. Additionally, high-dimensional relationships among objects are transformed into a 2-dimensional space using the multi-dimension scaling method. The optimal transformation coordinate matrix is also determined by using the artificial bee colony (ABC) algorithm. Then, this transformation coordinate matrix is used to construct a two-dimensional knowledge map so that the relationship among all important topics can be visualized easily. According to experiments, it is found that setting appropriate number of clusters is important for visual perception in the knowledge map. In addition, population size and iteration number in ABC algorithm can affect the results. This paper also shows the example of using the proposed topic knowledge map for research trend analysis in IOT during years 2011 to 2016.
author2 Chieh-Yuan Tsai
author_facet Chieh-Yuan Tsai
Wei-Jhong Ji
紀韋仲
author Wei-Jhong Ji
紀韋仲
spellingShingle Wei-Jhong Ji
紀韋仲
Topic map construction using bee colony algorithm
author_sort Wei-Jhong Ji
title Topic map construction using bee colony algorithm
title_short Topic map construction using bee colony algorithm
title_full Topic map construction using bee colony algorithm
title_fullStr Topic map construction using bee colony algorithm
title_full_unstemmed Topic map construction using bee colony algorithm
title_sort topic map construction using bee colony algorithm
publishDate 2016
url http://ndltd.ncl.edu.tw/handle/xb5u77
work_keys_str_mv AT weijhongji topicmapconstructionusingbeecolonyalgorithm
AT jìwéizhòng topicmapconstructionusingbeecolonyalgorithm
AT weijhongji yīngyòngfēngqúnyǎnsuànfǎjiàngòuzhǔtízhīshídetú
AT jìwéizhòng yīngyòngfēngqúnyǎnsuànfǎjiàngòuzhǔtízhīshídetú
_version_ 1719144018994003968