Cart (Loading....) | Create Account
Close category search window
 

Extracting dense communities from telecom call graphs

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

6 Author(s)
Pandit, V. ; IBM India Res. Lab., New Delhi ; Modani, N. ; Mukherjea, S. ; Nanavati, A.A.
more authors

Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typical examples of social networks are collaboration networks in a research community, networks arising out of interaction between colleagues of large organization etc. Social networks are highly dynamic objects that evolve quickly over time with addition and deletion of nodes and edges. Understanding the evolution of a social network is helpful in inferring trends and patterns of social contacts in a particular social context. In this paper, we consider social networks that are derived from telephone call records, i.e, graphs in which the individual phone numbers (and hence its users) are the nodes and the edges correspond to a telephonic contact between the two nodes they connect. We study the problem of extracting dense communities from such telecom call graphs. The problem studied here is set in the context of a larger project. We motivate the problem studied by describing the context in which it is set. Our analysis is based on suitable algorithmic engineering of an approximation algorithm for the densest subgraph problem by Charikar. We present empirical results on massive graphs with millions of nodes and edges. We also discuss many open problems that are important in the context of analyzing telecom call graphs.

Published in:

Communication Systems Software and Middleware and Workshops, 2008. COMSWARE 2008. 3rd International Conference on

Date of Conference:

6-10 Jan. 2008

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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.