Pairwise data clustering by deterministic annealing (1997)
Cached
Download Links
- [www.ocf.berkeley.edu]
- [www-dbv.cs.uni-bonn.de]
- [www.cs.brown.edu]
- [www-dbv.cs.uni-bonn.de]
- [ftp3.informatik.uni-bonn.de]
- DBLP
Other Repositories/Bibliography
| Venue: | IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE |
| Citations: | 171 - 23 self |
BibTeX
@ARTICLE{Hofmann97pairwisedata,
author = {Thomas Hofmann and Joachim M. Buhmann},
title = {Pairwise data clustering by deterministic annealing},
journal = {IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE},
year = {1997},
volume = {19},
number = {1},
pages = {1--14}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Partitioning a data set and extracting hidden structure from the data arises in different application areas of pattern recognition, speech and image processing. Pairwise data clustering is a combinatorial optimization method for data grouping which extracts hidden structure from proximity data. We describe a deterministic annealing 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.
Citations
No citations identified.
