Telecom customer clustering via glowworm swarm optimisation algorithm
by Yanli Liu; Mengyu Zhu
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 14, No. 4, 2019

Abstract: The glowworm swarm optimisation (GSO) algorithm is a novel algorithm with the simultaneous computation of multiple optima of multimodal functions. Data-clustering techniques are classification algorithms that have a wide range of applications. Since K-means algorithm is easy to fall into the local optimum by the selection of initial clustering centre, GSO algorithm is used for the telecom customers clustering. The customer consumption data is extracted by means of the recency frequency monetary (RFM) model and the standardised data is clustered automatically using the GSO algorithm's synchronous optimisation ability. In the clustering optimisation algorithm, adaptive step size is used instead of the original fixed step size to avoid local optimisation of the algorithm and obtain higher accuracy. Compared with K-means clustering algorithm, GSO approach can automatically generate the number of clusters and use RFM model to reduce effectively the size of the data processing. The results of the experiments demonstrate that the GSO-based clustering technique is a promising technique for the data clustering problems.

Online publication date: Mon, 23-Sep-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com