User-oriented feature selection for machine learning

Computer Journal

Volumn 50, Issue 4, 2007, Pages 421-434

  Liang, Hongli ^a   Wang, Jue ^a   Yao, Yiyu ^b  

^a INSTITUTE OF AUTOMATION   (China)

^b UNIVERSITY OF REGINA   (Canada)

Author keywords

Feature selection; NP hard; Reduct; User oriented

Indexed keywords

DOMAIN-SPECIFIC SEMANTIC INFORMATION; MACHINE LEARNING ALGORITHM; USER-ORIENTED FEATURE SELECTION;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FEATURE EXTRACTION; HEURISTIC METHODS; SEMANTICS;

LEARNING SYSTEMS;

EID: 34447548592     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxm012     Document Type: Article

References (21)

1. Blum, A.L. and Langley, P. (1997) Selection of relevant features and examples in machine earning. Artif. Intell., 97(1-2), 245-271.
2. Dask, M. and Liu, H. (1997) Feature selection for classification. Intell. Data Anal., 1(3), 131-156.
3. Hall, M.A. and Holmes, G. (2003) Benchmarking attribute selection techniques for discrete class data mining. IEEE Trans. Knowl. Data Eng., 15(6), 1437-1447.
4. Jain, A. and Zongker, D. (1997) Feature selection: Evaluation, application, and small sample performance. IEEE Trans. Pattern Anal. Mach. Intell., 16(2), 153-158.
5. Liu, H. and Yu, L. (2005) Toward integrating feature selection algorithms for classification and clustering. IEEE Trans. Knowl. Data Eng., 17(4), 491-502.
6. Molina, L.C., Belanche, L. and Nebot, A. (2002) Feature selection algorithms: A survey and experimental evaluation. Proceedings of 2002 IEEE Conf. on Data Mining, Maebashi, Japan, December 9-12, pp. 306-313. IEEE Computer Society Press Los Alamitos, California.
7. Yao, J.T. and Zhang, M. (2005) Feature selection with adjustable criteria. Proceedings of RSFDGrC'05, INCS 3641, Regina, August 31-September 3, pp. 204-213. Springer-Verlag, Berlin.
8. Zhong, N., Dong, J. and Ohsuga, S. (2001) Using rough sets with heuristics for feature selection. J. Intell. Syst., 16(3), 199-214.
9. Wang, J. and Wang, J. (2001) Reduction algorithms based on discernibility matrix: The ordered features method. J. Comput. Sci. Technol., 16(6), 489-504.
10. Zhao, K. and Wang, J. (2002) A reduction algorithm meeting user's requirements. J. Comput. Sci. Technol., 17(5), 578-593.
11. Pawlak, Z. (1991) Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht.
12. Yao, Y.Y., Zhao, Y., Wang, J. and Han, S.Q. (2006) A model of machine learning based on user preference of features. The Fifth International Conference on Rough Sets and Current Trends in Computing, LNAI 4295, Kobe, Japan, November 6-8, pp. 587-596. Springer-Verlag, Berlin.
13. Yao, Y.Y., Wang, F.Y., Wang, J. and Zeng, D. (2005) Rule + exception strategies for security information analysis. IEEE Intell. Syst., 20(5), 52-57.
14. Skowron, A. and Rauszer, C. (1991) The discernibility matrices and functions in information systems. In Slowinski, R. (ed.), Intelligent Decision Support Handbook of Applications and Advance of the Rough Sets Theory, pp. 331-362.
15. Han, S.Q. and Wang, J. (2004) Reduct and feature order. J. Comput. Sci. Technol., 19(4), 429-449.
16. Zhao, M. (2004) Data description based on reduct theory. PhD Thesis, Institute of Automation, Chinese Academy of Sciences. (In Chinese)
17. Hu, K.Y., Lu, Y.C. and Shi, C.Y. (2003) Feature ranking in rough sets. AI Commun., 16(1), 41-50.
18. Fishburn, P.C. (1970) Utility Theory for Decision Making. John Wiley & Sons, Inc., New York.
19. Roberts, F. (1979) Measurement Theory. Addison Wesley, MA.
20. Garey, M.R. and Johnson, D.S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, San Francisco.
21. Wang, J., Zhao, M., Zhao, K. and Han, S.Q. (2003) Multilevel data summarization from information systems: A "rule + exception" approach, AI Commun., 16(1), 17-39.