Close category search window
 

Mining community in social network using call detail records

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhiwen Hu ; Oujiang Coll., Wenzhou Univ., Wenzhou, China ; Xianming Wang ; Ke Xu

With the popularity of mobile devices and wireless technologies, mobile social network systems are increasingly available. In this paper we propose a new algorithm called Community Detection algorithm for mining interesting communities or groups in a Campus Mobile Social Network (CMSN). The proposal algorithm is composed of two main components, an algorithm for community partition and an algorithm for selecting small communities to combine into a big community. Empirical studies on a campus mobile social network show that performance of the proposal algorithm is better than the state-of-the-art Newman Clustering algorithm for mining community in CMSN.

Published in:
Fuzzy Systems and Knowledge Discovery (FSKD), 2012 9th International Conference on

Date of Conference: 29-31 May 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.