MML inference of decision graphs with multi-way joins and dynamic attributes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2903, Issue , 2003, Pages 269-281

  Tan, Peter J ^a   Dowe, David L ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DECISION TREES; GRAPHIC METHODS; HEURISTIC ALGORITHMS; REDUNDANCY; SUPERVISED LEARNING; DATA REDUCTION; DECISION THEORY; HEURISTIC METHODS; PROBABILITY;

ARTIFICIAL DATA; CLASSIFICATION ACCURACY; DECISION GRAPHS; DYNAMIC ATTRIBUTES; MINIMUM MESSAGE LENGTHS; PREDICTIVE ACCURACY; SEARCH HEURISTICS; SUPERVISED MACHINE LEARNING;

TREES (MATHEMATICS);

DECISION GRAPHS; DECISION TREE; DYNAMIC ATTRIBUTES; MINIMUM MESSAGE LENGTH (MML);

EID: 7444256160     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24581-0_23     Document Type: Conference Paper

References (28)

1. C.L. Blake and C.J. Merz. UCI repository of machine learning databases, 1998. http://www.ics.uci.edu/~mlearn/MLRepository.html.
2. D.L. Dowe, G.E. Farr, A.J. Hurst, and K.L. Lentin. Information-theoretic football tipping. In N. de Mestre, editor, Third Australian Conference on Mathematics and Computers in Sport, pages 233–241. Bond University, Qld, Australia, 1996. http://www.csse.monash.edu.au/~footy.
3. D.L. Dowe and N. Krusel. A decision tree model of bushfire activity. In (Technical report 93/190) Dept Computer Science, Monash University, Clayton, Vic. 3800, Australia, 1993.
4. I.J. Good. Rational Decisions. Journal of the Royal Statistical Society. Series B, 14:107–114, 1952.
5. I.J. Good. Corroboration, Explanation, Evolving Probability, Simplicity, and a Sharpened Razor. British Journal of Philosophy of Science, 19:123–143, 1968.
6. Ron Kohavi. Bottom-up induction of oblivious read-once decision graphs: Strengths and limitations. In National Conference on Artificial Intelligence, pages 613–618, 1994.
7. Yishay Mansour and David McAllester. Boosting using branching programs. In Proc. 13th Annual Conference on Comput. Learning Theory (CoLT), pages 220–224. Morgan Kaufmann, San Francisco, 2000.
8. Manish Mehta, Jorma Rissanen, and Rakesh Agrawal. MDL-based Decision Tree Pruning. In The First International Conference on Knowledge Discovery & Data Mining, pages 216–221. AAAI Press, 1995.
9. S.L. Needham and D.L. Dowe. Message length as an effective Ockham’s razor in decision tree induction. In Proc. 8th International Workshop on Artificial Intelligence and Statistics (AI+STATS 2001), pages 253–260, Key West, Florida, U.S.A., Jan. 2001
10. Julian R. Neil. MML discovery of Causal Models. PhD thesis, Monash University, Clayton 3800, Australia, Computer Science and Software Engineering, 2001.
11. Arlindo L. Oliveira and Alberto L. Sangiovanni-Vincentelli. Using the minimum description length principle to infer reduced ordered decision graphs. Machine Learning, 25(1):23–50, 1996.
12. J.J. Oliver. Decision Graphs - An Extension of Decision Trees. In Proc. 4th International Workshop on Artif. Intelligence and Statistics, pages 343–350, 1993.
13. J.J. Oliver, D.L. Dowe, and C.S. Wallace. Inferring Decision Graphs Using the Minimum Message Length Principle. In Proceedings of the 5th Joint Conference on Artificial Intelligence, pages 361–367. World Scientific, Singapore, 1992.
14. J.J. Oliver and C.S. Wallace. Inferring Decision Graphs. In Workshop 8 International Joint Conference on AI (IJCAI), Sydney, Australia, August 1991
15. C. Perlich, F. Provost, and J.S. Simonoff. Tree induction versus logistic regression: a learning-curve analysis. Journal of Machine Learning Research, 4:211–255, 2003.
16. Foster Provost and Pedro Domingos. Tree induction for probability-based ranking. Machine Learning, 52:199–215, Sept. 2003.
17. J.R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo,CA, 1992. The latest version of C5 is available from http://www.rulequest.com.
18. J.R. Quinlan and R. Rivest. Inferring Decision Trees Using the Minimum Description Length Principle. Information and Computation, 80:227–248, 1989.
19. J.J. Rissanen. Modeling by shortest data description. Automatica, 14:465–471, 1978.
20. P.J. Tan and D.L. Dowe. MML inference of decision graphs with multi-way joins. In Proc. 15th Australian Joint Conf. on AI, LNAI 2557 (Springer), pages 131–142, Canberra, Australia, 2-6 Dec. 2002.
21. W.T.B. Uther and M.M. Veloso. The Lumberjack Algorithm for Learning Linked Decision Tree. In Proc. 6th Pacific Rim International Conf. on Artificial Intel ligence (PRICAI’2000), LNAI 1886 (Springer), pages 156–166, 2000.
22. C.S. Wallace and D.M. Boulton. An Information Measure for Classification. Computer Journal, 11:185–194, 1968.
23. C.S. Wallace and D.M. Boulton. An Invariant Bayes Method for Point Estimation. Classification Society Bull., 3:11–34, 1975.
24. C.S. Wallace and D.L. Dowe. Minimum Message Length and Kolmogorov Complexity. Computer Journal, Special Issue - Kolmogorov Complexity, 42(4):270–283, 1999.
25. C.S. Wallace and D.L. Dowe. MML Clustering of multi-state, Poisson, von Mises circular and Gaussian distributions. Statistics and Computing, 10(1):73–83, Jan 2000.
26. C.S. Wallace and P.R. Freeman. Estimation and Inference by Compact Coding. Journal of the Royal Statistical Society. Series B, 49(3):240–265, 1987.
27. C.S Wallace and J.D. Patrick. Coding Decision Trees. Machine Learning, 11:7–22, 1993.
28. Xiaoxin Yin and Jiawei Han. CPAR: Classification based on predictive association rules. In SIAM International Conference on Data MiningSan Francisco, CA, USA, May. 2003.