Genetic algorithm-based clustering ensemble: determination number of clusters
by Mehdi Mohammadi, Ali Azadeh, Morteza Saberi, Amir Azaron
International Journal of Business Forecasting and Marketing Intelligence (IJBFMI), Vol. 1, No. 3/4, 2010

Abstract: Genetic algorithms (GAs) have been used in the clustering subject. Also, a clustering ensemble as one acceptable clustering method combines the results of multiple clustering methods on a given dataset and creates final clustering on the dataset. In this paper, genetic algorithm base on clustering ensemble (GACE) is introduced for finding optimal clusters. The most important property of our method is the ability to extract the number of clusters. With this ability, the need for data examination is removed, and then solving related problems will not be time consuming. GACE is applied to eight series of databases. Experimental results were compared with other four clustering methods. Data envelopment analysis (DEA) is used to compare methods. The results of DEA indicate that GACE is the best method. The four methods are co-association function and average link (CAL), co-association function and K-means (CK), hypergraph-partitioning algorithm (HGPA) and cluster-based similarity partitioning (CSPA).

Online publication date: Tue, 12-Oct-2010

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 Business Forecasting and Marketing Intelligence (IJBFMI):
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