Linear time maximum margin clustering

IEEE Transactions on Neural Networks

Volumn 21, Issue 2, 2010, Pages 319-332

  Wang, Fei ^a   Zhao, Bin ^a,b   Zhang, Changshui ^a  

^a TSINGHUA UNIVERSITY   (China)

^b Carnegie Mellon University ^*  (United States)

Author keywords

Clustering; Concave convex procedure (CCP); Cutting plane; Maximum margin

Indexed keywords

AVERAGE NUMBERS; CLUSTERING METHODS; COMPUTATIONAL TECHNIQUE; CONCAVE-CONVEX PROCEDURE; CUTTING PLANE ALGORITHMS; CUTTING PLANES; DATA SAMPLE; DATA SETS; EXPERIMENTAL EVALUATION; INTEGER PROGRAMMING PROBLEMS; LARGE SCALE DATA; LINEAR TIME; MAXIMUM MARGIN; MULTI-CLASS; NONCONVEX; NUMBER OF SAMPLES; PROBLEM-BASED; REAL WORLD DATA; REAL-WORLD PROBLEM; SEMI-DEFINITE PROGRAMMING; SUB-PROBLEMS;

COMPUTATIONAL EFFICIENCY; INTEGER PROGRAMMING; METALLIC MATRIX COMPOSITES; SUPPORT VECTOR MACHINES;

CLUSTERING ALGORITHMS;

EID: 76749154466     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNN.2009.2036998     Document Type: Article

References (38)

