Robert Holte

Home * People * Robert Holte

Robert Holte[1] Robert C. Holte,

a Canadian computer scientist and professor emeritus at the University of Alberta. He holds a B.Sc. (1977) and M.Sc. (1980) in Computer Science from University of Manitoba, and a Ph.D. from Brunel University London [2]. His research interests include machine learning, games of chance, especially Poker, and abstraction and search, in particular A* based algorithms in pathfinding. Robert Holte was member of the University of Alberta Computer Poker Research Group (CPRG) [3] .

1990 …#

• Bruce W. Porter, Ray Bareiss, Robert Holte (1990). Concept Learning and Heuristic Classification in Weak Theory Domains. Artificial Intelligence, Vol. 45, No. 1-2
• Robert Holte (1993). Very Simple Classification Rules Perform Well on Most Commonly Used Datasets. Machine Learning, Vol. 11

1995 …#

• Peter Auer, Robert Holte, Wolfgang Maass (1995). Theory and Applications of Agnostic PAC-Learning with Small Decision Trees. ICML 1995
• Miroslav Kubat, Robert Holte, Stan Matwin (1997). Learning When Negative Examples Abound. ECML 1997
• Miroslav Kubat, Robert Holte, Stan Matwin (1998). Machine Learning for the Detection of Oil Spills in Satellite Radar Images. Machine Learning, Vol. 30
• Robert Holte, István T. Hernádvölgyi (1999). A Space-Time Tradeoff for Memory-Based Heuristics. AAAI/IAAI 1999

2000 …#

• Chris Drummond, Robert Holte (2000). Exploiting the Cost (In)sensitivity of Decision Tree Splitting Criteria. ICML 2000, pdf
• Chris Drummond, Robert Holte (2000). Explicitly representing expected cost: An alternative to ROC representation. KDD 2000, pdf [6]
• István T. Hernádvölgyi, Robert Holte (2000). Experiments with Automatically Created Memory-Based Heuristics. SARA 2000
• Robert Holte (2001). Combinatorial Auctions, Knapsack Problems, and Hill-Climbing Search. Canadian Conference on AI 2001
• Chris Drummond, Robert Holte (2003). C4.5, Class Imbalance, and Cost Sensitivity: Why Under-Sampling beats Over-Sampling. ICML 2003 Workshop on Learning from Imbalanced Data Sets (II), pdf [7]
• Yngvi Björnsson, Markus Enzenberger, Robert Holte, Jonathan Schaeffer, Peter Yap (2003). Comparison of Different Grid Abstractions for Pathfinding on Maps. IJCAI 2003, pdf
• Darse Billings, Neil Burch, Aaron Davidson, Robert Holte, Jonathan Schaeffer, Terence Schauenberg, Duane Szafron (2003). Approximating Game-Theoretic Optimal Strategies for Full-scale Poker. IJCAI 2003, pdf
• Darse Billings, Aaron Davidson, Terence Schauenberg, Neil Burch, Michael Bowling, Robert Holte, Jonathan Schaeffer, Duane Szafron (2004). Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games. CG 2004

2005 …#

• Yngvi Björnsson, Markus Enzenberger, Robert Holte, Jonathan Schaeffer (2005). Fringe Search: Beating A* at Pathfinding on Game Maps. CIG 2005, pdf
• Ariel Felner, Uzi Zahavi, Jonathan Schaeffer, Robert Holte (2005). Dual Lookups in Pattern Databases. IJCAI 2005, pdf
• Uzi Zahavi, Ariel Felner, Robert Holte, Jonathan Schaeffer (2006). Dual Search in Permutation State Spaces. AAAI 2006, pdf
• Chris Drummond, Robert Holte (2006). Cost Curves: An Improved Method for Visualizing Classifier Performance. Machine Learning, Vol. 65, No. 1, pdf
• Ariel Felner, Richard Korf, Ram Meshulam, Robert Holte (2007). Compressed Pattern Databases. JAIR, Vol. 30, pdf
• Uzi Zahavi, Ariel Felner, Robert Holte, Jonathan Schaeffer (2008). Duality in Permutation State Spaces and the Dual Search Algorithm. Artificial Intelligence, Vol. 172, pdf
• Fan Yang, Joe Culberson, Robert Holte, Uzi Zahavi, Ariel Felner (2008). A General Theory of Additive State Space Abstractions. JAIR, Vol. 32, arXiv:1111.0067

2010 …#

• Robert Holte, Jonathan Schaeffer, Ariel Felner (2010). Mechanical Generation of Admissible Heuristics. Chapter 3 in Heuristics, Probability, and Causality: A Tribute to Judea Pearl, edited by Rina Dechter, Hector Geffner, Joseph Y. Halpern, pdf
• Uzi Zahavi, Ariel Felner, Neil Burch, Robert Holte (2010). Predicting the Performance of IDA* using Conditional Distributions. JAIR, Vol. 37, arXiv:1401.3493v1 [8]
• Ariel Felner, Uzi Zahavi, Robert Holte, Jonathan Schaeffer, Nathan Sturtevant, Zhifu Zhang (2011). Inconsistent Heuristics in Theory and Practice. Artificial Intelligence, Vol. 175, pdf
• Roni Stern, Ariel Felner, Robert Holte (2011). Probably Approximately Correct Heuristic Search. SOCS 2011
• Meir Goldenberg, Ariel Felner, Roni Stern, Guni Sharon, Nathan Sturtevant, Robert Holte, Jonathan Schaeffer (2014). Enhanced Partial Expansion A*. JAIR, Vol. 50

2015#

• Jingwei Chen, Robert Holte, Sandra Zilles, Nathan Sturtevant (2017). Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansion. IJCAI 2017, arXiv:1703.03868, pdf
• Mehdi Sadeqi, Robert Holte, Sandra Zilles (2017). An Empirical Study of the Effects of Spurious Transitions on Abstraction-based Heuristics. arXiv:1711.05105
• Robert Holte, Ruben Majadas, Alberto Pozanco, Daniel Borrajo (2019). Error Analysis and Correction for Weighted A*’s Suboptimality. SOCS 2019, arXiv:1905.11346 (Extended Version)

External Links#

• Dr. Robert Holte
• Robert Holte - Google Scholar Citations
• Robert Holte - The Mathematics Genealogy Project
• Robert Holte at Judea Pearl Symposium, 2010, YouTube Video

References#

1. ↑ Robert Holte
2. ↑ Robert Holte - Personal Information (pdf)
3. ↑ CPRG Past Members
4. ↑ Rob Holte - Publications
5. ↑ dblp: Robert C. Holte
6. ↑ Receiver operating characteristic from Wikipedia
7. ↑ C4.5 algorithm from Wikipedia » Ross Quinlan
8. ↑ Iterative deepening A* from Wikipedia

Up one level