A General Partition Cluster Algorithm

Daniel Peña (), Julio Rodríguez and George C. Tiao
Additional contact information
Daniel Peña: Universidad Carlos III de Madrid, Departamento de Estadística
Julio Rodríguez: Universidad Politécnica de Madrid, Laboratorio de Estadística
George C. Tiao: University of Chicago, Graduate School of Business

A chapter in COMPSTAT 2004 — Proceedings in Computational Statistics, 2004, pp 371-379 from Springer

Abstract: Abstract A new cluster algorithm based on the SAR procedure proposed by Peña and Tiao [9] is presented. The method splits the data into more homogeneous groups by putting together observations which have the same sensitivity to the deletion of extreme points in the sample. As the sample is always split by this method the second stage is to check if observations outside each group can be recombined one by one into the groups by using the distance implied by the model. The performance of this algorithm is compared to some well known cluster methods.

Keywords: Predictive distribution; robust estimation; SAR procedure (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-7908-2656-2_30

Ordering information: This item can be ordered from
http://www.springer.com/9783790826562

DOI: 10.1007/978-3-7908-2656-2_30

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().