Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Exploring Communication Behaviors of Users to Target Potential Users in Mobile Social Networks

Published: 18 August 2017 Publication History

Abstract

In mobile communication services, users can communicate with each other over different telecommunication carriers. For telecom operators, how to acquire and retain users is a significant and practical task. Note that telecom operators only have their own customer profiles. For the users from other telecom operators, their information is sparse. Thus, given a set of communication logs, the main theme of our work is to identify the potential users who will possibly join the target services in the near future. Since only a limited amount of information is available, one challenging issue is how to extract features from the communication logs. In this article, we propose a Communication-Based Feature Generation (CBFG) framework that extracts features and builds models to infer the potential users. Explicitly, we construct a heterogeneous information network from the communication logs of users. Then, we extract the explicit features, which refer to those calling features of users, from the potential users’ interaction behaviors in the heterogeneous information network. Moreover, from the calling behaviors of users, one could extract the possible community structures of users. Based on the community structures, we further extract the implicit features of users. In light of both explicit and implicit features, we propose an information-gain-based method to select the effective features. According to the features selected, we utilize three popular classifiers (i.e., AdaBoost, Random Forest, and SVM) to build models to target the potential users. In addition, we have designed a sampling approach to extract training data for classifiers. To evaluate our methods, we have conducted experiments on a real dataset. The results of our experiments show that the features extracted by our proposed method can be effective for targeting the potential users.

References

[1]
Leo Breiman. 2001. Random forests. Machine Learning 45, 1 (2001), 5--32.
[2]
Deng Cai, Zheng Shao, Xiaofei He, Xifeng Yan, and Jiawei Han. 2005a. Community mining from multi-relational networks. In Proceedings of the 9th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD’05). Porto, Portugal, Springer, 445--452.
[3]
Deng Cai, Zheng Shao, Xiaofei He, Xifeng Yan, and Jiawei Han. 2005b. Mining hidden community in heterogeneous social networks. In Proceedings of the 3rd International Workshop on Link Discovery (LinkKDD’05). ACM, 58--65.
[4]
Chih-Chung Chang and Chih-Jen Lin. 2011. LIBSVM: a library for support vector machines. ACM Transactions on Intelligent Systems and Technology (TIST) 2, 3 (2011), 27.
[5]
Aaron Clauset, Mark E.J. Newman, and Cristopher Moore. 2004. Finding community structure in very large networks. Physical Review E 70, 6 (2004), 066111.
[6]
Kristof Coussement and Dirk Van den Poel. 2008. Churn prediction in subscription services: An application of support vector machines while comparing two parameter-selection techniques. Expert Systems with Applications 34, 1 (2008), 313--327.
[7]
Koustuv Dasgupta, Rahul Singh, Balaji Viswanathan, Dipanjan Chakraborty, Sougata Mukherjea, Amit A. Nanavati, and Anupam Joshi. 2008. Social ties and their relevance to churn in mobile telecom networks. In Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology (EDBT’08). ACM, 668--677.
[8]
Pedro Domingos and Matt Richardson. 2001. Mining the network value of customers. In Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’01). ACM, 57--66.
[9]
Martin Ester, Hans-Peter Kriegel, Jörg Sander, and Xiaowei Xu. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD’96). AAAI Press, 226--231.
[10]
Zhidan Feng, Xiaowei Xu, Nurcan Yuruk, and Thomas A. J. Schweiger. 2007. A novel similarity-based modularity function for graph partitioning. In Data Warehousing and Knowledge Discovery. Springer, 385--396.
[11]
Yoav Freund and Robert E. Schapire. 1996. Experiments with a new boosting algorithm. In Proceedings of the Thirteenth International Conference on Machine Learning. Morgan Kaufmann Publishers Inc., 148--156.
[12]
Andrea Galeotti, Sanjeev Goyal, and Jurjen Kamphorst. 2006. Network formation with heterogeneous players. Games and Economic Behavior 54, 2 (2006), 353--372.
[13]
Lise Getoor and Christopher P Diehl. 2005. Link mining: A survey. ACM SIGKDD Explorations Newsletter 7, 2 (2005), 3--12.
[14]
Mark Hall, Eibe Frank, Geoffrey Holmes, Bernhard Pfahringer, Peter Reutemann, and Ian H. Witten. 2009. The WEKA data mining software: An update. ACM SIGKDD Explorations Newsletter 11, 1 (2009), 10--18.
[15]
Tsung-Hao Hsu, Chien-Cheng Chen, Meng-Fen Chiang, Kuo-Wei Hsu, and Wen-Chih Peng. 2014. Inferring potential users in mobile social networks. In 2014 International Conference on Data Science and Advanced Analytics (DSAA’14). IEEE, 347--353.
[16]
Bingquan Huang, Mohand Tahar Kechadi, and Brian Buckley. 2012. Customer churn prediction in telecommunications. Expert Systems with Applications 39, 1 (2012), 1414--1425.
[17]
Jianbin Huang, Heli Sun, Jiawei Han, Hongbo Deng, Yizhou Sun, and Yaguang Liu. 2010. SHRINK: A structural clustering algorithm for detecting hierarchical communities in networks. In Proceedings of the 19th ACM International Conference on Information and Knowledge Management (CIKM’10). ACM, 219--228.
[18]
Yiqing Huang, Fangzhou Zhu, Mingxuan Yuan, Ke Deng, Yanhua Li, Bing Ni, Wenyuan Dai, Qiang Yang, and Jia Zeng. 2015. Telco churn prediction with big data. In Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data (SIGMOD’15). ACM, 607--618.
[19]
Shin-Yuan Hung, David C. Yen, and Hsiu-Yu Wang. 2006. Applying data mining to telecom churn management. Expert Systems with Applications 31, 3 (2006), 515--524.
[20]
Vincent Leroy, B. Barla Cambazoglu, and Francesco Bonchi. 2010. Cold start link prediction. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’10). ACM, 393--402.
[21]
Ryan N. Lichtenwalter, Jake T. Lussier, and Nitesh V. Chawla. 2010. New perspectives and methods in link prediction. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’10). ACM, 243--252.
[22]
Chun-Ta Lu, Hong-Han Shuai, and Philip S. Yu. 2014. Identifying your customers in social networks. In Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management (CIKM’14). ACM, 391--400.
[23]
Mark E.J. Newman and Michelle Girvan. 2004. Finding and evaluating community structure in networks. Physical Review E 69, 2 (2004), 026113.
[24]
Matthew Richardson and Pedro Domingos. 2002. Mining knowledge-sharing sites for viral marketing. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’02). ACM, 61--70.
[25]
Yossi Richter, Elad Yom-Tov, and Noam Slonim. 2010. Predicting customer churn in mobile networks through analysis of social groups. In Proceedings of the 2010 SIAM International Conference on Data Mining. SIAM, 732--741.
[26]
Yilin Shen and Hongxia Jin. 2014. Controllable information sharing for user accounts linkage across multiple online social networks. In Proceedings of the 23rd ACM International Conference on Information and Knowledge Management (CIKM’14). ACM, 381--390.
[27]
Yizhou Sun, Jiawei Han, Charu C. Aggarwal, and Nitesh V. Chawla. 2012. When will it happen?: relationship prediction in heterogeneous information networks. In Proceedings of the 5th ACM International Conference on Web Search and Data Mining (WSDM’12). ACM, 663--672.
[28]
Lei Tang, Xufei Wang, and Huan Liu. 2012. Community detection via heterogeneous interaction analysis. Data Mining and Knowledge Discovery 25, 1 (2012), 1--33.
[29]
Chih-Ping Wei and I-Tang Chiu. 2002. Turning telecommunications call details to churn prediction:A data mining approach. Expert Systems With Applications 23, 2 (2002), 103--112.
[30]
Shaomei Wu, Atish Das Sarma, Alex Fabrikant, Silvio Lattanzi, and Andrew Tomkins. 2013. Arrival and departure dynamics in social networks. In Proceedings of the 6th ACM International Conference on Web Search and Data Mining (WSDM’13). ACM, 233--242.
[31]
Yiming Yang and Jan O Pedersen. 1997. A comparative study on feature selection in text categorization. In Proceedings of the Fourteenth International Conference on Machine Learning (ICML’97). Morgan Kaufmann Publishers Inc., 412--420.
[32]
Jing Zhang, Jie Tang, Bangyong Liang, Zi Yang, Sijie Wang, Jingjing Zuo, and Juanzi Li. 2008. Recommendation over a heterogeneous social network. In The 9th International Conference on Web-Age Information Management, 2008 (WAIM’08). IEEE, 309--316.

