Similarities of Frequent Following Patterns and Social Entities
Author(s) -
Kyoji Kawagoe,
Carson K. Leung
Publication year - 2015
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2015.08.200
Subject(s) - computer science , data science , artificial intelligence , computer security
ocial 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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom