Clustering based large margin classification: A scalable approach using SOCP formulation

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn 2006, Issue , 2006, Pages 674-679

  Nath, J Saketha ^a   Bhattacharyya, C ^a   Murty, M N ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

BIRCH; Gaussian Mixture Models; Large margin classification; Scalability

Indexed keywords

CLUSTERING ALGORITHMS; GAUSSIAN MIXTURE MODELS; LARGE MARGIN CLASSIFICATION; SECOND ORDER CONE PROGRAMMING (SOCP);

ALGORITHMS; BINARY CODES; CHEBYSHEV APPROXIMATION; COMPUTER PROGRAMMING; DISTRIBUTED COMPUTER SYSTEMS; REAL TIME SYSTEMS;

CLASSIFICATION (OF INFORMATION);

EID: 33749566771     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. K. P. Bennett and E. J. Bredensteiner. Duality and geometry in SVM classifiers. In Proceedings of the International Conference on Machine Learning, pages 57-64, 2000.
2. D. Bertsimas and J. Sethuraman. Moment problems and semidefinite optimization. Handbook of Semidefinite optimization, pages 469-509, 2001.
3. C. Bhattacharyya. Second order cone programming formulations for feature selection. Journal of Machine Learning Research, 5:1417-1433, 2004.
4. C. Bhattacharyya, P. K. Shivaswamy, and A. J. Smola. A second order cone programming formulation for classifying missing data. In NIPS, 2004.
5. J. Bi and T. Zhang. Support vector classification with input data uncertainty. In Advances in Neural Information Processing Systems. MIT Press, 2004.
6. C.-C. Chang and C.-J. Lin. LIBSVM: a library for support vector machines, 2001. Software available at http://www.csie.ntu.edu.tw/~ cjlin/libsvm.
7. T. Joachims. Making large-scale SVM learning practical. In Advances in Kernel Methods-Support Vector Learning, pages 169-184, Cambridge, MA, 1999.
8. G. R. Lanckriet, L. E. Ghaoui, C. Bhattacharyya, and M. I. Jordan. A robust minimax approach to classification. Journal of Machine Learning Research, 3:555-582, 2003.
9. M. Lobo, L. Vandenberghe, S. Boyd, and H. Lebret. Applications of second-order cone programming. Linear Algebra and its Applications, 284(1-3): 193-228, 1998.
10. A. W. Marshall and I. Olkin. Multivariate chebychev inequalities. Annals of Mathematical Statistics, 31(4):1001-1014, 1960.
11. J. Mercer. Functions of positive and negative type and their connection with the theory of integral equations. Philosophical Transactions of the Royal Society, London, A 209:415-446, 1909.
12. Y. Nesterov and A. Nemirovskii. Interior Point Algorithms in Convex Programming. Number 13 in Studies in Applied Mathematics. SIAM, 1993.
13. J. Platt. Fast training of support vector machines using sequential minimal optimization. In Advances in Kernel Methods-Support Vector Learning, pages 185-208, Cambridge, MA, 1999.
14. J. Sturm. Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optimization Methods and Software, 11-12:625-653, 1999.
15. V. Vapnik. Statistical Learning Theory. John Wiley and Sons, New York, 1998.
16. H. Yu, J. Yang, and J. Han. Classifying large data sets using svm with hierarchical clusters. In Proceedings of the ACM SIGKDD International Conference, 2003.
17. T. Zhang, R. Ramakrishnan, and M. Livny. Birch: An efficient data clustering method for very large databases. In Proceedings of the ACM SIGMOD International Conference, pages 103-114, 1996.