标题:Integrating meta-path selection with user-preference for top-k relevant search in heterogeneous information networks
作者:Bu, Shaoli ;Hong, Xiaoguang ;Peng, Zhaohui ;Li, Qingzhong
作者机构:[Bu, Shaoli ;Hong, Xiaoguang ;Peng, Zhaohui ;Li, Qingzhong ] School of Computer Science and Technology, Shandong University, Jinan, China
会议名称:2014 18th IEEE International Conference on Computer Supported Cooperative Work in Design, CSCWD 2014
会议日期:21 May 2014 through 23 May 2014
来源:Proceedings of the 2014 IEEE 18th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2014
出版年:2014
页码:301-306
DOI:10.1109/CSCWD.2014.6846859
关键词:graph partitioning; Heterogeneous information networks; relevance search; user-preference search
摘要:Relevance search in heterogeneous information networks is a basic and crucial operation which is usually used in recommendation, clustering and anomaly detection. Nowadays most existing relevance search methods focus on objects in homogeneous information networks. In this paper, we propose a method to find the top-k most relevant objects to a specific one in heterogeneous networks. It is a two phase process that we get the initial relevance score based on the method of pair wise random walk along given meta-paths, which is a meta-level description of the path instances in heterogeneous information networks, and then take user preference into consideration to calculate the weights combination of meta-paths and model the problem into a multi-objective linear planning problem which can be solved with the method of generic algorithm. Besides, to ensure the efficiency, we use matrix computation and selective materialization to avoid the recursive computation of pair wise random walk. What's more, we propose an effective pruning method to skip unnecessary objects computations. The experiments on IMDB and DBLP dataset show that the method can gain a better accuracy and efficiency. © 2014 IEEE.
收录类别:EI;SCOPUS
Scopus被引频次:1
资源类型:会议论文;期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84904642315&doi=10.1109%2fCSCWD.2014.6846859&partnerID=40&md5=9b084112445a2ba222529f26c6fe5bad
TOP