IDEAS home Printed from https://ideas.repec.org/a/ids/ijbfmi/v1y2010i3-4p201-216.html
   My bibliography  Save this article

Genetic algorithm-based clustering ensemble: determination number of clusters

Author

Listed:
  • Mehdi Mohammadi
  • Ali Azadeh
  • Morteza Saberi
  • Amir Azaron

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).

Suggested Citation

  • Mehdi Mohammadi & Ali Azadeh & Morteza Saberi & Amir Azaron, 2010. "Genetic algorithm-based clustering ensemble: determination number of clusters," International Journal of Business Forecasting and Marketing Intelligence, Inderscience Enterprises Ltd, vol. 1(3/4), pages 201-216.
  • Handle: RePEc:ids:ijbfmi:v:1:y:2010:i:3/4:p:201-216
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=36004
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijbfmi:v:1:y:2010:i:3/4:p:201-216. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=156 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.