메뉴 건너뛰기




Volumn 28, Issue 12, 2007, Pages 1415-1427

Adaptive branch and bound algorithm for selecting optimal features

Author keywords

Branch and bound algorithm; Dimensionality reduction; Feature selection; Optimal subset search

Indexed keywords

ADAPTIVE ALGORITHMS; DATA ACQUISITION; INFORMATION ANALYSIS; REDUNDANT MANIPULATORS;

EID: 34250815597     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2007.02.015     Document Type: Article
Times cited : (57)

References (13)
  • 1
    • 0345375601 scopus 로고    scopus 로고
    • Waveband selection for hyperspectral data: Optimal feature selection
    • Casasent D., and Chen X.-W. Waveband selection for hyperspectral data: Optimal feature selection. Proc. SPIE 5106 (2003) 259-270
    • (2003) Proc. SPIE , vol.5106 , pp. 259-270
    • Casasent, D.1    Chen, X.-W.2
  • 2
    • 0038329332 scopus 로고    scopus 로고
    • An improved branch and bound algorithm for feature selection
    • Chen X.-W. An improved branch and bound algorithm for feature selection. Pattern Recognition Lett. 24 (2003) 1925-1933
    • (2003) Pattern Recognition Lett. , vol.24 , pp. 1925-1933
    • Chen, X.-W.1
  • 3
    • 85013515810 scopus 로고    scopus 로고
    • Ferri, F.J., Pudil, P., Hatef, M., Kittler, J., 1994. Comparative study of techniques for large-scale feature selection. In: Gelsema, E., Kanal, L., (Eds.), Pattern Recognition in Practice IV, pp. 403-413.
  • 5
    • 0031078007 scopus 로고    scopus 로고
    • Feature selection: Evaluation, application, and small sample performance
    • Jain A., and Zongker D. Feature selection: Evaluation, application, and small sample performance. IEEE Trans. Pattern Anal. Machine Intell. 19 2 (1997) 153-158
    • (1997) IEEE Trans. Pattern Anal. Machine Intell. , vol.19 , Issue.2 , pp. 153-158
    • Jain, A.1    Zongker, D.2
  • 6
    • 0033640901 scopus 로고    scopus 로고
    • Comparision of algorithms that select features for pattern classifiers
    • Kudo M., and Sklansky J. Comparision of algorithms that select features for pattern classifiers. Pattern Recognition 33 (2000) 25-41
    • (2000) Pattern Recognition , vol.33 , pp. 25-41
    • Kudo, M.1    Sklansky, J.2
  • 7
    • 84914813506 scopus 로고
    • On the effectiveness of receptors in recognition system
    • Marill T., and Green D.M. On the effectiveness of receptors in recognition system. IEEE Trans. Inform. Theory 9 (1963) 917-922
    • (1963) IEEE Trans. Inform. Theory , vol.9 , pp. 917-922
    • Marill, T.1    Green, D.M.2
  • 8
    • 0017535866 scopus 로고
    • A branch and bound algorithm for feature subset selection
    • Narendra P., and Fukunaga K. A branch and bound algorithm for feature subset selection. IEEE Trans. Comput. C-26 (1977) 917-922
    • (1977) IEEE Trans. Comput. , vol.C-26 , pp. 917-922
    • Narendra, P.1    Fukunaga, K.2
  • 9
    • 34250794118 scopus 로고    scopus 로고
    • Newman, D.J., Hettich, S., Blake, C.L., Merz, C.J., 1998. UCI Repository of machine learning databases . Dept. of Information and Computer Science, Univ. of California, Irvine, CA.
  • 12
    • 0015125457 scopus 로고
    • A direct method of nonparametric measurement selection
    • Whitney A.W. A direct method of nonparametric measurement selection. IEEE Trans. Comput. 20 (1971) 1100-1103
    • (1971) IEEE Trans. Comput. , vol.20 , pp. 1100-1103
    • Whitney, A.W.1
  • 13
    • 0027610652 scopus 로고
    • A more efficient branch and bound algorithm for feature selection
    • Yu B., and Yuan B. A more efficient branch and bound algorithm for feature selection. Pattern Recognition 26 (1993) 883-889
    • (1993) Pattern Recognition , vol.26 , pp. 883-889
    • Yu, B.1    Yuan, B.2


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