Knowledge map-based method for domain knowledge browsing

被引:38
作者
Hao, Jia
Yan, Yan
Gong, Lin
Wang, Guoxin
Lin, Jianjun
机构
[1] Beijing Inst Technol, Sch Mech Engn, Beijing 100081, Peoples R China
[2] Univ Michigan, Dept Mech Engn, Ann Arbor, MI 48109 USA
基金
中国国家自然科学基金;
关键词
Information overload; Knowledge browsing; Knowledge map; Social network analysis; INFORMATION OVERLOAD; CATEGORY MAP; WEB;
D O I
10.1016/j.dss.2014.02.001
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The exponential growth of available information and the deployment of knowledge management systems delivers excessive information to the end users that they cannot manage at once. This problem has led to an increased emphasis on solutions to information overload. Searching and browsing are two methods to locate information. Many studies have focused on solving the information overload problem in the searching process, but the methods to alleviate information overload in browsing process have not been adequately studied. Hence, a method that addresses information overload in the browsing process is presented in this paper. The aim is to reduce the information overload during browsing domain knowledge for new knowledge users who have little understanding of the information. In this method, a knowledge map and social network analysis are utilized to navigate the knowledge users. Technologies first construct a knowledge map from text mining and the important knowledge that includes more information about the domain is then identified via social network analysis. Based on this process, the knowledge user can browse the domain knowledge starting from the important knowledge and navigate via the knowledge map. We applied the method to assist new knowledge users in browsing the Computer Numerical Control (CNC) domain knowledge base to validate the method. The results indicate that the method can identify the important knowledge at a highly acceptable level, the constructed knowledge map can efficiently navigate the knowledge users, and the information overload can be significantly decreased. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:106 / 114
页数:9
相关论文
共 32 条
[1]   Classes of small-world networks [J].
Amaral, LAN ;
Scala, A ;
Barthélémy, M ;
Stanley, HE .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2000, 97 (21) :11149-11152
[2]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[3]   Exploiting Social Tagging in a Web 2.0 Recommender System [J].
Belen Barragans-Martinez, Ana ;
Rey-Lopez, Marta ;
Costa-Montenegro, Enrique ;
Mikic-Fonte, Fernando A. ;
Burguillo, Juan C. ;
Peleteiro, Ana .
IEEE INTERNET COMPUTING, 2010, 14 (06) :23-30
[4]   INFORMATION FILTERING AND INFORMATION-RETRIEVAL - 2 SIDES OF THE SAME COIN [J].
BELKIN, NJ ;
CROFT, WB .
COMMUNICATIONS OF THE ACM, 1992, 35 (12) :29-38
[5]   Information Overload Introduction [J].
Bergamaschi, Sonia ;
Guerra, Francesco ;
Leiba, Barry .
IEEE INTERNET COMPUTING, 2010, 14 (06) :10-13
[6]   Hybrid recommender systems: Survey and experiments [J].
Burke, R .
USER MODELING AND USER-ADAPTED INTERACTION, 2002, 12 (04) :331-370
[7]   Search Computing Managing Complex Search Queries [J].
Ceri, Stefano ;
Abid, Adnan ;
Abu Helou, Mamoun ;
Barbieri, Davide ;
Bozzon, Alessandro ;
Braga, Daniele ;
Brambilla, Marco ;
Campi, Alessandro ;
Corcoglioniti, Francesco ;
Della Valle, Emanuele ;
Eynard, Davide ;
Fraternali, Piero ;
Grossniklaus, Michael ;
Martinenghi, Davide ;
Ronchi, Stefania ;
Tagliasacchi, Marco ;
Vadacca, Salvatore .
IEEE INTERNET COMPUTING, 2010, 14 (06) :14-22
[8]  
Chan K., 2006, International Journal of Management and Decision Making, V7, P19, DOI 10.1504/IJMDM.2006.008169
[9]  
Chen HC, 1998, J AM SOC INFORM SCI, V49, P582, DOI 10.1002/(SICI)1097-4571(19980515)49:7<582::AID-ASI2>3.0.CO
[10]  
2-X