Unsupervised large margin discriminative projection

IEEE Transactions on Neural Networks

Volumn 22, Issue 9, 2011, Pages 1446-1456

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

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Carnegie Mellon University ^*  (United States)

^c TSINGHUA UNIVERSITY   (China)

Author keywords

Column generation algorithm; maximum margin clustering; maximum margin projections

Indexed keywords

COLUMN GENERATION; COMPUTATION TIME; DATA POINTS; DATA SET SIZE; DIMENSIONALITY REDUCTION METHOD; INPUT PATTERNS; INTEGER PROGRAMMING PROBLEMS; MAXIMUM MARGIN; OPTIMAL DECISION BOUNDARY; PROJECT DATA; REAL-WORLD DATASETS; SEPARATING HYPERPLANE; THEORETICAL RESULT;

INTEGER PROGRAMMING;

CLUSTERING ALGORITHMS;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; ARTIFICIAL NEURAL NETWORK; AUTOMATED PATTERN RECOGNITION; HUMAN; METHODOLOGY;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; HUMANS; NEURAL NETWORKS (COMPUTER); PATTERN RECOGNITION, AUTOMATED;

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

References (40)

1. I. T. Jolliffe, Principal Component Analysis. New York: Springer-Verlag, 1986.
2. J. A. K. Suykens, "Data visualization and dimensionality reduction using kernel maps with a reference point", IEEE Trans. Neural Netw., vol. 19, no. 9, pp. 1501-1517, Sep. 2008.
3. J. B. Tenenbaum, V. de Silva, and J. C. Langford, "A global geometric framework for nonlinear dimensionality reduction", Science, vol. 290, no. 5500, pp. 2319-2323, Dec. 2000.
4. S. T. Roweis and L. K. Saul, "Nonlinear dimensionality reduction by locally linear embedding", Science, vol. 290, no. 5500, pp. 2323-2326, Dec. 2000.
5. Y. Hou, P. Zhang, X. Xu, X. Zhang, and W. Li, "Nonlinear dimensionality reduction by locally linear inlaying", IEEE Trans. Neural Netw., vol. 20, no. 2, pp. 300-315, Feb. 2009.
6. M. Belkin and P. Niyogi, "Laplacian eigenmaps for dimensionality reduction and data representation", Neural Comput., vol. 15, no. 6, pp. 1373-1396, Jun. 2003.
7. Z. Y. Zhang and H. Y. Zha, "Principal manifolds and nonlinear dimensionality reduction via tangent space alignment", SIAM J. Sci. Comput., vol. 26, no. 1, pp. 313-338, 2004.
8. M. Brand, "Charting a manifold", in Advances in Neural Information Processing Systems 15. Cambridge, MA: MIT Press, 2003, pp. 961-968.
9. F. Sha and L. K. Saul, "Analysis and extension of spectral methods for nonlinear dimensionality reduction", in Proc. 22nd Int. Conf. Mach. Learn., 2005, pp. 784-791.
10. K. Q. Weinberger, F. Sha, and L. K. Saul, "Learning a kernel matrix for nonlinear dimensionality reduction", in Proc. 21st Int. Conf. Mach. Learn., 2004, pp. 839-846.
11. K. Fukunaga, Introduction to Statistical Pattern Recognition, 2nd ed. New York: Academic, 1990.
12. J. H. Friedman, "Regularized discriminant analysis", J. Amer. Stat. Assoc., vol. 84, no. 405, pp. 165-175, Mar. 1989.
13. T. Hastie, A. Buja, and R. Tibshirani, "Penalized discriminant analysis", Ann. Stat., vol. 23, no. 1, pp. 73-102, 1995.
14. S. Ji and J. Ye, "Generalized linear discriminant analysis: A unified framework and efficient model selection", IEEE Trans. Neural Netw., vol. 19, no. 10, pp. 1768-1782, Oct. 2008.
15. H. Li, T. Jiang, and K. Zhang, "Efficient and robust feature extraction by maximum margin criterion", IEEE Trans. Neural Netw., vol. 17, no. 1, pp. 157-165, Jan. 2006.
16. A. Kocsor, K. Kovács, and C. Szepesvári, "Margin maximizing discriminant analysis", in Proc. 15th Eur. Conf. Mach. Learn., 2004, pp. 227-238.
17. I. W. Tsang, A. Kocsor, and J. T. Kwok, "Large-scale maximum margin discriminant analysis using core vector machines", IEEE Trans. Neural Netw., vol. 19, no. 4, pp. 610-624, Apr. 2008.
18. A. Zien and J. Q. Candela, "Large margin non-linear embedding", in Proc. 22nd Int. Conf. Mach. Learn., 2005, pp. 1065-1072.
19. V. N. Vapnik, The Nature of Statistical Learning Theory. New York: Springer-Verlag, 1995.
20. R. O. Duda, P. E. Hart, and D. G. Stork, Pattern Classification, 2nd ed. New York: Wiley, 2001.
21. 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, Sep. 2005.
22. T. Joachims, "A support vector method for multivariate performance measures", in Proc. 22nd Int. Conf. Mach. Learn., 2005, pp. 377-384.
23. T. Joachims, "Training linear SVMs in linear time", in Proc. 12th ACM SIGKDD Int. Conf. Knowl. Disc. Data Min., 2006, pp. 217-226.
24. B. Zhao, F. Wang, and C. Zhang, "Efficient maximum margin clustering via cutting plane algorithm", in Proc. 8th SIAM Int. Conf. Data Min., 2008, pp. 751-762.
25. F. Wang, B. Zhao, and C. Zhang, "Linear time maximum margin clustering", IEEE Trans. Neural Netw., vol. 21, no. 2, pp. 319-332, Feb. 2010.
26. L. Xu, J. Neufeld, B. Larson, and D. Schuurmans, "Maximum margin clustering", in Proc. Adv. Neural Inf. Process. Syst. 17, 2004, pp. 1537-1544.
27. K. Zhang, I. W. Tsang, and J. T. Kwok, "Maximum margin clustering made practical", IEEE Trans. Neural Netw., vol. 20, no. 4, pp. 583-596, Apr. 2009.
28. B. Schölkopf and A. Smola, Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. Cambridge, MA: MIT Press, 2001.
29. B. Schölkopf, A. J. Smola, and K. R. Müller, "Kernel principal component analysis", in Proc. Adv. Kernel Methods: Support Vector Learn., 1999, pp. 327-352.
30. O. Chapelle and A. Zien, "Semi-supervised classification by low density separation", in Proc. 10th Workshop Artif. Intell. Stat., 2005, pp. 57-64.
31. C. Alzate and J. A. K. Suykens, "Multiway spectral clustering with out-of-sample extensions through weighted kernel PCA", IEEE Trans. Pattern Anal. Mach. Intell., vol. 32, no. 2, pp. 335-347, Feb. 2010.
32. F. Wang, J. Wang, C. Zhang, and J. T. Kwok, "Face recognition using spectral features", Pattern Recognit., vol. 40, no. 10, pp. 2786-2797, Oct. 2007.
33. A. J. Smola, S. Vishwanathan, and T. Hofmann, "Kernel methods for missing variables", in Proc. 10th Int. Workshop Artif. Intell. Stat., 2005, pp. 325-332.
34. P. M. Cheung and J. T. Kowk, "A regularization framework for multipleinstance learning", in Proc. 23rd Int. Conf. Mach. Learn., 2006, pp. 193-200.
35. T. Joachims, "Training linear SVMs in linear time", in Proc. ACM SIGKDD Int. Conf. Knowl. Disc. Data Min., 2006, pp. 217-226.
36. A. Demiriz, K. P. Bennett, and J. Shawe-Taylor, "Linear programming boosting via column generation", Mach. Learn., vol. 46, nos. 1-3, pp. 225-254, 2002.
37. J. E. Kelley, "The cutting-plane method for solving convex programs", J. Soc. Ind. Appl. Math., vol. 8, no. 4, pp. 703-712, Dec. 1960.
38. J. Ye, Z. Zhao, and M. Wu, "Discriminative k-means for clustering", in Proc. Adv. Neural Inf. Process. Syst. 20, 2007, pp. 1649-1656.
39. M. Belkin, P. Niyogi, and V. Sindhwani, "Manifold regularization: A geometric framework for learning from labeled and unlabeled examples", J. Mach. Learn. Res., vol. 7, pp. 2399-2434, Nov. 2006.
40. F. Wang, T. Li, and C. Zhang, "Semi-supervised clustering via matrix factorization", in Proc. 8th SIAM Conf. Data Min., 2008, pp. 1-12.