Universal clustering with regularization in probabilistic space

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose universal clustering in line with the concepts of universal estimation. In order to illustrate above model we introduce family of power loss functions in probabilistic space which is marginally linked to the Kullback-Leibler divergence. Above 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. The paper proposes special regularization in order to ensure consistency of the corresponding clustering model. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Nikulin, V., & Smola, A. J. (2005). Universal clustering with regularization in probabilistic space. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3587 LNAI, pp. 142–152). Springer Verlag. https://doi.org/10.1007/11510888_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free