title: On the universal clustering under a broad class of loss functions.
abstract: Determination of the number of significant clusters in the sample represents a very important problem. It is expected that the outcome of clustering under a broad class of loss functions will be more stable if the correct number of clusters is used. In order to illustrate the model of universal clustering we consider 1) family of power loss functions in probabilistic space; 2) family of exponential loss functions in Euclidean space. The proposed model is general, and proved to be effective in application to the synthetic datasets.
authors.affiliation: College of Engineering and Computer Science, Australian National University, Canberra, ACT 0200, Australia. vladimir.nikulin@anu.edu.au
authors.forename: Vladimir
authors.initials: V
authors.lastname: Nikulin
mesh_terms: D000465:Algorithms; D015233:Models, Statistical; D016571:Neural Networks, Computer