Abstract
We propose universal clustering in line with the concepts of universal estimation. In order to illustrate the model of universal clustering we consider family of power loss functions in probabilistic space which is marginally linked to the Kullback-Leibler divergence. The model proved to be effective in application to the synthetic data. Also, we consider large web-traffic dataset. The aim of the experiment is to explain and understand the way people interact with web sites.
This work was supported by the grants of the Australian Research Council
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Nikulin, V., Smola, A.: Parametric model-based clustering. In: Dasarathy, B. (ed.) Data Mining, Intrusion Detection, Information Assurance, and Data Network Security, Orlando, Florida, USA, March 28-29. SPIE, vol. 5812, pp. 190–201 (2005)
Dhillon, I., Mallela, S., Kumar, R.: Divisive information-theoretic feature clustering algorithm for text classification. Journal of Machine Learning Research 3, 1265–1287 (2003)
Cohn, D., Hofmann, T.: The missing link - a probabilistic model of document content and hypertext connectivity. In: 13th Conference on Neural Information Processing Systems (2001)
Hwang, J.T.: Universal domination and stochastic domination: Estimation simultaneously under a broad class of loss functions. The Annals of Statistics 13, 295–314 (1985)
Rukhin, A.: Universal Bayes estimators. The Annals of Statistics 6, 1345–1351 (1978)
Hamerly, G., Elkan, C.: Learning the k in k-means. In: 16th Conference on Neural Information Processing Systems (2003)
Zhong, S., Ghosh, J.: A unified framework for model-based clustering. Journal of Machine Learning Research 4, 1001–1037 (2003)
Akaike, H.: On the likelihood of a time series model. The Statistician 27, 217–235 (1978)
Schwarz, G.: Estimating the dimension of a model. The Annals of Statistics 6, 461–464 (1978)
Fraley, C., Raftery, A.: How Many Clusters? Which Clustering Method? Answers via Model-based Cluster Analysis. The Computer Journal 41, 578–588 (1998)
Pollard, D.: Strong consistency of k-means clustering. The Annals of Statistics 10, 135–140 (1981)
Bhatia, S.: Adaptive k-means clustering. FLAIRS, 695–699 (2004)
Amari, S., Nagaoka, H.: Methods of Information Geometry. Oxford University Press, Oxford (1993)
Cadez, I., Heckerman, D., Meek, C., Smyth, P., White, S.: Model-based clustering and visualization of navigation patterns on a web site. Data Mining and Knowledge Discovery 7, 399–424 (2003)
Msnbc: msnbc.com anonymous web data. In: UCI Knowledge Discovery in Databases Archive (1999), http://kdd.ics.uci.edu/summary.data.type.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nikulin, V. (2005). Universal Clustering with Family of Power Loss Functions in Probabilistic Space. In: Gallagher, M., Hogan, J.P., Maire, F. (eds) Intelligent Data Engineering and Automated Learning - IDEAL 2005. IDEAL 2005. Lecture Notes in Computer Science, vol 3578. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11508069_41
Download citation
DOI: https://doi.org/10.1007/11508069_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26972-4
Online ISBN: 978-3-540-31693-0
eBook Packages: Computer ScienceComputer Science (R0)