1. L. T. H. An and P. D. Tao, "DC programming: Theory, algorithms and applications. The state of the art," in Proc. 1st Int. Workshop Global Constrained Optim. Constraint Satisfaction, Valbonne-Sophia Antipolis, France, 2002, pp. 1-28.
2. M. Avriel, Nonlinear Programming: Analysis and Methods. New York: Dover, 2003.
3. B. Borchers, "CSDP: A C library for semidefinite programming," Optim. Methods Softw., vol.11 & 12, pp. 613-623, 1999.
4. P. K. Chan, D. F. Schlag, and J. Y. Zien, "Spectral k-way ratio-cut partitioning and clustering," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol.13, no.9, pp. 1088-1096, Sep. 1994.
5. O. Chapelle and A. Zien, "Semi-supervised classification by low density separation," in Proc. 10th Int.Workshop Artif. Intell. Statist., 2005, pp. 57-64.
6. P. M. Cheung and J. T. Kowk, "A regularization framework for multiple- instance learning," in Proc. 23rd Int. Conf. Mach. Learn., 2006, pp. 193-200.
7. K. Crammer and Y. Singer, "On the algorithmic implementation of multiclass kernel-based vector machines," J. Mach. Learn. Res., vol.2, pp. 265-292, 2001.
8. A. Demiriz, K. P. Bennett, and J. Shawe-Taylor, "Linear programming boosting via column generation," Mach. Learn., vol.46, no.1-3, pp. 225-254, 2002.
9. C. Ding, X. He, H. Zha, M. Gu, and H. D. Simon, "A min-max cut algorithm for graph partitioning and data mining," in Proc. 1st Int. Conf. Data Mining, 2001, pp. 107-114.
10. R. E. Gomory, "Outline of an algorithm for integer solutions to linear programs," Bull. Amer. Math. Soc., vol.64, pp. 275-278, 1958.
11. J. Han and M. Kamber, Data Mining. San Mateo, CA: Morgan Kaufmann, 2001.
12. J. Hartigan and M. Wong, "A k-means clustering algorithm," Appl. Statist., vol.28, pp. 100-108, 1979.
13. A. Jain and R. Dubes, Algorithms for Clustering Data. Englewood Cliffs, NJ: Prentice-Hall, 1988.
14. T. Joachims, "A support vector method for multivariate performance measures," in Proc. Int. Conf. Mach. Learn., 2005, pp. 377-384.
15. T. Joachims, "Training linear SVMs in linear time," in Proc. ACM SIGKDD Int. Conf. Knowl. Disc. Data Mining, 2006, pp. 217-226.
16. T. Joachims, T. Finley, and C.-N. Yu, "Cutting-plane training of structural SVMs," Mach. Learn., vol.77, no.1, pp. 27-59, 2009.
17. M. I. Jordan, Z. Ghahramani, T. S. Jaakkola, and L. K. Saul, "An introduction to variational methods for graphical models," Mach. Learn., vol.37, pp. 183-233, 1999.
18. J. E. Kelley, "The cutting-plane method for solving convex programs," J. Soc. Ind. Appl. Math., vol.8, pp. 703-712, 1960.
19. K. Lange, D. R. Hunter, and I. Yang, "Optimization transfer using surrogate objective functions," J. Comput. Graph. Statist., vol.9, pp. 1-59, 2000.
20. D. D. Lewis, Y. Yang, T. Rose, and F. Li, "RCV1: A new benchmark collection for text categorization research," J. Mach. Learn. Res., vol.5, pp. 361-397, 2004.
21. S. P. Luttrell, "Partitioned mixture distributions: An adaptive Bayesian network for low-level image processing," Inst. Electr. Eng. Proc.-Vis. Image Signal Process., vol.141, pp. 251-260, 1994.
22. A. McCallum, K. Nigam, J. Rennie, and K. Seymore, "Automating the construction of internet portals with machine learning," Inf. Retrieval J., vol.3, pp. 127-163, 2000.
23. L. G. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization. New York: Wiley, 1988.
24. A. Ng, M. Jordan, and Y. Weiss, "On spectral clustering: Analysis and an algorithm," in Advances in Neural Information Processing Systems. Cambridge, MA: MIT Press, 2001.
25. J. Nocedal and S. J. Wright, Numerical Optimization, 2nd ed. Berlin, Germany: Springer-Verlag, 2006.
26. W. M. Rand, "Objective criteria for the evaluation of clustering methods," J. Amer. Statist. Assoc., vol.66, pp. 846-850, 1971.
27. R. A. Redner and H. F. Walker, "Mixture densities, maximum likelihood and the em algorithm," SIAM Rev., vol.26, pp. 195-239, 1984.
28. B. Schölkopf and A. Smola, LearningWithKernels. Cambridge, MA: MIT Press, 2002.
29. B. Schölkopf, A. J. Smola, and K. R. Müller, "Kernel principal component analysis," in Advances in Kernel Methods: Support Vector Learning. Cambridge, MA: MIT Press, 1999, pp. 327-352.
30. J. Shi and J. Malik, "Normalized cuts and image segmentation," IEEE Trans. Pattern Anal. Mach. Intell., vol.22, no.8, pp. 888-905, Aug. 2000.
31. A. J. Smola, S. V. N. Vishwanathan, and T. Hofmann, "Kernel methods for missing variables," in Proc. 10th Int.Workshop Artif. Intell. Statist., 2005, pp. 325-332.
32. J. F. Sturm, "Sedumi 1.02, aMatlab toolbox for optimization over symmetric cones," Optim. Methods Softw., vol.11&12, pp. 625-653, 1999.
33. I. Tsochantaridis, T. Joachims, T. Hofmann, and Y. Altun, "Large margin methods for structured and interdependent output variables," J. Mach. Learn. Res., vol.6, pp. 1453-1484, 2005.
34. H. Valizadegan and R. Jin, "Generalized maximum margin clustering and unsupervised kernel learning," in Advances in Neural Information Processing Systems. Cambridge, MA: MIT Press, 2007, vol.19, pp. 1417-1424.
35. L. Xu, J. Neufeld, B. Larson, and D. Schuurmans, "Maximum margin clustering," in Advances in Neural Information Processing Systems. Cambridge, MA: MIT Press, 2004.
36. L. Xu and D. Schuurmans, "Unsupervised and semi-supervised multiclass support vector machines," in Proc. 20th Nat. Conf. Artif. Intell., 2005, pp. 904-910.
37. A. Yuille and A. Rangarajan, "The concave-convex procedure," Neural Comput., vol.15, pp. 915-936, 2003.
38. K. Zhang, I. W. Tsang, and J. T. Kowk, "Maximum margin clustering made practical," in Proc. 24th Int. Conf. Mach. Learn., 2007, pp. 1119-1126.