Finding groups of friends who are significant across multiple domains in social networks

Social networking websites such as Facebook, LinkedIn, Twitter, and Weibo have been used for collaboration and knowledge sharing between users. The mining of social network data has become an important topic in data mining and computational aspects of social networks. Nowadays, it is not uncommon for most users in a social network to have many friends and in multiple social domains. Among these friends, some groups of friends are more significant than others. In this paper, we introduce a data mining technique that helps social network users find groups of friends who are significant across multiple domains in social networks.

[1]  Alfredo Cuzzocrea,et al.  Discovering Frequent Patterns from Uncertain Data Streams with Time-Fading and Landmark Models , 2013, Trans. Large Scale Data Knowl. Centered Syst..

[2]  Katarzyna Musial,et al.  A degree centrality in multi-layered social network , 2011, 2011 International Conference on Computational Aspects of Social Networks (CASoN).

[3]  Ming Gu,et al.  A Brief Survey on De-anonymization Attacks in Online Social Networks , 2010, 2010 International Conference on Computational Aspects of Social Networks.

[4]  Carson Kai-Sang Leung,et al.  DIFSoN: Discovering influential friends from social networks , 2012, 2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN).

[5]  Shyhtsun Felix Wu,et al.  Measuring message propagation and social influence on Twitter.com , 2010, Int. J. Commun. Networks Distributed Syst..

[6]  Philip S. Yu,et al.  Guest Editors' Introduction: Social Computing in the Blogosphere , 2010, IEEE Internet Comput..

[7]  Hervé Debar,et al.  Cross-domain vulnerabilities over social networks , 2012, 2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN).

[8]  Chin-Chen Chang,et al.  Isolated items discarding strategy for discovering high utility itemsets , 2008, Data Knowl. Eng..

[9]  Ying Liu,et al.  A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets , 2005, PAKDD.

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

[11]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[12]  Carson Kai-Sang Leung,et al.  Analyzing Social Networks to Mine Important Friends , 2013 .

[13]  Carson Kai-Sang Leung,et al.  Mining Social Networks for Significant Friend Groups , 2012, DASFAA Workshops.

[14]  Alfredo Cuzzocrea,et al.  Mining Frequent Itemsets from Sparse Data Streams in Limited Memory Environments , 2013, WAIM.

[15]  Cory J. Butz,et al.  A Foundational Approach to Mining Itemset Utilities from Databases , 2004, SDM.

[16]  Huan Liu,et al.  Synthesis Lectures on Data Mining and Knowledge Discovery , 2009 .

[17]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[18]  Carson Kai-Sang Leung,et al.  Mining Frequent Patterns from Uncertain Data with MapReduce for Big Data Analytics , 2013, DASFAA.

[19]  Luciano Rossoni,et al.  Models and methods in social network analysis , 2006 .

[20]  Carson Kai-Sang Leung,et al.  PUF-Tree: A Compact Tree Structure for Frequent Pattern Mining of Uncertain Data , 2013, PAKDD.

[21]  Ieee Staff,et al.  2013 Fifth International Conference on Computational Aspects of Social Networks (CASoN) , 2013 .

[22]  Philip S. Yu,et al.  LaFT-tree: perceiving the expansion trace of one's circle of friends in online social networks , 2013, WSDM.

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

[24]  Carson Kai-Sang Leung,et al.  Finding Diverse Friends in Social Networks , 2013, APWeb.