메뉴 건너뛰기




Volumn 4827 LNAI, Issue , 2007, Pages 431-440

A novel information theory method for filter feature selection

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; CLASSIFICATION (OF INFORMATION); GRAPH THEORY; PROBABILITY DENSITY FUNCTION;

EID: 38149013865     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76631-5_41     Document Type: Conference Paper
Times cited : (6)

References (22)
  • 2
    • 33750052587 scopus 로고    scopus 로고
    • What should be expected from feature selection in small-sample settings
    • Sima, C., Dougherty, E.R.: What should be expected from feature selection in small-sample settings. Bioinformatics 22(19), 2430-2436 (2006)
    • (2006) Bioinformatics , vol.22 , Issue.19 , pp. 2430-2436
    • Sima, C.1    Dougherty, E.R.2
  • 3
    • 25444528447 scopus 로고    scopus 로고
    • Feature selection and classification for microarray data analysis: Evolutionary methods for identifying predictive genes
    • Jirapech-Umpai, T., Aitken, S.: Feature selection and classification for microarray data analysis: Evolutionary methods for identifying predictive genes. BMC Bioinformatics 6, 148 (2005)
    • (2005) BMC Bioinformatics , vol.6 , pp. 148
    • Jirapech-Umpai, T.1    Aitken, S.2
  • 7
    • 24344458137 scopus 로고    scopus 로고
    • Feature Selection Based on Mutual Information: Criteria of Max-Dependency, Max-Relevance, and Min-Redundancy
    • Peng, H., Long, F., 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)
    • (2005) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.27 , Issue.8
    • Peng, H.1    Long, F.2    Ding, C.3
  • 10
    • 0041877169 scopus 로고    scopus 로고
    • Estimation of Entropy and Mutual Information
    • Paninski, I.: Estimation of Entropy and Mutual Information. Neural Computation 15(1) (2003)
    • (2003) Neural Computation , vol.15 , Issue.1
    • Paninski, I.1
  • 13
    • 0042826822 scopus 로고    scopus 로고
    • Independent Component Analysis: Algorithms and Applications
    • Hyvarinen, A., Oja, E.: Independent Component Analysis: Algorithms and Applications. Neural Networks 13(4-5), 411-430 (2000)
    • (2000) Neural Networks , vol.13 , Issue.4-5 , pp. 411-430
    • Hyvarinen, A.1    Oja, E.2
  • 14
    • 38149096480 scopus 로고
    • Estimating Function of Probability Distribution from a Finite Set of Samples, Los Alamos National Laboratory Report LA-UR-92-4369
    • TR-93-07-046
    • Wolpert, D., Wolf, D.: Estimating Function of Probability Distribution from a Finite Set of Samples, Los Alamos National Laboratory Report LA-UR-92-4369, Santa Fe Institute Report TR-93-07-046 (1995)
    • (1995) Santa Fe Institute Report
    • Wolpert, D.1    Wolf, D.2
  • 15
    • 85032752338 scopus 로고    scopus 로고
    • Applications of spanning entropic graphs
    • Hero, A.O., Michel, O.: Applications of spanning entropic graphs. IEEE Signal Processing Magazine 19(5), 85-95 (2002)
    • (2002) IEEE Signal Processing Magazine , vol.19 , Issue.5 , pp. 85-95
    • Hero, A.O.1    Michel, O.2
  • 16
    • 0033184661 scopus 로고    scopus 로고
    • Asymptotic theory of greedy aproximations to minnimal k-point random graphs
    • Hero, A.O., Michel, O.: Asymptotic theory of greedy aproximations to minnimal k-point random graphs. IEEE Trans. on Infor. Theory 45(6), 1921-1939 (1999)
    • (1999) IEEE Trans. on Infor. Theory , vol.45 , Issue.6 , pp. 1921-1939
    • Hero, A.O.1    Michel, O.2
  • 17
    • 0025460006 scopus 로고
    • An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability
    • Bertsimas, D.J., Van Ryzin, G.: An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability. Operations Research Letters 9(1), 223-231 (1990)
    • (1990) Operations Research Letters , vol.9 , Issue.1 , pp. 223-231
    • Bertsimas, D.J.1    Van Ryzin, G.2
  • 18
  • 19
    • 34250822407 scopus 로고
    • Estimation of the entropy and information of absolutely continuous random variables
    • Mokkadem, A.: Estimation of the entropy and information of absolutely continuous random variables. IEEE Trans. on Inform. Theory 35(1), 193-196 (1989)
    • (1989) IEEE Trans. on Inform. Theory , vol.35 , Issue.1 , pp. 193-196
    • Mokkadem, A.1
  • 20
    • 34047195663 scopus 로고    scopus 로고
    • EBEM: An Entropy-based EM Algorithm for Gaussian Mixture Models
    • Peñalver, A., Escolano, F., Sáez, J.M.: EBEM: An Entropy-based EM Algorithm for Gaussian Mixture Models. ICPR , 451-455 (2006)
    • (2006) ICPR , vol.451-455
    • Peñalver, A.1    Escolano, F.2    Sáez, J.M.3
  • 22
    • 36348943047 scopus 로고    scopus 로고
    • Fast Feature Selection from Microarray Expression Data via Multiplicative Large Margin Algorithms
    • Gentile, C.: Fast Feature Selection from Microarray Expression Data via Multiplicative Large Margin Algorithms. In: Proceedings NIPS (2003)
    • (2003) Proceedings NIPS
    • Gentile, C.1


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