A robust linear grouping algorithm

Subscribe to email list

Please select the email list(s) to which you wish to subscribe.

You are here

A robust linear grouping algorithm

TitleA robust linear grouping algorithm
Publication TypeConference Paper
Year of Publication2006
AuthorsPison, G, Van Aelst, S, Zamar, RH
EditorRizzi, A, Vichi, M
Conference NameCOMPSTAT 2006: Proceedings in Computational Statistics
PublisherPHYSICA-VERLAG GMBH & CO
Conference LocationTIERGARTENSTR 17, D-69121 HEIDELBERG, GERMANY
ISBN Number3-7908-1708-2
Keywordslinear grouping, Robustness, trimming
AbstractRecently, an algorithm to detect groups in a dataset that follow different linear patterns was proposed in [VWZ06]. The algorithm is flexible in the sense that it does not require the specification of a response variable. On the other hand, the algorithm requires that each observation follows one of the linear patterns in the data. However, it often occurs in practice that part of the data does not follow any of the linear patterns. Therefore, we introduce a robust linear grouping algorithm based on trimming that can still find the linear structures even if part of the data does not belong to any of the groups.
DOI10.1007/978-3-7908-1709-6_4