This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dynamic Characterization of Cluster Structures for Robust and Inductive Support Vector Clustering
November 2006 (vol. 28 no. 11)
pp. 1869-1874
A topological and dynamical characterization of the cluster structures described by the support vector clustering is developed. It is shown that each cluster can be decomposed into its constituent basin level cells and can be naturally extended to an enlarged clustered domain, which serves as a basis for inductive clustering. A simplified weighted graph preserving the topological structure of the clusters is also constructed and is employed to develop a robust and inductive clustering algorithm. Simulation results are given to illustrate the robustness and effectiveness of the proposed method.

[1] A. Ben-Hur, D. Horn, H.T. Siegelmann, and V. Vapnik, “Support Vector Clustering,” J. Machine Learning Research, vol. 2, pp. 125-137, 2001.
[2] C.J. Burges, “A Tutorial on Support Vector Machines for Pattern Recognition,” Data Mining and Knowledge Discovery, vol. 2, no. 2, pp. 121-167, 1998.
[3] F. Camastra and A. Verri, “A Novel Kernel Method for Clustering,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 3, pp. 461-464, Mar. 2005.
[4] H.K. Khalil, Nonlinear Systems. New York: Macmillan, 1992.
[5] J. Lee and H.-D. Chiang, “A Dynamical Trajectory-Based Methodology for Systematically Computing Multiple Optimal Solutions of General Nonlinear Programming Problems,” IEEE Trans. Automatic Control, vol. 49, no. 6, pp.888-899, June 2004.
[6] J. Lee and D. Lee, “An Improved Cluster Labeling Method for Support Vector Clustering,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 3, pp. 461-464, Mar. 2005.
[7] B. Scholkopf, J. Platt, J. Shawe-Taylor, A.J. Smola, and R.C. Williamson, “Estimating the Support of a High-Dimensional Distribution,” Neural Computation, vol. 13, no. 7, pp. 1443-1472, 2001.
[8] D.M.J. Tax and R.P.W. Duin, “Support Vector Domain Description,” Pattern Recognition Letters, vol. 20, pp. 1191-1199, 1999.
[9] V.N. Vapnik, “An Overviewof Statistical Learning Theory,” IEEE Trans. Neural Networks, vol. 10, pp. 988-999, Sept. 1999.
[10] J. Yang, V. Estivill-Castro, and S.K. Chalup, “Support Vector Clustering through Proximity Graph Modelling,” Proc. Ninth Int'l Conf. Neural Information Processing (ICONIP '02), pp. 898-903, 2002.
[11] R. Jensen, D. Erdogmus, J.C. Principe, and T. Eltoft, “The Laplacian PDF Distance: A Cost Function for Clustering in a Kernel Feature Space,” Advances in Neural Information Processing Systems (NIPS), vol. 17, pp. 625-632, Cambridge, Mass.: MIT Press, 2005.
[12] M. Girolami, “Mercer Kernel Based Clustering in Feature Space,” IEEE Trans. Neural Networks, vol. 13, no. 4, pp. 780-784, July 2002.
[13] A.Y. Ng, M.I. Jordan, and Y. Weiss, “On Spectral Clustering: Analysis and an Algorithm,” Advances in Neural Information Processing Systems (NIPS), vol. 14, 2002.
[14] UCI Repository of Machine Learning Databases, http:www.ics.uci.edu/~mlearnMLRepository.html , 2006.

Index Terms:
Clustering, kernel methods, support vector machines, inductive learning, dynamical systems.
Citation:
Jaewook Lee, Daewon Lee, "Dynamic Characterization of Cluster Structures for Robust and Inductive Support Vector Clustering," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 11, pp. 1869-1874, Nov. 2006, doi:10.1109/TPAMI.2006.225
Usage of this product signifies your acceptance of the Terms of Use.