Representing conditional independence using decision trees

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2005, Pages 874-879

  Su, Jiang ^a   Zhang, Harry ^a  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LEARNING SYSTEMS; PROBLEM SOLVING; TREES (MATHEMATICS);

CLASSIFICATION ACCURACY; CONDITIONAL INDEPENDENCE TREES (CITREES); DECISION TREES;

DECISION THEORY;

EID: 29344444557     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Boutilier, C.; Friedman, N.; Goldszmidt, M.; and Koller, D. 1996. Context-specific independence in Bayesian networks. In Proceedings of the 12th Annual Conference on Uncertainty in AI (UAI), 416-422.
2. Buntine, W. 1991. Theory refinement on Bayesian networks. In Proceedings of the Seventh Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann. 52-60.
3. Friedman, N., and Goldszmidt, M. 1996. Learning Bayesian networks with local structure. In Twelfth Conference on Uncertainty in Artificial Intelligence. 252-262.
4. Friedman, N.; Geiger, D.; and Goldszmidt, M. 1997. Bayesian network classifiers. Machine Learning 29:131-163.
5. Jaeger, M. 2004. Probabilistic decision graphs - combining verification and AI techniques for probabilistic inference. Int. J. of Uncertainty, Fuzziness and Knowledge-based Systems 12:19-24.
6. Kohavi, R. 1994. Bottom-up induction of oblivious read-once decision graphs. In Proceedings of the 5th European Conference on Machine Learning. Springer. 154-169.
7. Langley, P.; Iba, W.; and Thomas, K. 1992. An analysis of Bayesian classifiers. In Proceedings of the Tenth National Conference of Artificial Intelligence. AAAI Press. 223-228.
8. Oliver, J. J. 1993. Decision graphs an extension of decision trees. In Proceedings of the Fourth International Workshop on Artificial Intelligence and Statistics.
9. Pagallo, G., and Haussler, D. 1990. Boolean feature discovery in empirical learning. Machine Learning 5(1):71-100.
10. Pearl, J. 1988. Probabilistic reasoning in intelligent systems:networks of plausible inference. Morgan Kauhmann.
11. Provost, F. J., and Domingos, P. 2003. Tree induction for probability-based ranking. Machine Learning 52(3): 199-215.
12. Provost, F.; 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. Morgan Kaufmann. 445-453.
13. Quinlan, J. 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann: San Mateo, CA.
14. Smyth, P.; Gray, A.; and Fayyad, U. 1996. Retrofitting decision tree classifiers using kernel density estimation. In Proceedings of the Twelfth International Conference on Machine Learning. Morgan Kaufmann. 506-514.
15. Webb, G. I.; Boughton, J.; and Wang, Z. 2005. Not so naive bayes: Aggregating one-dependence estimators. Journal of Machine Learning 58(1):5-24.
16. Witten, I. H., and Frank, E. 2000. Data Mining - Practical Machine Learning Tools and Techniques with Java Implementation. Morgan Kaufmann.
17. Zhang, H., and Su, J. 2004. Conditional independence trees. In Proceedings of the 15th European Conference on Machine Learning. Springer. 513-524.