nips nips2001 nips2001-185 nips2001-185-reference knowledge-graph by maker-knowledge-mining

185 nips-2001-The Method of Quantum Clustering


Source: pdf

Author: David Horn, Assaf Gottlieb

Abstract: We propose a novel clustering method that is an extension of ideas inherent to scale-space clustering and support-vector clustering. Like the latter, it associates every data point with a vector in Hilbert space, and like the former it puts emphasis on their total sum, that is equal to the scalespace probability function. The novelty of our approach is the study of an operator in Hilbert space, represented by the Schr¨ dinger equation of o which the probability function is a solution. This Schr¨ dinger equation o contains a potential function that can be derived analytically from the probability function. We associate minima of the potential with cluster centers. The method has one variable parameter, the scale of its Gaussian kernel. We demonstrate its applicability on known data sets. By limiting the evaluation of the Schr¨ dinger potential to the locations of data points, o we can apply this method to problems in high dimensions.


reference text

[1] A.K. Jain and R.C. Dubes. Algorithms for clustering data. Prentice Hall, Englewood Cliffs, NJ, 1988.

[2] K. Fukunaga. Introduction to Statistical Pattern Recognition. Academic Press, San Diego, CA, 1990.

[3] R.O. Duda, P.E. Hart and D.G. Stork. Pattern Classification. Wiley-Interscience, 2nd ed., 2001.

[4] M. Blat, S. Wiseman and E. Domany. Super-paramagnetic clustering of data. Phys. Rev. Letters 76:3251-3255, 1996.

[5] S.J. Roberts. Non-parametric unsupervised cluster analysis. Pattern Recognition, 30(2):261–272, 1997.

[6] A. Ben-Hur, D. Horn, H.T. Siegelmann, and V. Vapnik. A Support Vector Method for Clustering. in Advances in Neural Information Processing Systems 13: Proceedings of the 2000 Conference Todd K. Leen, Thomas G. Dietterich and Volker Tresp eds., MIT Press 2001, pp. 367–373.

[7] David Horn and Assaf Gottlieb. Algorithm for Data Clustering in Pattern Recognition Problems Based on Quantum Mechanics. Phys. Rev. Lett. 88 (2002) 018702.

[8] S. Gasiorowicz. Quantum Physics. Wiley 1996.

[9] B. D. Ripley Pattern Recognition and Neural Networks. Cambridge University Press, Cambridge UK, 1996.

[10] R.A. Fisher. The use of multiple measurements in taxonomic problems. Annual Eugenics, 7:179–188, 1936.

[11] C.L. Blake and C.J. Merz. UCI repository of machine learning databases, 1998.

[12] W. H. Press, S. A. Teuklosky, W. T. Vetterling and B. P. Flannery. Numerical Recipes - The Art of Scientific Computing 2nd ed. Cambridge Univ. Press, 1992.

[13] A. L. Yuille and T. A. Poggio. Scaling theorems for zero crossings. IEEE Trans. Pattern Analysis and Machine Intelligence PAMI-8, 15-25, 1986.