Tabu search enhanced markov blanket classifier for high dimensional data sets

Operations Research/ Computer Science Interfaces Series

Volumn 29, Issue , 2005, Pages 337-354

  Bai, Xue ^a,b   Padman, Rema ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Carnegie Mellon University   (United States)

Author keywords

Bayesian networks; Markov blanket; Tabu search

Indexed keywords

EID: 84887869889     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/0-387-23529-9_22     Document Type: Article

References (28)

1. Abraham, A., Nath, B., and Mahanti, P.K. (2001). Hybrid intelligent systems for stock market analysis. Computational Science, pages 337-345.
2. Adam, B.L., Qu, Y., Davis, J.W., Ward, M.D., Clements, M.A., Cazares, L.H., Semmes, O.J., Schellhammer, P.F., Yasui, Y, Feng, Z., and Wright, G.L.Jr. (2002). Serum protein fingerprinting coupled with a pattern-matching algorithm distinguishes prostate cancer from benign prostate hyperplasia and healthy men. Cancer Research, 62:3609-3614.
3. Bai, X., Glymour, C, Padman, R., Spirtis, P., and Ramsey, J. (2004). Mb fan search classifier for large data sets with few cases. Technical Report CMU-CALD-04-102, School of Computer Science, Carnegie Mellon University.
4. Bai, X., Padman, R., and Airoldi, E. (2004). Sentiment extraction from unstructured text using tabu search-enhanced markov blanket. In Proceedings ofKDD Workshop on Mining for and from the Semantic Web (MSWKDD). Springer-Verlag Germany.
5. Berry, M.J.A. and Linoff, G.S. (1997). Data Mining Techniques: For Marketing, Sales, and Customer Support. John Wiley and Sons.
6. Chickering, D.M. (2002). Learning equivalence classes of bayesian-network structures. Journal of Machine Learning Research, 3:507-554.
7. Chickering, D.M., Meek, C, and Heckerman, D. (2003). Large-sample learning of bayesian networks is np-hard. In Proceedings of Nineteenth Conference on Uncertainty in Artificial Intelligence, pages 124-133. Morgan Kaufmann.
8. Cooper, G.F., Aliferis, C.F., Aronis, J., Buchanan, B.G., Caruana, R., Fine, M.J., Glymour, C, Gordon, G., Hanusa, B.H., Janosky, J.E., Meek, C, Mitchell, T., Richardson, T., and Spirtes, P. (1992). An evaluation of machine-learning methods for predicting pneumonia mortality. Artificial Intelligence in Medicine, 9:107-139.
9. Freeman, J. and Skapura, D. (1991). Neural Networks. Addison-Wesley.
10. Fu, Z., Golden, B.L., Lele, S., Raghavan, S., and Wasil, E.A. (2004). A genetic algorithm-based approach for building accurate decision trees. INFORMS Journal on Computing, 15:3-22.
11. Glover, F. (1997). Tabu Search. Kluwer Academic Publishers.
12. Hanley, J.A. and McNeil, B.J. (1983). A method of comparing the areas under receiver operating characteristic curves derived from the same cases. Radiology, 148:839-843.
13. Harwood, S. and Schemes, R. (2002). Genetic algorithm search over causal models. Technical Report CMU-PHIL-131, Department of Philosophy, Carnegie Mellon University.
14. Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press.
15. Johnson, D.S., Aragon, C.R., McGeoch, L.A., and Schevon, C. (1989). Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning, Operations Research, 37:6:865-892.
16. Johnson, D.S. and McGeoch, L.A. (1997). The traveling salesman problem: A case study in local optimization. In E.H.L., Aarts and J.K., Lenstra, editors, Local Search in Combinatorial Optimization, pages 215-310. John Wiley and Sons.
17. Roller, D. and Sahami, M. (1996). Towards optimal feature selection. In Proceedings of the Thirteenth International Conference on Machine Learning, pages 284-292. Morgan Kauf-mann.
18. Margaritis, D. and Thrun, S. (1999). Bayesian network induction via local neighborhoods. In Advances in Neural Information Processing System.
19. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., and Teller, E. (1953). Equation of state calculations by fast computing machines. Journal. Chemical Physics, 21-6:1087-1092.
20. Moll, R., Perkins, T.J., and Barto, A.G. (2000). Machine learning for subproblem selection. In Proceedings 17th International Conf. on Machine Learning, pages 615-622. Morgan Kauf-mann, San Francisco, CA.
21. Pearl, J. (2000). Causality: Models, Reasoning, and Inference. Cambridge University Press.
22. Provost, R, Fawcett, T, and Kohavi, R. (1998). The case against accuracy estimation for comparing induction algorithms. In Proceedings of the Fifteenth International Conference on Machine Learning, pages 445-453.
23. Spirtes, P., Glymour, C, and Schemes, R. (2000). Causation, Prediction, and Search. MIT Press.
24. Spirtes, P. and Meek, C. (1995). Learning bayesian networks with discrete variables from data. In Proceedings of the First International Conference on Knowledge Discovery and Data Mining, pages 294-299. AAAI Press.
25. Sreerama, K. M., Kasif, S., and Salzberg, S. (1994). A system for induction of oblique decision trees. Journal of Artificial Intelligence Research, 2:1-32.
26. Toth, P. and Vigo, D. (2003). The granular tabu search and its application to the vehicle routing problem. INFORMS Journal on Computing, 15:4:334-346.
27. Tsamardinos, I. and Aliferis, C.F. (2002). Algorithms for large-scale local causal discovery in the presence of small sample or large causal neighborhoods. Technical Report DSL-02-08, Vanderbilt University.
28. Weiss, S.M. and Kulikowski, CA. (1991). Computer Systems That Learn. Morgan Kaufmann.