30 August 2005 Clustering algorithms do not learn, but they can be learned
Author Affiliations +
Abstract
Pattern classification theory involves an error criterion, optimal classifiers, and a theory of learning. For clustering, there has historically been little theory; in particular, there has generally (but not always) been no learning. The key point is that clustering has not been grounded on a probabilistic theory. Recently, a clustering theory has been developed in the context of random sets. This paper discusses learning within that context, in particular, k- nearest-neighbor learning of clustering algorithms.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Marcel Brun, Marcel Brun, Edward R. Dougherty, Edward R. Dougherty, } "Clustering algorithms do not learn, but they can be learned", Proc. SPIE 5916, Mathematical Methods in Pattern and Image Analysis, 59160T (30 August 2005); doi: 10.1117/12.617418; https://doi.org/10.1117/12.617418
PROCEEDINGS
9 PAGES


SHARE
Back to Top