CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 1997 vol.19 Issue No.01 - January
Issue No.01 - January (1997 vol.19)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.566806
<p><b>Abstract</b>—Partitioning a data set and extracting hidden structure from the data arises in different application areas of pattern recognition, speech and image processing. <it>Pairwise data clustering</it> is a combinatorial optimization method for data grouping which extracts hidden structure from proximity data. We describe a <it>deterministic annealing</it> approach to pairwise clustering which shares the robustness properties of maximum entropy inference. The resulting Gibbs probability distributions are estimated by mean-field approximation. A new structure-preserving algorithm to cluster dissimilarity data and to simultaneously embed these data in a Euclidian vector space is discussed which can be used for dimensionality reduction and data visualization. The suggested embedding algorithm which outperforms conventional approaches has been implemented to analyze dissimilarity data from protein analysis and from linguistics. The algorithm for pairwise data clustering is used to segment textured images.</p>
pairwise data clustering, deterministic annealing, maxiumum entropy method, multidimensional scaling, texture segmentation, exploratory data analysis, nonlinear dimensionality reduction.
Thomas Hofmann, "Pairwise Data Clustering by Deterministic Annealing", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.19, no. 1, pp. 1-14, January 1997, doi:10.1109/34.566806