A conservative feature subset selection algorithm with missing data

Neurocomputing

Volumn 73, Issue 4-6, 2010, Pages 585-590

  Aussem, Alex ^a   Rodrigues de Morais, Sergio ^b  

^a UNIVERSITÉ LYON 1   (France)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

Bayesian networks; Feature selection; Markov boundary; Missing data

Indexed keywords

EXPECTATION-MAXIMIZATION ALGORITHMS; FEATURE SELECTION; FEATURE SUBSET SELECTION; INCOMPLETE DATA; MARKOV BLANKETS; MARKOV BOUNDARY; MINIMAL SUBSET; MISSING AT RANDOMS; MISSING DATA; REAL-WORLD; STATE-OF-THE-ART APPROACH;

DISTRIBUTED PARAMETER NETWORKS; INFERENCE ENGINES; INTELLIGENT NETWORKS;

BAYESIAN NETWORKS;

ALGORITHM; ARTICLE; CONSERVATIVE MARKOV BLANKET; DATA ANALYSIS; INDEPENDENT VARIABLE; INTERMETHOD COMPARISON; MACHINE LEARNING; MATHEMATICAL MODEL; MATHEMATICAL PARAMETERS; MISSING DATA; PRIORITY JOURNAL; PROBABILITY; QUALITY CONTROL; STATISTICAL ANALYSIS;

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

References (13)

1. Dempster A.P., Laird N.M., and Rubin D.B. Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Statist. Soc. Ser. B 39 1 (1977) 1-38
2. N. Friedman, The Bayesian structural EM algorithm, in: UAI, 1998, pp. 129-138.
3. Geman S., and Geman D. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. Pattern Anal. Machine Intell. 6 6 (1984) 721-741
4. H.W. Kuhn, A.W. Tucker, Nonlinear programming, in: Proceedings of 2nd Berkeley Symposium, Berkeley, University of California Press, 1951, pp. 481-492.
5. J. Myers, K. Laskey, T. Levitt, Learning Bayesian networks from incomplete data with stochastic search algorithms, in: Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence (UAI'95), 1995.
6. Neapolitan R.E. Learning Bayesian Networks (2004), Prentice-Hall, Englewood Cliffs, NJ
7. 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
8. Pearl J. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference (1988), Morgan Kaufmann, Los Altos, CA
9. Ramoni M., and Sebastiani P. Robust learning with missing data. Machine Learning 45 2 (2001) 147-170
10. I. Tsamardinos, C.F. Aliferis, A.R. Statnikov, Algorithms for large scale Markov blanket discovery, in: FLAIRS Conference, 2003, pp. 376-381.
11. Tsamardinos I., Brown L., and Aliferis C. The max-min hill-climbing Bayesian network structure learning algorithm. Machine Learning 65 1 (2006) 31-78
12. F. Bromberg, D. Margaritis, V. Honavar, Efficient Markov network structure discovery using independence tests, in: SIAM Data Mining Conference SDM'06, 2006.
13. Whittaker J. Graphical Models in Applied Multivariate Analysis (1990), Wiley, New York