Max Chickering
Revision as of 16:23, 5 September 2018 by GerdIsenberg (talk | contribs)
Home * People * Max Chickering
Max Chickering [1]
David Maxwell (Max) Chickering,
an American computer scientist and Microsoft employee working in Microsoft Live Labs and formerly as member of the Machine Learning and Applied Statistics (MLAS) group of Microsoft Research. He received his Ph.D. in computer science from the University of California, Los Angeles. His research interests covers search algorithms and practical applications of machine-learning algorithms.
Contents
Selected Publications
1990 ...
- Richard Korf, Max Chickering (1993). Best-first Minimax Search: First Results. AAAI-93, pdf
- Richard Korf, Max Chickering (1994). Best-first minimax search: Othello results. AAAI-94, pdf
- David Heckerman, Dan Geiger, Max Chickering (1995). Learning Bayesian Networks: The Combination of Knowledge and Statistical Data. Machine Learning, Vol. 20, pdf
- Max Chickering, Dan Geiger, David Heckerman (1995). On finding a cycle basis with a shortest maximal cycle. Information Processing Letters, Vol. 54, pdf
- Richard Korf, Max Chickering (1996). Best-first minimax search. Artificial Intelligence, Vol. 84, No 1-2
- Max Chickering, David Heckerman (1997). Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables. pdf
2000 ...
- David Maxwell Chickering (2002). Learning Equivalence Classes of Bayesian-Network Structures. Journal of Machine Learning Research, Vol. 2
- David Maxwell Chickering (2002). Optimal Structure Identification With Greedy Search. Journal of Machine Learning Research, Vol. 3
2010 ...
- Denis Xavier Charles, Max Chickering, Nikhil R. Devanur, Kamal Jain, Manan Sanghi (2010). Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads. ACM Conference on Electronic Commerce 2010, pdf
- Christopher Meek, David Maxwell Chickering (2012). Practically Perfect. arXiv:1212.2503
