메뉴 건너뛰기




Volumn 36, Issue 10, 2009, Pages 12392-12398

A dependency-based search strategy for feature selection

Author keywords

Dependency; Feature selection; Mutual information; Search strategy

Indexed keywords

DEPENDENCY; FEATURE SELECTION; FEATURE SETS; FEATURE SPACE; FEATURE SUBSET; MUTUAL INFORMATION; SEARCH SPACES; SEARCH STRATEGIES; SEARCH STRATEGY;

EID: 69249211006     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2009.04.057     Document Type: Article
Times cited : (11)

References (18)
  • 3
    • 0032641874 scopus 로고    scopus 로고
    • Estimation of the mutual information by an adaptive partitioning of the observation space
    • Darbellay G.A., and Vajda I. Estimation of the mutual information by an adaptive partitioning of the observation space. IEEE Transactions on Information Theory 45 (1999) 1315-1321
    • (1999) IEEE Transactions on Information Theory , vol.45 , pp. 1315-1321
    • Darbellay, G.A.1    Vajda, I.2
  • 6
    • 34548696055 scopus 로고
    • Independent coordinates for strange attractors from mutual information
    • Fraser A.M., and Swinney H.L. Independent coordinates for strange attractors from mutual information. Physical Review A 33 (1986) 1134-1140
    • (1986) Physical Review A , vol.33 , pp. 1134-1140
    • Fraser, A.M.1    Swinney, H.L.2
  • 13
    • 36148950145 scopus 로고    scopus 로고
    • A simulated-annealing-based approach for simultaneous parameter optimization and feature selection of back-propagation networks
    • Lin S.-W., Tseng T.-Y., Chou S.-Y., and Chen S.-C. A simulated-annealing-based approach for simultaneous parameter optimization and feature selection of back-propagation networks. Expert Systems with Applications 34 2 (2008) 1491-1499
    • (2008) Expert Systems with Applications , vol.34 , Issue.2 , pp. 1491-1499
    • Lin, S.-W.1    Tseng, T.-Y.2    Chou, S.-Y.3    Chen, S.-C.4
  • 14
    • 0017535866 scopus 로고
    • A branch and bound algorithm for feature subset selection
    • Narendra P.M., and Fukunaga K. A branch and bound algorithm for feature subset selection. IEEE Transactions on Computers 26 (1977) 917-922
    • (1977) IEEE Transactions on Computers , vol.26 , pp. 917-922
    • Narendra, P.M.1    Fukunaga, K.2
  • 15
    • 24344458137 scopus 로고    scopus 로고
    • Feature selection based on mutual information criteria of max-dependency max-relevance and min-redundancy
    • August
    • Peng H., Long F., and Ding C. Feature selection based on mutual information criteria of max-dependency max-relevance and min-redundancy. IEEE Transactions on Pattern Analysis and Machine Intelligence 27 8 (2005) 1226-1238 August
    • (2005) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.27 , Issue.8 , pp. 1226-1238
    • Peng, H.1    Long, F.2    Ding, C.3
  • 17
    • 25144492516 scopus 로고    scopus 로고
    • Efficient feature selection via analysis of relevance and redundancy
    • October
    • Yu L., and Liu H. Efficient feature selection via analysis of relevance and redundancy. Journal of Machine Learning Research 5 (2004) 1205-1224 October
    • (2004) Journal of Machine Learning Research , vol.5 , pp. 1205-1224
    • Yu, L.1    Liu, H.2


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