A novel Markov boundary based feature subset selection algorithm

Neurocomputing

Volumn 73, Issue 4-6, 2010, Pages 578-584

  de Morais, Sérgio Rodrigues ^a   Aussem, Alex ^b  

^a UNIVERSITÉ DE LYON   (France)

^b UNIVERSITÉ LYON 1   (France)

Author keywords

Bayesian networks; Feature subset selection; Markov boundary; Pattern recognition

Indexed keywords

CONSTRAINT-BASED; DATA SETS; DISCOVERY ALGORITHM; FEATURE SUBSET SELECTION; HIGH DIMENSIONAL DATA; MARKOV BOUNDARY; MINIMAL SUBSET; PROBABILISTIC CLASSIFICATION; SCALING-UP; SYNTHETIC DATASETS;

CLASSIFICATION (OF INFORMATION); CLUSTERING ALGORITHMS; DISTRIBUTED PARAMETER NETWORKS; INFERENCE ENGINES; INTELLIGENT NETWORKS; PATTERN RECOGNITION; RANDOM PROCESSES; RANDOM VARIABLES; SET THEORY;

BAYESIAN NETWORKS;

ACCURACY; ALGORITHM; ARTICLE; AUTOMATED PATTERN RECOGNITION; BAYES THEOREM; BAYESIAN NETWORK; CONSTRAINT BASED METHOD; EMPIRICAL RESEARCH; INTERMETHOD COMPARISON; LEARNING ALGORITHM; MARKOV BOUNDARY; MATHEMATICAL ANALYSIS; MATHEMATICAL MODEL; MATHEMATICAL PARAMETERS; PRIORITY JOURNAL; PROBABILITY; STATISTICAL ANALYSIS; STRUCTURE ANALYSIS;

EID: 75749145760     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.neucom.2009.05.018     Document Type: Article

References (17)

1. S. Fu, M. Desmarais, Tradeoff analysis of different Markov blanket local learning approaches, in: Proceedings of the Advances in Knowledge Discovery and Data Mining (PAKDD), 2008, pp. 562-571.
2. S.R. de Morais, A. Aussem, A novel scalable and data efficient feature subset selection algorithm, in: Proceedings of the ECML/PKDD, 2008, pp. 298-312.
3. I. Guyon, C. Aliferis, G. Cooper, A. Elisseeff, J. Pellet, P. Spirtes, A. Statnikov, Design and analysis of the causation and prediction challenge, Journal of Machine Learning Research W&CP (2008) 1-33.
4. Y. Yilmaz, E. Alpaydin, H.L. Akin, T. Bilgiç, Handling of deterministic relationships in constraint-based causal discovery, in: PGM'02, 2002.
5. S. Rodrigues de Morais, A. Aussem, M. Corbex, Handling almost-deterministic relationships in constraint-based Bayesian network discovery: application to cancer risk factor identification, in: ESANN'08, 2008, pp. 101-106.
6. L.E. Brown, I. Tsamardinos, A strategy for making predictions under manipulation, Journal of Machine Learning Research W&CP (2008) 35-52.
7. I. Tsamardinos, L.E. Brown, Bounding the false discovery rate in local Bayesian network learning, in: AAAI, 2008, pp. 1100-1105.
8. Peña J.M., Nilsson R., Björkegren J., and Tegnér J. Towards scalable and data efficient learning of Markov boundaries. International Journal of Approximate Reasoning 45 2 (2007) 211-232
9. Nilsson R., Peña J.M., Björkegren J., and Tegnér J. Consistent feature selection for pattern recognition in polynomial time. Journal of Machine Learning Research 8 (2007) 589-612
10. Tsamardinos I., Brown L.E., and Aliferis C.F. The max-min Hill-climbing Bayesian network structure learning algorithm. Journal of Machine Learning 65 1 (2006) 31-78
11. S. Yaramakala, D. Margaritis, Speculative Markov blanket discovery for optimal feature selection, in: Proceedings of the ICDM, 2005, pp. 809-812.
12. Chickering D.M., Heckerman D., and Meek C. Large-sample learning of Bayesian networks is NP-hard. Journal of Machine Learning Research 5 (2004) 1287-1330
13. Neapolitan R.E. Learning Bayesian Networks (2004), Prentice-Hall, Englewood Cliffs, NJ
14. I. Tsamardinos, C.F. Aliferis, A.R. Statnikov, Algorithms for large scale Markov blanket discovery, in: Proceedings of the FLAIRS'03, 2003, pp. 376-381.
15. Spirtes P., Glymour C., and Scheines R. Causation, Prediction, and Search (2000), The MIT Press, Cambridge, MA
16. Pearl J. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference (1988), Morgan Kaufmann, Los Altos, CA
17. 〈http://discover.mc.vanderbilt.edu/discover/public/supplements/mmhc_paper/mmhc_index.html〉.