Analyzing and labeling telecom communities using structural properties

Social network analysis and mining has been highly influenced by the online social web sites, telecom consumer data and instant messaging systems and has widely analyzed the presence of dense communities using graph theory and machine learning techniques. Mobile social network analysis is the mapping and measuring of interactions and flows between people, groups, and organizations based on the usage of their mobile communication services. Community identification and mining is one of the recent major directions in social network analysis. In this paper we find the communities in the network based on a modularity factor. Then we propose a graph theory-based algorithm for further split of communities resulting in smaller sized and closely knit sub-units, to drill down and understand consumer behavior in a comprehensive manner. These sub-units are then analyzed and labeled based on their group behavior pattern. The analysis is done using two approaches:—rule-based, and cluster-based, for comparison and the able usage of information for suitable labeling of groups. Moreover, we measured and analyzed the uniqueness of the structural properties for each small unit; it is another quick and dynamic way to assign suitable labels for each distinct group. We have mapped the behavior-based labeling with unique structural properties of each group. It reduces considerably the time taken for processing and identifying smaller sub-communities for effective targeted marketing. The efficiency of the employed algorithms was evaluated on a large telecom dataset in three different stages of our work.

[1]  Fan Chung Graham,et al.  A random graph model for massive graphs , 2000, STOC '00.

[2]  Rui-Sheng Wang,et al.  Extracting Community Structure of Complex networks by Self-Organizing Maps , 2009 .

[3]  Huan Liu,et al.  Graph Mining Applications to Social Network Analysis , 2010, Managing and Mining Graph Data.

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

[5]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[6]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[7]  A-L Barabási,et al.  Structure and tie strengths in mobile communication networks , 2006, Proceedings of the National Academy of Sciences.

[8]  Shaun Doyle.  Social network analysis in the Telco sector — Marketing applications , 2008 .

[9]  G. Madey,et al.  Uncovering individual and collective human dynamics from mobile phone records , 2007, 0710.2939.

[10]  Yiu-ming Cheung,et al.  k*-Means: A new generalized k-means clustering algorithm , 2003, Pattern Recognit. Lett..

[11]  Panos M. Pardalos,et al.  Mining market data: A network approach , 2006, Comput. Oper. Res..

[12]  Katarzyna Musial,et al.  User position measures in social networks , 2009, SNA-KDD '09.

[13]  Sougata Mukherjea,et al.  Analyzing the Structure and Evolution of Massive Telecom Graphs , 2008, IEEE Transactions on Knowledge and Data Engineering.

[14]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[15]  Alex Bavelas,et al.  Communication Patterns in Task‐Oriented Groups , 1950 .

[16]  Ravi Kumar,et al.  Structure and evolution of blogspace , 2004, CACM.

[17]  John Scott,et al.  Social network analysis: developments, advances, and prospects , 2010, Social Network Analysis and Mining.

[18]  Ellis Horowitz,et al.  Fundamentals of Data Structures , 1984 .

[19]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[20]  Diego Garlaschelli,et al.  Patterns of link reciprocity in directed networks. , 2004, Physical review letters.

[21]  Faraz Zaidi,et al.  Communities and hierarchical structures in dynamic social networks: analysis and visualization , 2011, Social Network Analysis and Mining.

[22]  Mark S. Granovetter.  T H E S T R E N G T H O F WEAK TIES: A NETWORK THEORY REVISITED , 1983 .

[23]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  I-Hsien Ting,et al.  Mining and Analyzing Social Networks , 2010, Mining and Analyzing Social Networks.

[25]  Peter R. Monge,et al.  Communication Network Evolution in Organizational Communities , 2008 .

[26]  D. Watts,et al.  An Experimental Study of Search in Global Social Networks , 2003, Science.

[27]  Lisa Singh,et al.  Pruning social networks using structural properties and descriptive attributes , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[28]  Haiyan Jin,et al.  Customer Ranking Authority-Hub Algorithm for Mobile Communications in China , 2007, Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007).

[29]  R. Guimerà,et al.  Classes of complex networks defined by role-to-role connectivity profiles. , 2007, Nature physics.

[30]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[31]  Panos M. Pardalos,et al.  On maximum clique problems in very large graphs , 1999, External Memory Algorithms.

[32]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.