Publications-Periodical Articles
Article View/Open
Publication Export
-
題名 Exploring Heterogeneous Information Networks and Random Walk with Restart for Academic Search 作者 沈錳坤
Shan,Man-Kwan
Peng,Wen-Chih
Wang,Jen-Liang
Liou,Jiun-Jiue
Chiang,Meng-Fen貢獻者 資科系 日期 2012.04 上傳時間 11-Nov-2013 16:28:04 (UTC+8) 摘要 In this paper, we explore heterogenous information networks in which each vertex represents one entity and the edges reflect linkage relationships. Heterogenous information networks contain vertices of several entity types, such as papers, authors and terms, and hence can fully reflect multiple linkage relationships among different entities. Such a heterogeneous information network is similar to a mixed media graph (MMG). By representing a bibliographic dataset as an MMG, the performance obtained when searching relevant entities (e.g., papers) can be improved. Furthermore, our academic search enables multiple-entity search, where a variety of entity search results are provided, such as relevant papers, authors and conferences, via a one-time query. Explicitly, given a bibliographic dataset, we propose a Global-MMG, in which a global heterogeneous information network is built. When a user submits a query keyword, we perform a random walk with restart (RWR) to retrieve papers or other types of entity objects. To reduce the query response time, algorithm Net-MMG (standing for NetClus-based MMG) is developed. Algorithm Net-MMG first divides a heterogeneous information network into a collection of sub-networks. Afterward, the Net-MMG performs a RWR on a set of selected relevant sub-networks. We implemented our academic search and conducted extensive experiments using the ACM Digital Library. The experimental results show that by exploring heterogeneous information networks and RWR, both the Global-MMG and Net-MMG achieve better search quality compared with existing academic search services. In addition, the Net-MMG has a shorter query response time while still guaranteeing good quality in search results. 關聯 Knowledge and Information Systems, 36(1) , 59-82 資料類型 article DOI http://dx.doi.org/10.1007/s10115-012-0523-8 dc.contributor 資科系 en_US dc.creator (作者) 沈錳坤 zh_TW dc.creator (作者) Shan,Man-Kwan en_US dc.creator (作者) Peng,Wen-Chih en_US dc.creator (作者) Wang,Jen-Liang en_US dc.creator (作者) Liou,Jiun-Jiue en_US dc.creator (作者) Chiang,Meng-Fen en_US dc.date (日期) 2012.04 en_US dc.date.accessioned 11-Nov-2013 16:28:04 (UTC+8) - dc.date.available 11-Nov-2013 16:28:04 (UTC+8) - dc.date.issued (上傳時間) 11-Nov-2013 16:28:04 (UTC+8) - dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/61583 - dc.description.abstract (摘要) In this paper, we explore heterogenous information networks in which each vertex represents one entity and the edges reflect linkage relationships. Heterogenous information networks contain vertices of several entity types, such as papers, authors and terms, and hence can fully reflect multiple linkage relationships among different entities. Such a heterogeneous information network is similar to a mixed media graph (MMG). By representing a bibliographic dataset as an MMG, the performance obtained when searching relevant entities (e.g., papers) can be improved. Furthermore, our academic search enables multiple-entity search, where a variety of entity search results are provided, such as relevant papers, authors and conferences, via a one-time query. Explicitly, given a bibliographic dataset, we propose a Global-MMG, in which a global heterogeneous information network is built. When a user submits a query keyword, we perform a random walk with restart (RWR) to retrieve papers or other types of entity objects. To reduce the query response time, algorithm Net-MMG (standing for NetClus-based MMG) is developed. Algorithm Net-MMG first divides a heterogeneous information network into a collection of sub-networks. Afterward, the Net-MMG performs a RWR on a set of selected relevant sub-networks. We implemented our academic search and conducted extensive experiments using the ACM Digital Library. The experimental results show that by exploring heterogeneous information networks and RWR, both the Global-MMG and Net-MMG achieve better search quality compared with existing academic search services. In addition, the Net-MMG has a shorter query response time while still guaranteeing good quality in search results. en_US dc.format.extent 707413 bytes - dc.format.mimetype application/pdf - dc.language.iso en_US - dc.relation (關聯) Knowledge and Information Systems, 36(1) , 59-82 en_US dc.title (題名) Exploring Heterogeneous Information Networks and Random Walk with Restart for Academic Search en_US dc.type (資料類型) article en dc.identifier.doi (DOI) 10.1007/s10115-012-0523-8 en_US dc.doi.uri (DOI) http://dx.doi.org/10.1007/s10115-012-0523-8 en_US
