IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v12y2016i8p9807206.html
   My bibliography  Save this article

Proper Global Shared Preference Detection Based on Golden Section and Genetic Algorithm for Affinity Propagation Clustering

Author

Listed:
  • Libin Jiao
  • Rongfang Bie
  • Guangzhi Zhang
  • Shenling Wang
  • Rashid Mehmood

Abstract

Affinity propagation (AP) clustering is a well-known effective clustering algorithm that outperforms other traditional clustering algorithms. However, the quality of clustering results depends considerably on related sensitive parameters (i.e., preferences and the damping factor). Thus, a feasible procedure based on golden section (GS) and the genetic algorithm (GA) is proposed. This procedure, called the “GS/GA-AP†algorithm, can perform proper global shared preference detection, including identifying a suitable number of clusters. A global shared preference is provided using the GS value between the minimum and maximum of similarities for AP as a default option, and the unsatisfactory clustering result becomes robust when the parameter with GA is selected. Finally, satisfactory experiments using one simulation data set and eight benchmark data sets are performed to verify the effectiveness of the proposed algorithm. The results indicate that GS/GA-AP clearly outperforms the original AP clustering algorithm.

Suggested Citation

  • Libin Jiao & Rongfang Bie & Guangzhi Zhang & Shenling Wang & Rashid Mehmood, 2016. "Proper Global Shared Preference Detection Based on Golden Section and Genetic Algorithm for Affinity Propagation Clustering," International Journal of Distributed Sensor Networks, , vol. 12(8), pages 9807206-980, July.
  • Handle: RePEc:sae:intdis:v:12:y:2016:i:8:p:9807206
    DOI: 10.1177/155014779807206
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/155014779807206
    Download Restriction: no

    File URL: https://libkey.io/10.1177/155014779807206?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:sae:intdis:v:12:y:2016:i:8:p:9807206. 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: SAGE Publications (email available below). General contact details of provider: .

    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.