메뉴 건너뛰기




Volumn 25, Issue 6, 2003, Pages 779-783

Feature selection for multiclass discrimination via mixed-integer linear programming

Author keywords

Branch and bound; Classification; Discrimination; Feature selection; Mixed integer linear programming

Indexed keywords

LINEAR PROGRAMMING; OPTIMIZATION; VECTORS;

EID: 0037705517     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2003.1201827     Document Type: Article
Times cited : (38)

References (18)
  • 3
    • 0013326060 scopus 로고    scopus 로고
    • Feature selection for classification
    • M. Dash and H. Liu, "Feature Selection for Classification," Intelligent Data Analysis, vol. 1 pp. 131-156, 1997.
    • (1997) Intelligent Data Analysis , vol.1 , pp. 131-156
    • Dash, M.1    Liu, H.2
  • 4
    • 0033640901 scopus 로고    scopus 로고
    • Comparison of algorithms that select features for pattern classifiers
    • M. Kudo and J. Sklansky, "Comparison of Algorithms That Select Features for Pattern Classifiers," Pattern Recognition, vol. 33, pp. 25-41, 2000.
    • (2000) Pattern Recognition , vol.33 , pp. 25-41
    • Kudo, M.1    Sklansky, J.2
  • 5
    • 0031078007 scopus 로고    scopus 로고
    • Feature selection: Evaluation, application, and small sample performance
    • Feb.
    • A. Jain and D. Zongker, "Feature Selection: Evaluation, Application, and Small Sample Performance," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 2, pp. 153-158, Feb. 1997.
    • (1997) IEEE Trans. Pattern Analysis and Machine Intelligence , vol.19 , Issue.2 , pp. 153-158
    • Jain, A.1    Zongker, D.2
  • 6
    • 0035281381 scopus 로고    scopus 로고
    • Classification accuracy in discriminant analysis: A mixed integer programming approach
    • J. Glen, "Classification Accuracy in Discriminant Analysis: A Mixed Integer Programming Approach," J. Operational Research Soc., vol. 52, pp. 328-339, 2001.
    • (2001) J. Operational Research Soc. , vol.52 , pp. 328-339
    • Glen, J.1
  • 8
    • 0017368046 scopus 로고
    • On the possible orderings in the measurement selection problem
    • T.M. Cover and J.M.V. Campenhout, "On the Possible Orderings in the Measurement Selection Problem," IEEE Trans. Systems, Man, and Cybernetics, vol. 7, no. 9, pp. 657-661, 1977.
    • (1977) IEEE Trans. Systems, Man, and Cybernetics , vol.7 , Issue.9 , pp. 657-661
    • Cover, T.M.1    Campenhout, J.M.V.2
  • 9
    • 0017535866 scopus 로고
    • A branch and bound algorithm for feature subset selection
    • Sept.
    • P. Narendra and K. Fukunaga "A Branch and Bound Algorithm for Feature Subset Selection," IEEE Trans. Computers, vol. 26, no. 9, pp. 917-922, Sept. 1977.
    • (1977) IEEE Trans. Computers , vol.26 , Issue.9 , pp. 917-922
    • Narendra, P.1    Fukunaga, K.2
  • 12
    • 0034651854 scopus 로고    scopus 로고
    • A technique for feature selection in multiclass problems
    • L. Bruzzone and S.B. Serpico, "A Technique for Feature Selection in Multiclass Problems," Int'l J. Remote Sensing, vol. 21, no. 3, pp. 549-563, 2000.
    • (2000) Int'l J. Remote Sensing , vol.21 , Issue.3 , pp. 549-563
    • Bruzzone, L.1    Serpico, S.B.2
  • 13
    • 0004180332 scopus 로고    scopus 로고
    • New York: John Wiley and Sons, Inc.
    • L.A. Wolsey, Integer Programming. New York: John Wiley and Sons, Inc., 1998.
    • (1998) Integer Programming
    • Wolsey, L.A.1
  • 15
    • 0037980574 scopus 로고    scopus 로고
    • Branch-and-bound methods for integer programming
    • Kluwer Academic Publishers
    • J. Mitchell and E. Lee, "Branch-and-Bound Methods for Integer Programming," Encyclopedia of Optimization, Kluwer Academic Publishers, 2001.
    • (2001) Encyclopedia of Optimization
    • Mitchell, J.1    Lee, E.2
  • 16
    • 0001332760 scopus 로고    scopus 로고
    • A computational study of branch and bound search strategies for mixed integer programming
    • J.T. Linderoth and M.W.P. Savelsbergh, "A Computational Study of Branch and Bound Search Strategies for Mixed Integer Programming," INFORMS J. Computing, vol. 11, pp. 173-187, 1999.
    • (1999) INFORMS J. Computing , vol.11 , pp. 173-187
    • Linderoth, J.T.1    Savelsbergh, M.W.P.2


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