Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
