| Issue |
ITM Web Conf.
Volume 12, 2017
The 4th Annual International Conference on Information Technology and Applications (ITA 2017)
|
|
|---|---|---|
| Article Number | 03015 | |
| Number of page(s) | 5 | |
| Section | Session 3: Computer | |
| DOI | https://doi.org/10.1051/itmconf/20171203015 | |
| Published online | 05 September 2017 | |
Mining Telecommunication Circles via the Call Record and Short Messages
School of Software Engineering, South China University of Technology, Guangzhou, China
767186977@qq.com
pjzhang@scut.edu.cn
Telecommunication circles are groups of similar customers in telecommunication networks. Mining such circles provides with telecommunication operators great value in developing prospective customers while retaining old ones. However, most of the existing community detecting algorithms utilize mainly the structure of the complex network and ignore the strength of relationship. This paper improves the classic CPM (Clique Percolation Method) algorithm by taking into account both the call record and short messages, and proposes a new algorithms called SR_CPM (Strengthened Relationship CPM). The new algorithm is applied to telecommunication networks and demonstrates superior effectiveness over CPM.
© The Authors, published by EDP Sciences, 2017
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.