Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Isolated items discarding strategy for discovering high utility itemsets
Data & Knowledge Engineering
TwitterRank: finding topic-sensitive influential twitterers
Proceedings of the third ACM international conference on Web search and data mining
Guest Editors' Introduction: Social Computing in the Blogosphere
IEEE Internet Computing
Measuring attention intensity to web pages based on specificity of social tags
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
Virus Propagation Modeling in Facebook
ASONAM '10 Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining
Exploring Social Networks: A Frequent Pattern Visualization Approach
SOCIALCOM '10 Proceedings of the 2010 IEEE Second International Conference on Social Computing
Measuring message propagation and social influence on Twitter.com
SocInfo'10 Proceedings of the Second international conference on Social informatics
What's in a name: a study of names, gender inference, and gender behavior in facebook
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
Democrats, republicans and starbucks afficionados: user classification in twitter
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Visual analytics of social networks: mining and visualizing co-authorship networks
FAC'11 Proceedings of the 6th international conference on Foundations of augmented cognition: directing the future of adaptive systems
On kernel information propagation for tag clustering in social annotation systems
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part II
Maximum Reliable Tree for Social Network Search
DASC '11 Proceedings of the 2011 IEEE Ninth International Conference on Dependable, Autonomic and Secure Computing
Finding Strong Groups of Friends among Friends in Social Networks
DASC '11 Proceedings of the 2011 IEEE Ninth International Conference on Dependable, Autonomic and Secure Computing
A two-phase algorithm for fast discovery of high utility itemsets
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Mining probabilistic datasets vertically
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Mining popular patterns from transactional databases
DaWaK'12 Proceedings of the 14th international conference on Data Warehousing and Knowledge Discovery
| Hi-index | 0.00 |
The emergence of Web-based communities and hosted services such as social networking sites has facilitated collaboration and knowledge sharing between users. Hence, it has become important to mine this vast pool of data in social networks, which are generally made of users linked by some specific interdependency such as friendship. For any user, some groups of his friends are more significant than others. In this paper, we propose a tree-based algorithm to mine social networks to help these users to distinguish their significant friend groups from all the friends in their social networks.