Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
Turning down the noise in the blogosphere
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
IEA/AIE '09 Proceedings of the 22nd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: Next-Generation Applied Intelligence
Empirical comparison of algorithms for network community detection
Proceedings of the 19th international conference on World wide web
Hi-index | 0.00 |
Effective organization and management of a user's ego-network is one of the effective means to deal with information overload. Manual organization methods are often time-consuming and difficult to promote. In this paper, an automatic identification of social circles model is proposed, which takes three factors into account: user's profile, relationship information, and interactive context information. Using closed frequent itemsets mining on users' interactive context, a user in ego-network can belong to more than one social circles or even no one. The experiments show that our model can effectively detect social circles on ego-network.