Searching for interacting features in subset selection

Intelligent Data Analysis

Volumn 13, Issue 2, 2009, Pages 207-228

  Zhao, Zheng ^a   Liu, Huan ^a  

^a Arizona State University   (United States)

Author keywords

And classification; Data structure; Feature interaction; Feature selection; Search

Indexed keywords

EID: 65449184542     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/IDA-2009-0364     Document Type: Article

References (43)

1. M.-Y. Park and T. Hastie, Regularization Path Algorithms For Detecting Gene Interactions, web, July 2006.
2. R. Duda, P. Hart and D. Stork, Pattern Classification, (2nd ed.), John Wiley & Sons, New York, 2001.
3. J.R. Quinlan, C4.5: Programs for Machine Learning, Morgan Kaufmann, 1993.
4. T.M. Mitchell, Machine Learning, McGraw-Hill, 1997.
5. V. Vapnik, The Nature of Statistical Learning Theory. Springer-Verlag New York, Inc., 1995.
6. L. Breiman, Bagging predictors, Machine Learning 24 (1996), 123-140.
7. Y. Freund and R. Schapire, A decision-theoretic generalization of on-line learning and an application to boosting, Computer Systems and Science 55(1) (1997), 119-139.
8. I. Guyon and A. Elisseeff, An introduction to variable and feature selection, Journal of Machine Learning Research 3 (2003), 1157-1182.
9. T. Hastie, R. Tibshirani and J. Friedman, The Elements of Statistical Learning, Springer, 2001.
10. J. Friedman, On bias, variance, 0/1-loss, and the curse-of-dimensionality, Data Mining and Knowledge Discovery 1 1) (1997).
11. L. Valiant, A theory of the learnable, Communications of the Association for Computing Machinery 27 (1984), 1134-1142.
12. M. Kearns and U. Vazirani, An Introduction to Computational Learning Theory. The MIT Press, 1994.
13. M. Dash and H. Liu, Feature selection for classification, Intelligent Data Analysis: An International Journal 1(3) (1997), 131-156.
14. R. Gilad-Bachrach, A. Navot and N. Tishby, Margin based feature selection - theory and algorithms, in: ICML '04: Twenty-first international conference on Machine learning, ACM Press, 2004.
15. F. Fleuret, Fast binary feature selection with conditional mutual information, J Mach Learn Res 5 (2004), 1531-1555.
16. A.L. Blum and P. Langley, Selection of relevant features and examples in machine learning, Artificial Intelligence 97 (1997), 245-271.
17. H. Liu and L. Yu, Toward integrating feature selection algorithms for classification and clustering, IEEE Transactions on Knowledge and Data Engineering 17 (2005), 491-502.
18. H. Almuallim and T.G. Dietterich, Learning boolean concepts in the presence of many irrelevant features, Artificial Intelligence 69(1-2) (1994), 279-305.
19. D. Koller and M. Sahami, Toward optimal feature selection, in: Proceedings of the Thirteenth International Conference on Machine Learning, 1996, pp. 284-292.
20. M.A. Hall, Correlation-based feature selection for discrete and numeric class machine learning, in: Proceedings of the Seventeenth International Conference on Machine Learning, 2000, pp. 359-366.
21. L. Yu and H. Liu, Feature selection for high-dimensional data: A fast correlation-based filter solution, in: Proceedings of the twentieth International Conference on Machine Learning, 2003, pp. 856-863.
22. A. Jakulin, Machine Learning Based On Attribute Interactions, Ph.D. dissertation, University of Ljubljana, 2005.
23. C.A. Isabelle Guyon and A. Elisseeff, Computational Methods of Feature Selection, Chapman and Hall/CRC Press, ch. Causal Feature Selection, 2008, 63-85.
24. S. Thrun et al., The monk's problems: A performance comparison of different learning algorithms, Carnegie Mellon University, Tech Rep CMU-CS-91-197, 1991.
25. T.M. Cover and J.A. Thomas, Elements of Information Theory, Wiley, 1991.
26. A. Jakulin and I. Bratko, Testing the significance of attribute interactions, in: ICML '04: Twenty-First International conference On Machine Learning, ACM Press, 2004.
27. M. Pazzani, Searching for dependencies in bayesian classifiers, in: Learning from Data: AI and Statistics V, Springer-Verlag, 1996.
28. A. Jakulin and I. Bratko, Analyzing attribute dependencies, in: Proc of Principles of Knowledge Discovery in Data (PKDD), (Vol. 2838) ser. LNAI, N. Lavrač, D. Gamberger, H. Blockeel and L. Todorovski, eds, Springer-Verlag, [Online], Available: Citeseer.ist.psu.edu/ jakulin03analyzing.html, September 2003, pp. 229-240.
29. J. Cheng, D.A. Bell and W. Liu, Learning belief networks from data: An information theory based approach, in: the sixth ACM International Conference on Information and Knowledge Management, 1997.
30. S. Yaramakala and D. Margaritis, Speculative markov blanket discovery for optimal feature selection, in: the Fifth IEEE international Conference on Data Mining, 2005.
31. E.R. Hruschka, J. Hruschka, T.F. Covoes and N.F.F. Ebecken, Bayesian feature selection for clustering problems, Journal of Information & Knowledge Management 6 (2006), 1-13.
32. L. Xu, P.Yan and T. Chang, Best first strategy for feature selection, in: Proceedings of the Ninth International Conference on Pattern Recognition 1988, pp. 706-708.
33. I. Kononenko, Estimating attributes: Analysis and extension of RELIEF, in: Proceedings of the European Conference on Machine Learning, F. Bergadano and L. De Raedt, eds, Catania, Italy: Berlin: Springer-Verlag, April 6-8 1994, pp. 171-182.
34. I.H. Witten and E. Frank, Data Mining - Pracitcal Machine Learning Tools and Techniques with JAVA Implementations, (2nd ed.), Morgan Kaufmann Publishers, 2005.
35. G.H. John, R. Kohavi and K. Pfleger, Irrelevant feature and the subset selection problem, in: Proceedings of the Eleventh International Conference on Machine Learning, 1994, pp. 121-129.
36. M. Robnik-Sikonja and I. Kononenko, Theoretical and empirical analysis of Relief and ReliefF, Machine Learning 53 (2003), 23-69.
37. H. Liu, H. Motoda and M. Dash, A monotonic measure for optmial feature selection, in: Machine Learning: ECML-98, C. Nedellec and C. Rouveirol, eds, Chemnitz, Germany: Berlin Heidelberg: Springer-Verlag, April 21-23, 1998, pp. 101-106.
38. D.A. Bell and H. Wang, A formalism for relevance and its application in feature subset selection, Machine Learning 41(2) (2000), 175-195.
39. M. Dash and H. Liu, Consistency-based search in feature selection, Artificial Intelligence 151(1-2) (2003), 155-176.
40. C. Blake and C. Merz, UCI Repository Of Machine Learning Databases 1998, [Online]. Available: http://www.ics.uci.edu/~mlearn/ MLRepository.html.
41. A. Alizadeh et al., Distinct types of diffuse large B-cell lymphoma identified by gene expression profiling, Nature 403 (2000), 503-511.
42. U.M. Fayyad and K.B. Irani, Multi-interval discretization of continuous-valued attributes for classification learning, in: Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, 1993, pp. 1022-1027.
43. J.T. Irina Rish and J.L. Hellerstein, An analysis of data characteristics that affect naive bayes performance, IBM T.J. Watson Research Center, Tech Rep, 2001.