Abstract
Mixture analysis, often achieved using the EM algorithm, is a classical clustering method. This paper generalizes the philosophy of mixture analysis and the methodology of the EM algorithm. This general setting allows the application of robust parameter estimation techniques in a coherent way to solving clustering problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
HAMPEL, F.R., RONCHETTI, E.M., ROUSSEEUW, P.J., and STAHEL, W.A. (1986): Robust Statistics: the Approach Based on Influence Functions. Wiley, New York.
PEARSON, K. (1894): Contribution to the Mathematical Theory of Evolution. Philosophical Transactions of the Royal Society of London, Series A, 185, 71110.
REDNER, R.A. and WALKER, H.F. (1984): Mixture Densities, Maximum Likelihood and the EM Algorithm. SIAM Review, 26, 195–239.
WINDHAM, M.P. (1996): Robustizing Mixture Analysis Using Model Weighting. In: W. Gaul and D. Pfeifer (Eds.): From Data to Knowledge. Springer, Heidelberg, 116–123.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Windham, M.P. (2000). Robust Clustering. In: Gaul, W., Opitz, O., Schader, M. (eds) Data Analysis. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58250-9_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-58250-9_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67731-4
Online ISBN: 978-3-642-58250-9
eBook Packages: Springer Book Archive