Analytic Representation of Bayes Labeling and Bayes Clustering Operators for Random Labeled Point Processes

Clustering algorithms typically group points based on some similarity criterion, but without reference to an underlying random process to make clustering algorithms rigorously predictive. In fact, there exists a probabilistic theory of clustering in the context of random labeled point sets in which...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on signal processing Vol. 63; no. 6; pp. 1605 - 1620
Main Authors Dalton, Lori A., Benalcazar, Marco E., Brun, Marcel, Dougherty, Edward R.
Format Journal Article
LanguageEnglish
Published New York IEEE 15.03.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Clustering algorithms typically group points based on some similarity criterion, but without reference to an underlying random process to make clustering algorithms rigorously predictive. In fact, there exists a probabilistic theory of clustering in the context of random labeled point sets in which clustering error is defined in terms of the process. In the present paper, given an underlying point process we develop a general analytic procedure for finding an optimal clustering operator, the Bayes clusterer, that corresponds to the Bayes classifier in classification theory. We provide detailed solutions under Gaussian models. Owing to computational complexity we also develop approximations of the Bayes clusterer.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2015.2399870