IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v36y1998i4p401-413.html
   My bibliography  Save this article

Trimmed best k-nets: A robustified version of an L[infinity]-based clustering method

Author

Listed:
  • Cuesta-Albertos, J. A.
  • Gordaliza, A.
  • Matrán, C.

Abstract

The "impartial trimming" methodology in clustering analysis was initially designed (see Cuesta-Albertos et al., 1997) to gain protection against outliers and bridging objects (objects intermediate between clusters). In this work the methodology is applied to best k-nets. We include a study of optimal regions, which parallels that of trimmed k-means, showing that only non-pathological regions arise from impartial trimming procedures. Also we prove the strong consistency of the method by suitably varying the level of trimming with the size of the sample. A section is devoted to comparing the performance in a real data set of the suggested procedure with that of trimmed k-means.

Suggested Citation

  • Cuesta-Albertos, J. A. & Gordaliza, A. & Matrán, C., 1998. "Trimmed best k-nets: A robustified version of an L[infinity]-based clustering method," Statistics & Probability Letters, Elsevier, vol. 36(4), pages 401-413, January.
  • Handle: RePEc:eee:stapro:v:36:y:1998:i:4:p:401-413
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-7152(97)00087-4
    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. S. L. Hakimi, 1965. "Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems," Operations Research, INFORMS, vol. 13(3), pages 462-475, June.
    2. Gordaliza, A., 1991. "On the breakdown point of multivariate location estimators based on trimming procedures," Statistics & Probability Letters, Elsevier, vol. 11(5), pages 387-394, May.
    Full references (including those not matched with items on IDEAS)

    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. E L Hillsman, 1984. "The p-Median Structure as a Unified Linear Model for Location—Allocation Analysis," Environment and Planning A, , vol. 16(3), pages 305-318, March.
    2. Daoqin Tong & Alan T. Murray, 2009. "Maximising coverage of spatial demand for service," Papers in Regional Science, Wiley Blackwell, vol. 88(1), pages 85-97, March.
    3. K E Rosing, 1991. "Towards the Solution of the (Generalised) Multi-Weber Problem," Environment and Planning B, , vol. 18(3), pages 347-360, September.
    4. Averbakh, Igor & Berman, Oded, 1996. "Locating flow-capturing units on a network with multi-counting and diminishing returns to scale," European Journal of Operational Research, Elsevier, vol. 91(3), pages 495-506, June.
    5. Knight, V.A. & Harper, P.R. & Smith, L., 2012. "Ambulance allocation for maximal survival with heterogeneous outcome measures," Omega, Elsevier, vol. 40(6), pages 918-926.
    6. Mulder, H.M. & Pelsmajer, M.J. & Reid, K.B., 2006. "Generalized centrality in trees," Econometric Institute Research Papers EI 2006-16, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    7. Rolland, Erik & Schilling, David A. & Current, John R., 1997. "An efficient tabu search procedure for the p-Median Problem," European Journal of Operational Research, Elsevier, vol. 96(2), pages 329-342, January.
    8. Jones, Dylan & Firouzy, Sina & Labib, Ashraf & Argyriou, Athanasios V., 2022. "Multiple criteria model for allocating new medical robotic devices to treatment centres," European Journal of Operational Research, Elsevier, vol. 297(2), pages 652-664.
    9. 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.
    10. Yun, Lifen & Qin, Yong & Fan, Hongqiang & Ji, Changxu & Li, Xiaopeng & Jia, Limin, 2015. "A reliability model for facility location design under imperfect information," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 596-615.
    11. Faustino, Fausta J. & Lopes, José Calixto & Melo, Joel D. & Sousa, Thales & Padilha-Feltrin, Antonio & Brito, José A.S. & Garcia, Claudio O., 2023. "Identifying charging zones to allocate public charging stations for electric vehicles," Energy, Elsevier, vol. 283(C).
    12. Canos, M. J. & Ivorra, C. & Liern, V., 1999. "An exact algorithm for the fuzzy p-median problem," European Journal of Operational Research, Elsevier, vol. 116(1), pages 80-86, July.
    13. P B Mirchandani & A Oudjit, 1982. "Probabilistic Demands and Costs in Facility Location Problems," Environment and Planning A, , vol. 14(7), pages 917-932, July.
    14. Hakimi, S.Louis, 1983. "Network location theory and contingency planning," Energy, Elsevier, vol. 8(8), pages 697-702.
    15. Haase, Knut & Hoppe, Mirko, 2008. "Standortplanung unter Wettbewerb - Teil 1: Grundlagen," Discussion Papers 2/2008, Technische Universität Dresden, "Friedrich List" Faculty of Transport and Traffic Sciences, Institute of Transport and Economics.
    16. Sune Lauth Gadegaard & Andreas Klose & Lars Relund Nielsen, 2018. "A bi-objective approach to discrete cost-bottleneck location problems," Annals of Operations Research, Springer, vol. 267(1), pages 179-201, August.
    17. Jamie Dekle & Mariel S. Lavieri & Erica Martin & Hülya Emir-Farinas & Richard L. Francis, 2005. "A Florida County Locates Disaster Recovery Centers," Interfaces, INFORMS, vol. 35(2), pages 133-139, April.
    18. Snežana Tadić & Mladen Krstić & Željko Stević & Miloš Veljović, 2023. "Locating Collection and Delivery Points Using the p -Median Location Problem," Logistics, MDPI, vol. 7(1), pages 1-17, February.
    19. Kenneth Carling & Xiangli Meng, 2016. "On statistical bounds of heuristic solutions to location problems," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1518-1549, May.
    20. H. Emir-Farinas & R. Francis, 2005. "Demand Point Aggregation for Planar Covering Location Models," Annals of Operations Research, Springer, vol. 136(1), pages 175-192, April.

    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:stapro:v:36:y:1998:i:4:p:401-413. 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/wps/find/journaldescription.cws_home/622892/description#description .

    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.