메뉴 건너뛰기




Volumn 33, Issue 5, 2011, Pages 1037-1050

Max-min distance analysis by using sequential SDP relaxation for dimension reduction

Author keywords

convex relaxation; data visualization; dimension reduction; Fisher's linear discriminant analysis; pattern classification

Indexed keywords

CONVEX RELAXATION; DATA DISTRIBUTION; DATA SETS; DIMENSION REDUCTION; FISHER'S LINEAR DISCRIMINANT ANALYSIS; GAUSSIANS; LOW-DIMENSIONAL SUBSPACE; MAX-MIN; MAX-MIN DISTANCE; NON-SMOOTH; OPTIMIZATION ALGORITHMS; OPTIMIZATION PROBLEMS; ORTHONORMAL; PAIRWISE DISTANCES; PATTERN CLASSIFICATION; REAL DATA SETS; SDP RELAXATION; SYNTHETIC DATA; VISUALIZATION EXPERIMENT;

EID: 79953054794     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2010.189     Document Type: Article
Times cited : (158)

References (50)
  • 3
    • 21244494853 scopus 로고    scopus 로고
    • A two-stage linear discriminant analysis via QR-decomposition
    • DOI 10.1109/TPAMI.2005.110
    • J. Ye and Q. Li, "A Two-Stage Linear Discriminant Analysis via QR-Decomposition," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 6, pp. 929-941, June 2005. (Pubitemid 40889843)
    • (2005) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.27 , Issue.6 , pp. 929-941
    • Ye, J.1    Li, Q.2
  • 4
    • 10244252786 scopus 로고    scopus 로고
    • Systematic benchmarking of microarray data classification: Assessing the role of non-linearity and dimensionality reduction
    • DOI 10.1093/bioinformatics/bth383
    • N. Pochet, F. De Smet, J.A.K. Suykens, and B.L.R. De Moor, "Systematic Benchmarking of Microarray Data Classification: Assessing the Role of Non-Linearity and Dimensionality Reduction," Bioinformatics, vol. 20, no. 17, pp. 3185-3195, 2004. (Pubitemid 39619208)
    • (2004) Bioinformatics , vol.20 , Issue.17 , pp. 3185-3195
    • Pochet, N.1    De Smet, F.2    Suykens, J.A.K.3    De Moor, B.L.R.4
  • 5
    • 3242767684 scopus 로고    scopus 로고
    • An optimization criterion for generalized discriminant analysis on under-sampled problems
    • Aug.
    • J. Ye, R. Janardan, C.H. Park, and H. Park, "An Optimization Criterion for Generalized Discriminant Analysis on Under-sampled Problems," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 8, pp. 982-994, Aug. 2004.
    • (2004) IEEE Trans. Pattern Analysis and Machine Intelligence , vol.26 , Issue.8 , pp. 982-994
    • Ye, J.1    Janardan, R.2    Park, C.H.3    Park, H.4
  • 6
    • 76849099506 scopus 로고    scopus 로고
    • Biased discriminant euclidean embedding for content-based image retrieval
    • Feb.
    • W. Bian and D. Tao, "Biased Discriminant Euclidean Embedding for Content-Based Image Retrieval," IEEE Trans. Image Processing, vol. 19, no. 2, pp. 545-554, Feb. 2010.
    • (2010) IEEE Trans. Image Processing , vol.19 , Issue.2 , pp. 545-554
    • Bian, W.1    Tao, D.2
  • 7
    • 72949123287 scopus 로고    scopus 로고
    • Biologically inspired feature manifold for scene classification
    • Jan
    • D. Song and D. Tao, "Biologically Inspired Feature Manifold for Scene Classification," IEEE Trans. Image Processing, vol. 19, no. 1, pp. 174-184, Jan. 2010.
    • (2010) IEEE Trans. Image Processing , vol.19 , Issue.1 , pp. 174-184
    • Song, D.1    Tao, D.2
  • 8
    • 77249167266 scopus 로고    scopus 로고
    • Active reranking for web image search
    • Mar.
    • X. Tian, D. Tao, X.-S. Hua, and X. Wu, "Active Reranking for Web Image Search," IEEE Trans. Image Processing, vol. 19, no. 3, pp. 805-820, Mar. 2010.
    • (2010) IEEE Trans. Image Processing , vol.19 , Issue.3 , pp. 805-820
    • Tian, X.1    Tao, D.2    Hua, X.-S.3    Wu, X.4
  • 9
    • 37549070399 scopus 로고    scopus 로고
    • Learning a maximum margin subspace for image retrieval
    • Feb.
    • X. He, D. Cai, and J. Han, "Learning a Maximum Margin Subspace for Image Retrieval," IEEE Trans. Knowledge and Data Eng., vol. 20, no. 2, pp. 189-201, Feb. 2008.
    • (2008) IEEE Trans. Knowledge and Data Eng. , vol.20 , Issue.2 , pp. 189-201
    • He, X.1    Cai, D.2    Han, J.3
  • 11
    • 84980104458 scopus 로고
    • Financial ratios, discriminant analysis and the prediction of corporate bankruptcy
    • E.I. Altman, "Financial Ratios, Discriminant Analysis and the Prediction of Corporate Bankruptcy," The J. Finance, vol. 23, no. 4, pp. 589-609, 1968.
    • (1968) The J. Finance , vol.23 , Issue.4 , pp. 589-609
    • Altman, E.I.1
  • 12
    • 84992933570 scopus 로고    scopus 로고
    • Artificial neural network vs linear discriminant analysis in credit ratings forecast: A comparative study of prediction performances
    • Aug.
    • K. Kumar and S. Bhattacharya, "Artificial Neural Network vs Linear Discriminant Analysis in Credit Ratings Forecast: A Comparative Study of Prediction Performances," Rev. of Accounting and Finance, vol. 5, no. 3, pp. 216-227, Aug. 2006.
    • (2006) Rev. of Accounting and Finance , vol.5 , Issue.3 , pp. 216-227
    • Kumar, K.1    Bhattacharya, S.2
  • 13
    • 0000764772 scopus 로고
    • The use of multiple measurements in taxonomic problems
    • R.A. Fisher, "The Use of Multiple Measurements in Taxonomic Problems," Annals of Eugenics, vol. 7, pp. 179-188, 1936.
    • (1936) Annals of Eugenics , vol.7 , pp. 179-188
    • Fisher, R.A.1
  • 14
    • 0001565436 scopus 로고
    • The utilization of multiple measurements in problems of biological classification
    • C.R. Rao, "The Utilization of Multiple Measurements in Problems of Biological Classification," J. Royal Statistical Soc. Series B: Methodological, vol. 10, pp. 159-203, 1948.
    • (1948) J. Royal Statistical Soc. Series B: Methodological , vol.10 , pp. 159-203
    • Rao, C.R.1
  • 20
    • 3042673775 scopus 로고    scopus 로고
    • Linear dimensionality reduction via a heteroscedastic extension of LDA: The chernoff criterion
    • June
    • M. Loog and R.P.W. Duin, "Linear Dimensionality Reduction via a Heteroscedastic Extension of LDA: The Chernoff Criterion," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 6, pp. 732-739, June 2004.
    • (2004) IEEE Trans. Pattern Analysis and Machine Intelligence , vol.26 , Issue.6 , pp. 732-739
    • Loog, M.1    Duin, R.P.W.2
  • 22
    • 39549094937 scopus 로고    scopus 로고
    • Pruning noisy bases in discriminant analysis
    • DOI 10.1109/TNN.2007.904040
    • M. Zhu and A.M. Mart́inez, "Pruning Noisy Bases in Discriminant Analysis," IEEE Trans. Neural Networks, vol. 19, no. 1, pp. 148-157, Jan. 2008. (Pubitemid 351279233)
    • (2008) IEEE Transactions on Neural Networks , vol.19 , Issue.1 , pp. 148-157
    • Zhu, M.1    Martinez, A.M.2
  • 23
    • 77649336466 scopus 로고    scopus 로고
    • A new ranking method for principal components analysis and its application to face image analysis
    • C.E. Thomaz and G.A. Giraldi, "A New Ranking Method for Principal Components Analysis and Its Application to Face Image Analysis," Image and Vision Computing, vol. 28, no. 6, pp. 902-913, 2010.
    • (2010) Image and Vision Computing , vol.28 , Issue.6 , pp. 902-913
    • Thomaz, C.E.1    Giraldi, G.A.2
  • 24
    • 68549120964 scopus 로고    scopus 로고
    • Patch alignment for dimensionality reduction
    • Sept.
    • T. Zhang, D. Tao, X. Li, and J. Yang, "Patch Alignment for Dimensionality Reduction," IEEE Trans. Knowledge and Data Eng., vol. 21, no. 9, pp. 1299-1313, Sept. 2009.
    • (2009) IEEE Trans. Knowledge and Data Eng. , vol.21 , Issue.9 , pp. 1299-1313
    • Zhang, T.1    Tao, D.2    Li, X.3    Yang, J.4
  • 28
    • 42449101064 scopus 로고
    • Linear discrimination for three known normal populations
    • M. Schervish, "Linear Discrimination for Three Known Normal Populations," J. Statistical Planning and Inference, vol. 10, pp. 167-175, 1984.
    • (1984) J. Statistical Planning and Inference , vol.10 , pp. 167-175
    • Schervish, M.1
  • 29
    • 3042673775 scopus 로고    scopus 로고
    • Linear dimensionality reduction via a heteroscedastic extension of LDA: The chernoff criterion
    • June
    • M. Loog and R.P.W. Duin, "Linear Dimensionality Reduction via a Heteroscedastic Extension of LDA: The Chernoff Criterion," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 6, pp. 732-739, June 2004.
    • (2004) IEEE Trans. Pattern Analysis and Machine Intelligence , vol.26 , Issue.6 , pp. 732-739
    • Loog, M.1    Duin, R.P.W.2
  • 31
    • 0001576029 scopus 로고    scopus 로고
    • Characterizing virtual eigen-signatures for general purpose face recognition
    • H. Wechsler, P.J. Phillips, V. Bruce, F. Fogelman-Soulie, and T.S. Huang, eds.
    • D.B. Graham and N.M. Allinson, "Characterizing Virtual Eigen-signatures for General Purpose Face Recognition," Face Recognition: From Theory to Applications, H. Wechsler, P.J. Phillips, V. Bruce, F. Fogelman-Soulie, and T.S. Huang, eds., pp. 446-456, 1998.
    • (1998) Face Recognition: From Theory to Applications , pp. 446-456
    • Graham, D.B.1    Allinson, N.M.2
  • 33
    • 0003875234 scopus 로고    scopus 로고
    • The CMU pose, illumination, and expression (PIE) database of human faces
    • Robotics Inst., Carnegie Mellon Univ. Jan.
    • T. Sim, S. Baker, and M. Bsat, "The CMU Pose, Illumination, and Expression (PIE) Database of Human Faces," Technical Report CMU-RI-TR-01-02, Robotics Inst., Carnegie Mellon Univ., Jan. 2001.
    • (2001) Technical Report CMU-RI-TR-01-02
    • Sim, T.1    Baker, S.2    Bsat, M.3
  • 34
    • 0347243182 scopus 로고    scopus 로고
    • Nonlinear component analysis as a kernel eigenvalue problem
    • B. Schölkopf, A. Smola, and K.-R. Mü ller, "Nonlinear Component Analysis as a Kernel Eigenvalue Problem," Neural Computation, vol. 10, no. 5, pp. 1299-1319, 1998.
    • (1998) Neural Computation , vol.10 , Issue.5 , pp. 1299-1319
    • Schölkopf, B.1    Smola, A.2    Mü Ller, K.-R.3
  • 37
    • 34548514458 scopus 로고    scopus 로고
    • A direct formulation of sparse PCA using semidefinite programming
    • A. d'Aspremont, L. El Ghaoui, M. Jordan, and G. Lanckriet, "A Direct Formulation of Sparse PCA Using Semidefinite Programming," SIAM Rev., vol. 49, no. 3, pp. 434-438, 2007.
    • (2007) SIAM Rev. , vol.49 , Issue.3 , pp. 434-438
    • D'Aspremont, A.1    El Ghaoui, L.2    Jordan, M.3    Lanckriet, G.4
  • 38
    • 0039907084 scopus 로고
    • On the sum of the largest eigenvalues of a symmetric matrix
    • M.L. Overton and R.S. Womersley, "On the Sum of the Largest Eigenvalues of a Symmetric Matrix," SIAM J. Matrix Analysis and Applications, vol. 13, no. 1, pp. 41-45, 1992.
    • (1992) SIAM J. Matrix Analysis and Applications , vol.13 , Issue.1 , pp. 41-45
    • Overton, M.L.1    Womersley, R.S.2
  • 39
    • 14244255412 scopus 로고    scopus 로고
    • SDPA-M (Semidefinite Programming Algorithm in Matlab) user's manual-version 6.2.0
    • Dept. of Math. and Computing Sciences, Tokyo Inst. of Technology
    • K. Fujisawa, Y. Futakata, M. Kojima, S. Matsuyama, S. Nakamura, K. Nakata, and M. Yamashita, "SDPA-M (Semidefinite Programming Algorithm in Matlab) User's Manual-Version 6.2.0," Technical Report B-359, Dept. of Math. and Computing Sciences, Tokyo Inst. of Technology, 2000.
    • (2000) Technical Report B-359
    • Fujisawa, K.1    Futakata, Y.2    Kojima, M.3    Matsuyama, S.4    Nakamura, S.5    Nakata, K.6    Yamashita, M.7
  • 40
    • 36849072045 scopus 로고    scopus 로고
    • Graph implementations for nonsmooth convex programs
    • V. Blondel, S. Boyd, and H. Kimura, eds. Springer
    • M. Grant and S. Boyd, "Graph Implementations for Nonsmooth Convex Programs," Recent Advances in Learning and Control (A Tribute to M. Vidyasagar), V. Blondel, S. Boyd, and H. Kimura, eds., pp. 95-110, Springer, 2008.
    • (2008) Recent Advances in Learning and Control (A Tribute to M. Vidyasagar) , pp. 95-110
    • Grant, M.1    Boyd, S.2
  • 42
    • 0142215333 scopus 로고    scopus 로고
    • Log-det heuristic for matrix rank minimization with applications to hankel and euclidean distance matrices
    • M. Fazel, H. Hindi, and S.P. Boyd, "Log-Det Heuristic for Matrix Rank Minimization with Applications to Hankel and Euclidean Distance Matrices," Proc. Am. Control Conf., pp. 2156-2162, 2003.
    • (2003) Proc. Am. Control Conf. , pp. 2156-2162
    • Fazel, M.1    Hindi, H.2    Boyd, S.P.3
  • 50
    • 28344445092 scopus 로고    scopus 로고
    • An ensemble-based method for linear feature extraction for two-class problems
    • DOI 10.1007/s10044-005-0002-x
    • D. Masip, L.I. Kuncheva, and J. Vitria, "An Ensemble-Based Method for Linear Feature Extraction for Two-Class Problems," Pattern Analysis and Applications, vol. 8, no. 3, pp. 227-237, 2005. (Pubitemid 41720535)
    • (2005) Pattern Analysis and Applications , vol.8 , Issue.3 , pp. 227-237
    • Masip, D.1    Kuncheva, L.I.2    Vitria, J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.