An improved clustering algorithm and its application
by Yunhong Ma; Xue Yang; Chenghan Wang; Feng Chen
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 12, No. 4, 2017

Abstract: Cluster analysis is an important issue for machine learning and pattern recognition, and clustering algorithms are used to solve these problems. Owing to the disadvantage of the traditional clustering algorithms that need iteration calculation and do not adapt to clustering random distribution data, an improved clustering algorithm named automatic clustering algorithm based on data contained ratio is developed. The concept of data contained ratio is proposed in the improved algorithm, the number of clusters is automatically determined based on data contained ratio, and the cluster centres are obtained accordingly. Several group test data testify and demonstrate the validity and effectiveness of the improved clustering algorithm. In addition, the comparison between the traditional K-means clustering algorithm and improved clustering algorithm is presented. Finally, the improved clustering algorithm is used to recognise the flight trace. The results demonstrate that the improved clustering algorithm can be used for pattern recognition; it has high adaptability and robustness in clustering random distribution data set.

Online publication date: Sun, 30-Jul-2017

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 Wireless and Mobile Computing (IJWMC):
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