Cited By

View all
  • (2022)Information matching model and multi-angle tracking algorithm for loan loss-linking customers based on the family mobile social-contact big data networkInformation Processing and Management: an International Journal10.1016/j.ipm.2021.10274259:1Online publication date: 1-Jan-2022

Index Terms

  1. Exploring Communication Behaviors of Users to Target Potential Users in Mobile Social Networks

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Transactions on Intelligent Systems and Technology
      ACM Transactions on Intelligent Systems and Technology  Volume 8, Issue 6
      Survey Paper, Regular Papers and Special Issue: Social Media Processing
      November 2017
      265 pages
      ISSN:2157-6904
      EISSN:2157-6912
      DOI:10.1145/3127339
      • Editor:
      • Yu Zheng
      Issue’s Table of Contents
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 18 August 2017
      Accepted: 01 December 2016
      Revised: 01 October 2016
      Received: 01 December 2015
      Published in TIST Volume 8, Issue 6

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. Communication behaviors
      2. feature engineering
      3. mobile social network

      Qualifiers

      • Research-article
      • Research
      • Refereed

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)5
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 04 Oct 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2022)Information matching model and multi-angle tracking algorithm for loan loss-linking customers based on the family mobile social-contact big data networkInformation Processing and Management: an International Journal10.1016/j.ipm.2021.10274259:1Online publication date: 1-Jan-2022

      View Options

      Get Access

      Login options

      Full Access

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media