Similarities of Frequent Following Patterns and Social Entities

被引:8
作者
Kawagoe, Kyoji [1 ]
Leung, Carson Kai-Sang [2 ]
机构
[1] Ritsumeikan Univ, Kusatsu, Shiga, Japan
[2] Univ Manitoba, Winnipeg, MB, Canada
来源
KNOWLEDGE-BASED AND INTELLIGENT INFORMATION & ENGINEERING SYSTEMS 19TH ANNUAL CONFERENCE, KES-2015 | 2015年 / 60卷
关键词
Social network; frequent following pattern; similarity; social entity; recommendations; FRIENDS;
D O I
10.1016/j.procs.2015.08.200
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Social network sites such as Twitter and Facebook are used for sharing knowledge and information among users. As social networks grow larger, it becomes difficult for a user to find frequently followed group of social entities. Recently, the frequent following pattern (FFP) mining concept and method were proposed to extract patterns of the relationship between a set of following entities and their most frequently followed entities. In this paper, we propose two similarity definitions: FFP similarity and FFP-based Entity (FbE) similarity. These similarities can be used to recommend a new appropriate social entity to a "read-only-user". In other words, these similarities can be defined only with followed-and-following (F-F) relationships and without additional information such as entity characteristics or entity access logs. To the best of our knowledge, this is the first attempt to define these similarity definitions for social entity recommendations. Some examples show the effectiveness of our similarity definitions by checking their satisfaction of established requirement. (C) 2015 The Authors. Published by Elsevier B. V.
引用
收藏
页码:642 / 651
页数:10
相关论文
共 26 条
[1]  
[Anonymous], 2002, P 8 ACM SIGKDD INT C
[2]  
[Anonymous], 2010, P 19 ACM INT C INFOR, DOI DOI 10.1145/1871437.1871535
[3]  
[Anonymous], 2007, P 22 NATL C ARTIFICI
[4]   A graph distance metric based on the maximal common subgraph [J].
Bunke, H ;
Shearer, K .
PATTERN RECOGNITION LETTERS, 1998, 19 (3-4) :255-259
[5]  
Cataldi M., 2010, P 10 INT WORKSH MULT, P1, DOI [10.1145/1814245.1814249, DOI 10.1145/1814245.1814249]
[6]  
CHEN JL, 2010, ACM CHI 2010, P1185
[7]  
Chen KL, 2012, SIGIR 2012: PROCEEDINGS OF THE 35TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, P661, DOI 10.1145/2348283.2348372
[8]   Mining constrained frequent itemsets from distributed uncertain data [J].
Cuzzocrea, Alfredo ;
Leung, Carson Kai-Sang ;
MacKinnon, Richard Kyle .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2014, 37 :117-126
[9]  
Dhahri Nabila, 2012, Data Warehousing and Knowledge Discovery. Proceedings of the 14th International Conference, DaWaK 2012, P253, DOI 10.1007/978-3-642-32584-7_21
[10]  
Fan Jiang, 2014, Data Warehousing and Knowledge Discovery. 16th International Conference (DaWaK 2014). Proceedings: LNCS 8646, P308, DOI 10.1007/978-3-319-10160-6_28