IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v24y1997i2p217-234.html
   My bibliography  Save this article

Clustering on trees

Author

Listed:
  • Maravalle, Maurizio
  • Simeone, Bruno
  • Naldini, Rosella

Abstract

No abstract is available for this item.

Suggested Citation

  • Maravalle, Maurizio & Simeone, Bruno & Naldini, Rosella, 1997. "Clustering on trees," Computational Statistics & Data Analysis, Elsevier, vol. 24(2), pages 217-234, April.
    • Handle: RePEc:eee:csdana:v:24:y:1997:i:2:p:217-234
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-9473(96)00062-X
    Download Restriction: Full text for ScienceDirect subscribers only.
    ---><---

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

    References listed on IDEAS

    as
    1. Anuška Ferligoj & Vladimir Batagelj, 1982. "Clustering with relational constraint," Psychometrika, Springer;The Psychometric Society, vol. 47(4), pages 413-426, December.
    2. John M. Mulvey & Harlan P. Crowder, 1979. "Cluster Analysis: An Application of Lagrangian Relaxation," Management Science, INFORMS, vol. 25(4), pages 329-340, April.
    3. P. Hansen & B. Jaumard & K. Musitu, 1990. "Weight constrained maximum split clustering," Journal of Classification, Springer;The Classification Society, vol. 7(2), pages 217-240, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Alexandre Xavier Ywata Carvalho & Pedro Henrique Melo Albuquerque & Gilberto Rezende de Almeida Junior & Rafael Dantas Guimarães, 2009. "Clusterização Hierárquica Espacial," Discussion Papers 1427, Instituto de Pesquisa Econômica Aplicada - IPEA.
    2. Liverani, Marco & Morgana, Aurora & Simeone, Bruno & Storchi, Giovanni, 2000. "Path equipartition in the Chebyshev norm," European Journal of Operational Research, Elsevier, vol. 123(2), pages 428-435, June.
    3. Alexandre Xavier Ywata Carvalho & Pedro Henrique Melo Albuquerque & Gilberto Rezende de Almeida Junior & Rafael Dantas Guimarães & Camilo Rey Laureto, 2009. "Clusterização Hierárquica Espacial com Atributos Binários," Discussion Papers 1428, Instituto de Pesquisa Econômica Aplicada - IPEA.
    4. Lele Wang & Zhao Zhang & Di Wu & Weili Wu & Lidan Fan, 2013. "Max-min weight balanced connected partition," Journal of Global Optimization, Springer, vol. 57(4), pages 1263-1275, December.
    5. G. Damiana Costanzo, 2001. "A constrainedk-means clustering algorithm for classifying spatial units," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 10(1), pages 237-256, January.
    6. Miyazawa, Flávio K. & Moura, Phablo F.S. & Ota, Matheus J. & Wakabayashi, Yoshiko, 2021. "Partitioning a graph into balanced connected classes: Formulations, separation and experiments," European Journal of Operational Research, Elsevier, vol. 293(3), pages 826-836.
    7. Ponce, Diego & Puerto, Justo & Temprano, Francisco, 2024. "Mixed-integer linear programming formulations and column generation algorithms for the Minimum Normalized Cuts problem on networks," European Journal of Operational Research, Elsevier, vol. 316(2), pages 519-538.
    8. Zhou, Ruoyu & Shu, Lianjie & Su, Yan, 2015. "An adaptive minimum spanning tree test for detecting irregularly-shaped spatial clusters," Computational Statistics & Data Analysis, Elsevier, vol. 89(C), pages 134-146.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chen, Ja-Shen & Heragu, Sunderesh S., 1999. "Stepwise decomposition approaches for large scale cell formation problems," European Journal of Operational Research, Elsevier, vol. 113(1), pages 64-79, February.
    2. Chen, Mu-Chen & Wu, Hsiao-Pin, 2005. "An association-based clustering approach to order batching considering customer demand patterns," Omega, Elsevier, vol. 33(4), pages 333-343, August.
    3. Rui Fragoso & Conceição Rego & Vladimir Bushenkov, 2016. "Clustering of Territorial Areas: A Multi-Criteria Districting Problem," Journal of Quantitative Economics, Springer;The Indian Econometric Society (TIES), vol. 14(2), pages 179-198, December.
    4. Lau, Kin-nam & Leung, Pui-lam & Tse, Ka-kit, 1999. "A mathematical programming approach to clusterwise regression model and its extensions," European Journal of Operational Research, Elsevier, vol. 116(3), pages 640-652, August.
    5. Michael Brusco & Douglas Steinley, 2015. "Affinity Propagation and Uncapacitated Facility Location Problems," Journal of Classification, Springer;The Classification Society, vol. 32(3), pages 443-480, October.
    6. Joshua Q. Hale & Enlu Zhou & Jiming Peng, 2017. "A Lagrangian search method for the P-median problem," Journal of Global Optimization, Springer, vol. 69(1), pages 137-156, September.
    7. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    8. Pierpaolo D’Urso & Vincenzina Vitale, 2022. "A Kemeny Distance-Based Robust Fuzzy Clustering for Preference Data," Journal of Classification, Springer;The Classification Society, vol. 39(3), pages 600-647, November.
    9. Juan Carlos Duque & Raúl Ramos & Jordi Suriñach, 2007. "Supervised Regionalization Methods: A Survey," International Regional Science Review, , vol. 30(3), pages 195-220, July.
    10. Renato Coppi & Pierpaolo D’Urso & Paolo Giordani, 2010. "A Fuzzy Clustering Model for Multivariate Spatial Time Series," Journal of Classification, Springer;The Classification Society, vol. 27(1), pages 54-88, March.
    11. Benati, Stefano & García, Sergio, 2012. "A p-median problem with distance selection," DES - Working Papers. Statistics and Econometrics. WS ws121913, Universidad Carlos III de Madrid. Departamento de Estadística.
    12. Juan Carlos Duque & Raúl Ramos, 2004. "Design of homogenous territorial units: a methodological proposal," ERSA conference papers ersa04p6, European Regional Science Association.
    13. Michael Brusco & Hans-Friedrich Köhn, 2009. "Exemplar-Based Clustering via Simulated Annealing," Psychometrika, Springer;The Psychometric Society, vol. 74(3), pages 457-475, September.
    14. Lozano, S. & Guerrero, F. & Onieva, L. & Larraneta, J., 1998. "Kohonen maps for solving a class of location-allocation problems," European Journal of Operational Research, Elsevier, vol. 108(1), pages 106-117, July.
    15. Vakharia, Asoo J. & Mahajan, Jayashree, 2000. "Clustering of objects and attributes for manufacturing and marketing applications," European Journal of Operational Research, Elsevier, vol. 123(3), pages 640-651, June.
    16. Holmberg, Kaj, 1997. "Mean value cross decomposition applied to integer programming problems," European Journal of Operational Research, Elsevier, vol. 97(1), pages 124-138, February.
    17. Andrzej Młodak, 2021. "k-Means, Ward and Probabilistic Distance-Based Clustering Methods with Contiguity Constraint," Journal of Classification, Springer;The Classification Society, vol. 38(2), pages 313-352, July.
    18. Shruti Shashikumar & Rakesh D. Raut & Vaibhav S. Narwane & Bhaskar B. Gardas & Balkrishna E. Narkhede & Anjali Awasthi, 2019. "A novel approach to determine the cell formation using heuristics approach," OPSEARCH, Springer;Operational Research Society of India, vol. 56(3), pages 628-656, September.
    19. Dongyoung Kim & Sungwon Jung & Yongwook Jeong, 2021. "Theft Prediction Model Based on Spatial Clustering to Reflect Spatial Characteristics of Adjacent Lands," Sustainability, MDPI, vol. 13(14), pages 1-14, July.
    20. Kulkarni, Girish & Fathi, Yahya, 2007. "Integer programming models for the q-mode problem," European Journal of Operational Research, Elsevier, vol. 182(2), pages 612-625, October.

    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:eee:csdana:v:24:y:1997:i:2:p:217-234. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    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.