A conservative feature subset selection algorithm with missing data

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2008, Pages 725-730

  Aussem, Alex ^a,b   De Morais, Sergio Rodrigues ^a,c  

^a UNIVERSITÉ DE LYON   (France)

^b UNIVERSITÉ LYON 1   (France)

^c UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

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

MINING;

INFORMATION MANAGEMENT;

EID: 67049165534     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2008.82     Document Type: Conference Paper

References (19)

1. C. Aliferis, I. Tsamardinos, and A. Statnikov. Hiton: a novel markov blanket algorithm for optimal variable selection. In AMIA Annu Symp Proc, pages 21-26, 2003.
2. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Statist. Soc. Ser. B, 39(1):1-38, 1977.
3. O. Francois and P. Leray. Learning the tree augmented naive bayes classifier from incomplete datasets. In The third European Workshop on Probabilistic Graphical Models PGM'06, pages 91-98, Prague, Czech Republic, 2006.
4. N. Friedman. Learning belief networks in the presence of missing values and hidden variables. In ICML, pages 125- 133, 1997.
5. N. Friedman. The bayesian structural EMalgorithm. In UAI, pages 129-138, 1998.
6. S. Geman and D. Geman. Stochastic relaxation, gibbs distributions, and the bayesian restoration of images. IEEE Trans. Pattern Anal. Machine Intell., 6(6):721-741, Nov. 1984. (Pubitemid 15453722)
7. D. Koller and M. Sahami. Toward optimal feature selection. In ICML, pages 284-292, 1996.
8. D. Margaritis and S. Thrun. Bayesian network induction via local neighborhoods. In NIPS, pages 505-511, 1999.
9. J. Myers, K. Laskey, and 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.
10. R. E. Neapolitan. Learning Bayesian Networks. Prentice Hall, 2004.
11. J. Peña, J. Bjrkegren, and J. Tegnér. Scalable, efficient and correct learning of markov boundaries under the faithfulness assumption. In 8th European Conference on Symbolic and Quantitative Approaches to Reasoning under Uncertainty (ECSQARU 2005), volume 21, pages 136-147. Lecture Notes in Artificial Intelligence 3571, 2005.
12. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
13. M. Ramoni and P. Sebastiani. Robust learning with missing data. Machine Learning, 45(2):147-170, 2001. (Pubitemid 33635983)
14. S. Rodrigues de Morais and A. Aussem. A novel scalable and correct markov boundary learning algorithms under faithfulness condition. In 4th European Workshop on Probabilistic Graphical Models (PGM'08), Hirtshals, Denmark, 2008.
15. S. Rodrigues de Morais and A. Aussem. A novel scalable and data efficient feature subset selection algorithm. In European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML PKDD, Antwerp, Belgium, 2008.
16. I. Tsamardinos, C. F. Aliferis, and A. R. Statnikov. Algorithms for large scale markov blanket discovery. In FLAIRS Conference, pages 376-381, 2003.
17. J. Whittaker. Graphical Models in Applied Multivariate Analysis. New York. Whiley, 1990.
18. S. Yaramakala. Fast markov blanket discovery. In MSThesis, Iowa State University, 2004.
19. S. Yaramakala and D. Margaritis. Speculative markov blanket discovery for optimal feature selection. In ICDM, pages 809-812, 2005. (Pubitemid 47385802)