IDEAS home Printed from https://ideas.repec.org/a/wsi/acsxxx/v13y2010i02ns0219525910002499.html
   My bibliography  Save this article

A Multiagent Coordination Approach To Robust Consensus Clustering

Author

Listed:
  • ADRIAN AGOGINO

    (UCSC, NASA Ames Research Center, Mailstop 269-3, Moffett Field, California 94035, USA)

  • KAGAN TUMER

    (Oregon State University, 204 Rogers Hall, Corvallis, Oregon 97331, USA)

Abstract

In many distributed modeling, control or information processing applications, clustering patterns that share certain similarities is the critical first step. However, many traditional clustering algorithms require centralized processing, reliable data collection and the availability of all the raw data in one place at one time. None of these requirement can be met in many complex real world problems. In this paper, we present an agent-based method for combining multiple base clusterings into a single unified "consensus" clustering that is robust against many types of failures and does not require spatial/temporal synchronization. In this approach, agents process clusterings coming from separate sources and pool them to produce a unified consensus. The first contribution of this work is to provide an adaptive method by which the agents update their selections to maximize an objective function based on the quality of the consensus clustering. The second contribution of this work is in providing intermediate agent-specific objective functions that significantly improve the quality of the consensus clustering process. Our results show that this agent-based method achieves comparable or better performance than traditional non-agent consensus clustering methods in fault-free conditions, and remains effective under a wide range of failure scenarios that paralyze the traditional methods.

Suggested Citation

  • Adrian Agogino & Kagan Tumer, 2010. "A Multiagent Coordination Approach To Robust Consensus Clustering," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 13(02), pages 165-197.
  • Handle: RePEc:wsi:acsxxx:v:13:y:2010:i:02:n:s0219525910002499
    DOI: 10.1142/S0219525910002499
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219525910002499
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0219525910002499?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.

    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:wsi:acsxxx:v:13:y:2010:i:02:n:s0219525910002499. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/acs/acs.shtml .

    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.