Topic recommendation for authors as a link prediction problem

被引:22
作者
Aslan, Serpil [1 ]
Kaya, Mehmet [2 ]
机构
[1] Munzur Univ, Dept Comp Engn, Tunceli, Turkey
[2] Firat Univ, Dept Comp Engn, Elazig, Turkey
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2018年 / 89卷
关键词
Bipartite network; Strengthening weighted projection; Link prediction; Author-topic network; BIPARTITE NETWORKS; COMPLEX NETWORKS; WORLD CITIES; PROJECTIONS; GRAPHS;
D O I
10.1016/j.future.2018.06.050
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Recently, link prediction studies on large-scale and complex networks have particularly become the focus of interest for researchers in various scientific fields. Many complex networks created from the real world data contain bipartite structure by nature. Bipartite networks are a kind of complex networks that represent the interactions between the different node groups. Almost all of the previous studies on link prediction in bipartite networks focus on using the properties of projection networks to predict the relations between the node pairs. In this study, a novel similarity-based link prediction method based on strengthening weighted projection is proposed to predict the potential links between the authors and the topics in the large-scale bipartite academic information network created from the real-world data. Since information loss occurs when bipartite networks are converted to unimodal networks, it should be noted that when making a link prediction in this paper, both the bipartite network and the information on strengthening unimodal network obtained from the bipartite network are used. To evaluate the proposed method, a bipartite network was first created from a real dataset consisting of authors and their work. Then the method was tested on this network. Experimental results demonstrate that it is possible to obtain faster and more accurate link prediction results by the proposed method. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:249 / 264
页数:16
相关论文
共 63 条
  • [1] Allali O., 2011, IEEE INFOCOM 2011 - IEEE Conference on Computer Communications. Workshops, P936, DOI 10.1109/INFCOMW.2011.5928947
  • [2] A class-based link prediction using Distance Dependent Chinese Restaurant Process
    Andalib, Azam
    Babamir, Seyed Morteza
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2016, 456 : 204 - 214
  • [3] [Anonymous], 2002, Connections
  • [4] [Anonymous], 2003, IJCAI WORKSH LEARN S
  • [5] [Anonymous], 2006, P WORKSH LINK AN COU
  • [6] [Anonymous], ARXIV170700912
  • [7] [Anonymous], 2011, ACM SIGKDD
  • [8] [Anonymous], 1994, SOCIAL NETWORK ANAL
  • [9] [Anonymous], 2010, P 16 ACM SIGKDD INT
  • [10] Barabási AL, 2016, NETWORK SCIENCE, P1