@conference { ISI:000242170000004,
	title = {A robust linear grouping algorithm},
	booktitle = {COMPSTAT 2006: Proceedings in Computational Statistics},
	year = {2006},
	note = {17th Symposium on Computational Statistics (COMSTAT 2006), Rome, ITALY, AUG 28-SEP 01, 2006},
	pages = {43-53},
	publisher = {PHYSICA-VERLAG GMBH \& CO},
	organization = {PHYSICA-VERLAG GMBH \& CO},
	type = {Proceedings Paper},
	address = {TIERGARTENSTR 17, D-69121 HEIDELBERG, GERMANY},
	abstract = {Recently, 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.},
	keywords = {linear grouping, Robustness, trimming},
	isbn = {3-7908-1708-2},
	doi = {10.1007/978-3-7908-1709-6_4},
	author = {Pison, Greet and Van Aelst, Stefan and Zamar, Ruben H.},
	editor = {Rizzi, A and Vichi, M}
}
