Consistency based feature selection

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1805, Issue , 2000, Pages 98-109

  Dash, Manoranjan ^a   Liu, Huan ^a   Motoda, Hiroshi ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

FEATURE EXTRACTION;

CLASSIFICATION TASKS; DIMENSIONALITY REDUCTION; EMPIRICAL STUDIES; FEATURE SUBSET; NEW APPLICATIONS; SEARCH METHOD; SEARCH STRATEGIES;

DATA MINING;

EID: 84942785917     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45571-x_12     Document Type: Conference Paper

References (21)

1. H. AlmualUm cind T. G. Dietterich. Learning boolean concepts in the presence of many irrelevant features. Artificial Intelligence, 69(l-2):279-305, November 1994.
2. M. Ben-Bassat. Pattern recognition and reduction of dimensionality. In P. R. Krishncuah and L. N. Kanal, editors, Handbook of Statistics, pages 773-791. North HoUand, 1982.
3. A. L. Blum and P. Lcingley. Selection of relevcint features and examples in machine learning. Artificial Intelligence, 97:245-271, 1997.
4. A Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Occam's razor. Readings in Machine Learning, pages 201-204, 1990.
5. G. Brassard and P. Bratley. Fundamentals of Algorithms. Prentice HcJl, New Jersy, 1996.
6. M. Dash. Feature selection via set cover. In Proceedings of IEEE Knowledge and Data Engineering Exchange Eorkshop, pages 165-171, Newport, California, November 1997. IEEE Computer Society.
7. M. Dash and H. Liu. Feature selection methods for classification. Intelligent Data Analysis: An Interbational Journal, 1(3), 1997.
8. P. A. Devijver and J. Kittler. Pattern Recognition: A Statistical Approach. Prentice Hall, 1982.
9. G. H. John, R. Kohavi, and K. Pfleger. Irrelevcint features cind the subset selection problem. In Proceedings of the Eleventh International Conference on Machine Learning, pages 121-129, 1994.
10. D. S. Johnson. Approximation eilgorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256-278, 1974.
11. K. Kira and L. A. Rendell. The feature selection problem: Traditional methods and a new algorithm. In Proceedings of Ninth National Conference on AI, pages 129-134, 1992.
12. R. Kohavi. Wrappers for performance enhancement and oblivious decision graphs. PhD thesis. Department of Computer Science, Stanford University, CA, 1995.
13. H. Liu, H. Motoda, and M. Dcish. A monotonic measure for optimal feature selection. In Proceedings of European Conference on Machine Learning, pages 101-106, 1998.
14. H. Liu and R. Setiono. Feature selection and classification - a probabilistic wrapper approach. In Proceedings of Ninth International Conference on Industrial and Engineering Applications of AI and ES, 1996.
15. C. J. Merzcmd, P. M. Murphy. UCI repository of machine learning databases, 1996. FTP from ics.uci.edu in the directory pub/machine-learning-databases.
16. P. M. Narendra and K. Fukunaga. A breinch and bound algorithm for featiu-e selection. IEEE Transactions on Computers, C-26 (9):917-922, September 1977.
17. J. R. Quinlan. C4-5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, California, 1993.
18. T. W. Rauber. Inductive Pattern Classification Methods - Features - Sensors. PhD thesis. Department of ElectriccJ Engineering, Universidale Nova de Lisboa, 1994.
19. W. Siedlecki and J Sklcinsky. On automatic feature selection. International Journal of Pattern Recognition and Artificial Intelligence, 2:197-220, 1988.
20. S. Watanabe. Pattern Recognition: Human and Mechanical. Wiley Intersceince, 1985.
21. A. Zell and et al. Stuttgart Neureil Network Simulator (SNNS), user manual, version 4.1. Technical report, 1995.