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

Clustering Panel Data Via Perturbed Adaptive Simulated Annealing And Genetic Algorithms

Author

Listed:
  • DANIEL C. BONZO

    (School of Statistics, University of the Philippines, Diliman, Quezon City, Philippines)

  • AUGUSTO Y. HERMOSILLA

    (Department of Mathematics, University of the Philippines, Diliman, Quezon City, Philippines)

Abstract

Non-hierarchical cluster analysis for panel data is known to be hampered by structural preservation, computational complexity and efficiency, and dependency problems. Resolving these issues becomes increasingly important as efficient collection and maintenance of panel data make application more conducive.To address some computational issues and structural preservation, Bonzo [3] presented a stochastic version of Kosmelj and Batagelj's approach [16] to clustering panel data. The method used aprobability link function(instead of the usual distance functions) in defining cluster inertias with the aim of preserving the clusters' probabilistic structure. Formulating clustering as an optimization problem, the objective function allows the application of heuristic and stochastic optimization techniques.In this paper, we present a modified heuristic foradaptive simulated annealing(ASA) by perturbing the state vector's sampling distribution, specifically, by perturbing the drift of a diffusion process. Such an approach has been used to hasten convergence towards global optimum at equilibrium for diversely complex, combinatorial, and large-scale systems. Theperturbed ASA(PASA) heuristic is then embedded in agenetic algorithm(GA) procedure to hasten and improve the stochastic local search process. The PASA-GA hybrid can be further modified and improved such as by explicit parallel implementation.

Suggested Citation

  • Daniel C. Bonzo & Augusto Y. Hermosilla, 2002. "Clustering Panel Data Via Perturbed Adaptive Simulated Annealing And Genetic Algorithms," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 5(04), pages 339-360.
    • Handle: RePEc:wsi:acsxxx:v:05:y:2002:i:04:n:s0219525902000559
    DOI: 10.1142/S0219525902000559
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219525902000559
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0219525902000559?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:05:y:2002:i:04:n:s0219525902000559. 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.