[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.5555/3009055.3009115guideproceedingsArticle/Chapter ViewAbstractPublication PagesnipsConference Proceedingsconference-collections
Article

A randomized algorithm for pairwise clustering

Published: 01 December 1998 Publication History

Abstract

We present a stochastic clustering algorithm based on pairwise similarity of datapoints. Our method extends existing deterministic methods, including agglomerative algorithms, min-cut graph algorithms, and connected components. Thus it provides a common framework for all these methods. Our graph-based method differs from existing stochastic methods which are based on analogy to physical systems. The stochastic nature of our method makes it more robust against noise, including accidental edges and small spurious clusters. We demonstrate the superiority of our algorithm using an example with 3 spiraling bands and a lot of noise.

References

[1]
Blatt M., Wiseman S. and Domany E., "Data clustering usmg a model granular magnet", Neural Computation 9, 1805-1842, 1997.
[2]
Duda O. and Hart E., "Pattern classification and scene analysis", Wiley-Interscience, New York, 1973.
[3]
Hofmann T. and Buhmann J., "Pairwise data clustering by deterministic annealing", PAMI 19, 1-14, 1997.
[4]
Jain A. and Dubes R., "Algorithms for clustering data", Prentice Hall, NJ, 1988.
[5]
Karger D., "A new approach to the minimum cut problem", Journal of the ACM, 43(4) 1996.
[6]
Klock H. and Buhmann J., "Data visualization by multidimensional scaling: a deterministic annealing approach", Technical Report IAI-TR-96-8, Institut fur Informatik III, University of Bonn. October 1996.
[7]
Linial N., London E. and Rabinovich Y., "The geometry of graphs and some of its algorithmic applications", Combinatorica 15, 215-245, 1995.
[8]
Rose K., Gurewitz E. and Fox G., "Constrained clustering as an optimization method", PAMI 15, 785-794, 1993.
[9]
Shi J. and Malik J., "Normalized cuts and image segmentation", Proc. CVPR, 731- 737, 1997.
[10]
Smith S., "Threshold validity for mutual neighborhood clustering", PAMI 15, 89-92, 1993.
[11]
Wu Z. and Leahy R., "An optimal graph theoretic approach to data clustering: theory and its application to image segmentation", PAMI 15, 1101-1113, 1993.

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings
NIPS'98: Proceedings of the 12th International Conference on Neural Information Processing Systems
December 1998
1080 pages

Publisher

MIT Press

Cambridge, MA, United States

Publication History

Published: 01 December 1998

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 0
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 14 Jan 2025

Other Metrics

Citations

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media