On Guo and Nixon's criterion for feature subset selection: Assumptions, implications, and alternative options

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans

Volumn 40, Issue 3, 2010, Pages 651-655

  Balagani, Kiran S ^a   Phoha, Vir V ^a   Iyengar, S S ^b   Balakrishnan, N ^c  

^a LOUISIANA TECH UNIVERSITY   (United States)

^b LOUISIANA STATE UNIVERSITY   (United States)

^c INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Entropic spanning graphs; Feature selection; Mutual information; Parzen window

Indexed keywords

FEATURE SELECTION; FEATURE SELECTION METHODS; FEATURE SUBSET SELECTION; FEATURE VECTORS; JOINT PROBABILITY; MUTUAL INFORMATIONS; PARZEN WINDOWS; PRODUCT DISTRIBUTIONS; SECOND ORDERS;

PROBABILITY DISTRIBUTIONS;

FEATURE EXTRACTION;

EID: 77951203722     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCA.2009.2036935     Document Type: Conference Paper

References (13)

1. B. Guo and M. S. Nixon, "Gait feature subset selection by mutual information," IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol.39, no.1, pp. 36-46, Jan. 2009.
2. T. Cover and J. A. Thomas, Elements of Information Theory. Hoboken, NJ: Wiley, 1999, ser. Wiley Series in Telecommunications.
3. H. Peng, F. Long, and C. Ding, "Feature selection based on mutual information: Criteria of max-dependency, max-relevance, and minredundancy," IEEE Trans. Pattern Anal. Mach. Intell., vol.27, no.8, pp. 1226-1238, Aug. 2005. (Pubitemid 41245053)
4. R. Battiti, "Using mutual information for selecting features in supervised neural net learning," IEEE Trans. Neural Netw., vol.5, no.4, pp. 537-550, Jul. 1994.
5. R. O. Duda, P. E. Hart, and D. G. Stork, Pattern Classification. New York: Wiley, 2001.
6. N. Kwak and C. Choi, "Input feature selection by mutual information based on Parzen window," IEEE Trans. Pattern Anal. Mach. Intell., vol.24, no.12, pp. 1667-1671, Dec. 2002.
7. N. Friedman, D. Geiger, and M. Goldszmidt, "Bayesian network classifiers," Mach. Learn., vol. 29, no. 2/3, pp. 131-163, Nov. 1997.
8. J. Beirlant, E. J. Dudewicz, L. Györfi, and E. van der Meulen, "Nonparametric entropy estimation: An overview," Int. J. Math. Stat. Sci., vol.6, no.1, pp. 17-39, 1997.
9. R. P. W. Duin, "On the choice of smoothing parameters for Parzen estimators of probability density functions," IEEE Trans. Comput., vol.C-25, no.11, pp. 1175-1179, Nov. 1976.
10. S. J. Raudys and A. K. Jain, "Small sample size effects in statistical pattern recognition: Recommendations for practitioners," IEEE Trans. Pattern Anal. Mach. Intell., vol.13, no.3, pp. 252-264, Mar. 1991.
11. A. O. Hero, III, B. Ma, O. Michel, and J. Gorman, "Applications of entropic spanning graphs," IEEE Signal Process. Mag., vol.19, no.5, pp. 85-95, Sep. 2002.
12. A. O. Hero, III and O. J. J. Michel, "Asymptotic theory of greedy approximations to minimal k-point random graphs," IEEE Trans. Inf. Theory, vol.45, no.6, pp. 1921-1938, Sep. 1999.
13. B. Bonev, F. Escolano, and M. Cazorla, "Feature selection, mutual information, and the classification of high-dimensional patterns," Pattern Anal. Appl., vol. 11, no. 3/4, pp. 309-319, Sep. 2008.