Similarities of Frequent Following Patterns and Social Entities

Abstract 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.

[1]  Carson Kai-Sang Leung,et al.  Stream Mining of Frequent Patterns from Delayed Batches of Uncertain Data , 2013, DaWaK.

[2]  Subhieh El-Salhi,et al.  Minimal Vertex Unique Labelled Subgraph Mining , 2013, DaWaK.

[3]  Kyumin Lee,et al.  You are where you tweet: a content-based approach to geo-locating twitter users , 2010, CIKM.

[4]  Alfredo Cuzzocrea,et al.  Mining constrained frequent itemsets from distributed uncertain data , 2014, Future Gener. Comput. Syst..

[5]  Horst Bunke,et al.  A graph distance metric based on the maximal common subgraph , 1998, Pattern Recognit. Lett..

[6]  Carson Kai-Sang Leung,et al.  Mining Interesting "Following" Patterns from Social Networks , 2014, DaWaK.

[7]  John Hannon,et al.  Recommending twitter users to follow using content and collaborative filtering approaches , 2010, RecSys '10.

[8]  Carson Kai-Sang Leung,et al.  Frequent Pattern Mining from Time-Fading Streams of Uncertain Data , 2011, DaWaK.

[9]  Xiaowei Xu,et al.  SCAN: a structural clustering algorithm for networks , 2007, KDD '07.

[10]  Yong Yu,et al.  Collaborative personalized tweet recommendation , 2012, SIGIR '12.

[11]  Carson Kai-Sang Leung,et al.  Mining Popular Patterns from Transactional Databases , 2012, DaWaK.

[12]  Xuelong Li,et al.  A survey of graph edit distance , 2010, Pattern Analysis and Applications.

[13]  Carson Kai-Sang Leung,et al.  Interactive discovery of influential friends from social networks , 2014, Social Network Analysis and Mining.

[14]  Carson Kai-Sang Leung,et al.  Finding Popular Friends in Social Networks , 2012, 2012 Second International Conference on Cloud and Green Computing.

[15]  Hao Huang,et al.  GMAC: A Seed-Insensitive Approach to Local Community Detection , 2013, DaWaK.

[16]  Alexandre Passant,et al.  Measuring Semantic Distance on Linking Data and Using it for Resources Recommendations , 2010, AAAI Spring Symposium: Linked Data Meets Artificial Intelligence.

[17]  Gillian Dobbie,et al.  Finding Maximal Overlapping Communities , 2013, DaWaK.

[18]  Prasenjit Mitra,et al.  Temporal and Information Flow Based Event Detection from Social Text Streams , 2007, AAAI.

[19]  Michael S. Bernstein,et al.  Short and tweet: experiments on recommending content from information streams , 2010, CHI.

[20]  Carson K. Leung,et al.  Interactive Mining of Strong Friends from Social Networks and Its Applications in E-Commerce , 2014, J. Organ. Comput. Electron. Commer..

[21]  Philip S. Yu,et al.  Community detection in incomplete information networks , 2012, WWW.

[22]  Mario Cataldi,et al.  Emerging topic detection on Twitter based on temporal and social terms evaluation , 2010, MDMKDD '10.