A probabilistic theory of clustering Academic Article uri icon

abstract

  • Data clustering is typically considered a subjective process, which makes it problematic. For instance, how does one make statistical inferences based on clustering? The matter is different with pattern classification, for which two fundamental characteristics can be stated: (1) the error of a classifier can be estimated using "test data," and (2) a classifier can be learned using "training data." This paper presents a probabilistic theory of clustering, including both learning (training) and error estimation (testing). The theory is based on operators on random labeled point processes. It includes an error criterion in the context of random point sets and representation of the Bayes (optimal) cluster operator for a given random labeled point process. Training is illustrated using a nearest-neighbor approach, and trained cluster operators are compared to several classical clustering algorithms. 2003 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

published proceedings

  • Pattern Recognition

author list (cited authors)

  • Dougherty, E. R., & Brun, M.

citation count

  • 42

complete list of authors

  • Dougherty, Edward R||Brun, Marcel

publication date

  • May 2004