anytime algorithms for learning anytime classifiers saher ... - Technion
anytime algorithms for learning anytime classifiers saher ... - Technion
anytime algorithms for learning anytime classifiers saher ... - Technion
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
<strong>Technion</strong> - Computer Science Department - Ph.D. Thesis PHD-2008-12 - 2008<br />
Dietterich, T. G. (2000). An experimental comparison of three methods <strong>for</strong> constructing<br />
ensembles of decision trees: Bagging, boosting, and randomization.<br />
Machine Learning, 40(2), 139–157.<br />
Dobkin, D., Gunopulos, D., & Kasif, S. (1996). Computing optimal shallow decision<br />
trees. In Proceedings of the 4th International Symposium on Artificial<br />
Intelligence and Mathematics (ISAIM-1996).<br />
Domingos, P. (1999a). The role of Occam’s razor in knowledge discovery. Data<br />
Mining and Knowledge Discovery, 3(4), 409–425.<br />
Domingos, P. (1999b). Metacost: A general method <strong>for</strong> making <strong>classifiers</strong> costsensitive.<br />
In Proceedings of the 5th International Conference on Knowledge<br />
Discovery and Data Mining (KDD’1999), pp. 155–164.<br />
Dong, M., & Kothari, R. (2001). Look-ahead based fuzzy decision tree induction.<br />
IEEE-FS, 9, 461–468.<br />
Dougherty, J., Kohavi, R., & Sahami, M. (1995). Supervised and unsupervised<br />
discretization of continuous features. In Proceedings of the 12th International<br />
Conference on Machine Learning (ICML-1995), pp. 194–202, Tahoe<br />
City, Cali<strong>for</strong>nia, USA.<br />
Drummond, C., & Holte, R. (2000). Exploiting the cost (in)sensitivity of decision<br />
tree splitting criteria. In In Proceedings of the 17th International Conference<br />
on Machine Learning (ICML-2000), pp. 239–246. Morgan Kaufmann.<br />
Elkan, C. (2001). The foundations of cost-sensitive <strong>learning</strong>. In Proceedings of<br />
the 17th International Joint Conference on Artificial Intelligence (IJCAI-<br />
2001), pp. 973–978, Seattle, Washington, USA.<br />
Elomaa, T. (1994). In defense of c4.5: Notes on <strong>learning</strong> one-level decision trees.<br />
In In Proceedings of the 11th International Conference on Machine Learning<br />
(ICML-1994), pp. 62–69. Morgan Kaufmann.<br />
Esmeir, S., & Markovitch, S. (2004). Lookahead-based <strong>algorithms</strong> <strong>for</strong> <strong>anytime</strong><br />
induction of decision trees. In Proceedings of the 21st International Conference<br />
on Machine Learning (ICML-2004).<br />
Esmeir, S., & Markovitch, S. (2006). When a decision tree learner has plenty of<br />
time. In Proceedings of the 21st National Conference on Artificial Intelligence<br />
(AAAI-2006), Boston, MA, USA.<br />
Esmeir, S., & Markovitch, S. (2007a). Anytime induction of cost-sensitive trees.<br />
In Proceedings of The 21st Annual Conference on Neural In<strong>for</strong>mation Processing<br />
Systems (NIPS-2007), Vancouver, B.C., Canada.<br />
Esmeir, S., & Markovitch, S. (2007b). Anytime <strong>learning</strong> of decision trees. Journal<br />
of Machine Learning Research, 8.<br />
158