IDEAS home Printed from https://ideas.repec.org/a/taf/japsta/v40y2013i9p1875-1892.html
   My bibliography  Save this article

Clustering algorithm for proximity-relation matrix and its applications

Author

Listed:
  • Wen-Liang Hung
  • De-Hua Chen

Abstract

In this paper, we present a new algorithm for clustering proximity-relation matrix that does not require the transitivity property. The proposed algorithm is first inspired by the idea of Yang and Wu [16] then turned into a self-organizing process that is built upon the intuition behind clustering. At the end of the process subjects belonging to be the same cluster should converge to the same point, which represents the cluster center. However, the performance of Yang and Wu's algorithm depends on parameter selection. In this paper, we use the partition entropy (PE) index to choose it. Numerical result illustrates that the proposed method does not only solve the parameter selection problem but also obtains an optimal clustering result. Finally, we apply the proposed algorithm to three applications. One is to evaluate the performance of higher education in Taiwan, another is machine--parts grouping in cellular manufacturing systems, and the other is to cluster probability density functions.

Suggested Citation

  • Wen-Liang Hung & De-Hua Chen, 2013. "Clustering algorithm for proximity-relation matrix and its applications," Journal of Applied Statistics, Taylor & Francis Journals, vol. 40(9), pages 1875-1892, September.
    • Handle: RePEc:taf:japsta:v:40:y:2013:i:9:p:1875-1892
    DOI: 10.1080/02664763.2013.799126
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/02664763.2013.799126
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/02664763.2013.799126?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
    ---><---

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

    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:taf:japsta:v:40:y:2013:i:9:p:1875-1892. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/CJAS20 .

    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.