The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - Nov. (2013 vol.25)
pp: 2494-2506
V. D'Orangeville , University of Sherbrooke, Sherbrooke
M. Andre Mayers , University of Sherbrooke, Sherbrooke
M. Ernest Monga , University of Sherbrooke, Sherbrooke
M. Shengrui Wang , University of Sherbrooke, Sherbrooke
ABSTRACT
We propose a new efficient algorithm for solving the cluster labeling problem in support vector clustering (SVC). The proposed algorithm analyzes the topology of the function describing the SVC cluster contours and explores interconnection paths between critical points separating distinct cluster contours. This process allows distinguishing disjoint clusters and associating each point to its respective one. The proposed algorithm implements a new fast method for detecting and classifying critical points while analyzing the interconnection patterns between them. Experiments indicate that the proposed algorithm significantly improves the accuracy of the SVC labeling process in the presence of clusters of complex shape, while reducing the processing time required by existing SVC labeling algorithms by orders of magnitude.
INDEX TERMS
Labeling, Clustering algorithms, Algorithm design and analysis, Static VAr compensators, Accuracy, Support vector machines, Kernel,mining methods and algorithms, Clustering, data mining
CITATION
V. D'Orangeville, M. Andre Mayers, M. Ernest Monga, M. Shengrui Wang, "Efficient Cluster Labeling for Support Vector Clustering", IEEE Transactions on Knowledge & Data Engineering, vol.25, no. 11, pp. 2494-2506, Nov. 2013, doi:10.1109/TKDE.2012.190
REFERENCES
[1] A. Ben-Hur, D. Horn, H.T. Siegelmann, and V. Vapnik, "A Support Vector Clustering Method," Proc. 15th Int'l Conf. Pattern Recognition, vol. 2, pp. 724-727, 2000.
[2] D.M.J. Tax and R.P.W. Duin, "Support Vector Domain Description," Pattern Recognition Letters, vol. 20, nos. 11-13, pp. 1191-1199, 1999.
[3] 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.
[4] J. Lee and D. Lee, "Dynamic Characterization of Cluster Structures for Robust and Inductive Support Vector Clustering," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 11, pp. 1869-1874, Nov. 2006.
[5] W. Karush, "Minima of Functions of Several Variables with Inequalities as Side Constraints," MSc dissertation, Dept. of Math., Univ. of Chicago, 1939.
[6] H.W. Kuhn and A.W. Tucker, "Nonlinear Programming," Proc. Second Symp. Math. Statistics and Probability, pp. 481-492, 1951.
[7] K.-H. Jung, D. Lee, and J. Lee, "Fast Support-Based Clustering Method for Large-Scale Problems," Pattern Recognition, vol. 43, no. 5, pp. 1975-1983, 2010.
[8] W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery, Numerical Recipes: The Art of Scientific Computing, third ed. Cambridge Univ. Press, 2007.
[9] A. Mordecai, Nonlinear Programming: Analysis and Methods. Dover Publishing, 2003.
[10] N.X. Vinh, J. Epps, and J. Bailey, "Information Theoretic Measures for Clustering Comparison: Is a Correction for Chance Necessary?" Proc. ACM 26th Ann. Int'l Conf. Machine Learning (ICML '09), pp. 1073-1080, 2009.
[11] P.N. Tan, M. Steinbach, and V. Kumar, Introduction to Data Mining, pp. 487-568, Addison-Wesley, 2006.
[12] H.W. Kuhn and A.W. Tucker, "Nonlinear Programming," Proc. Second Symp. Math. Statistics and Probability, pp. 481-492, 1951.
[13] J.E. Denis and J.J. Moree, "Quasi-Newton Methods, Motivation and Theory," SIAM Rev., vol. 19, no. 1, pp. 46-89, 1977.
[14] D. Tax and R. Duin, "Data Domain Description Using Support Vectors," Proc. European Symp. Artificial Neural Networks, pp. 251-256, 1999.
26 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool