Variable penalty factors: a new GEP automatic clustering algorithm
by Yan Chen; Kangshun Li; Haohua Huang
International Journal of Computational Science and Engineering (IJCSE), Vol. 15, No. 1/2, 2017

Abstract: The clustering algorithm is considered as an important and basic method in the field of data mining on interdisciplinary researches. Various problems such as sensitive selection of initial clustering centre, easy to fall into local optimal solution, poor universal search capacity and requiring prior knowledge for determining numbers of clusters still exist in the traditional clustering algorithm. A gene expression programming (GEP) automatic clustering algorithm with variable penalty factors is adopted in this paper, featuring combination of penalty factors and GEP clustering algorithm, no requirements for prior knowledge on the data set, automatic division of clusters and better solution for the impact of isolated points and noise points. The simulation experiment makes further proof of the effectiveness of the algorithm in this paper.

Online publication date: Mon, 21-Aug-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 Computational Science and Engineering (IJCSE):
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