anytime algorithms for learning anytime classifiers saher ... - Technion
anytime algorithms for learning anytime classifiers saher ... - Technion
anytime algorithms for learning anytime classifiers saher ... - Technion
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
<strong>Technion</strong> - Computer Science Department - Ph.D. Thesis PHD-2008-12 - 2008<br />
Sheng, V. S., & Ling, C. X. (2007a). Partial example acquisition in cost-sensitive<br />
<strong>learning</strong>. In Proceedings of the 13th ACM SIGKDD international conference<br />
on Knowledge discovery and data mining (KDD-2007), pp. 638–646, San<br />
Jose, Cali<strong>for</strong>nia, USA.<br />
Sheng, V. S., & Ling, C. X. (2007b). Roulette sampling <strong>for</strong> cost-sensitive <strong>learning</strong>.<br />
In Proceedings of the 18th European Conference on Machine Learning<br />
(ECML-2007), pp. 724–731, Warsaw, Poland.<br />
Tan, M., & Schlimmer, J. C. (1989). Cost-sensitive concept <strong>learning</strong> of sensor<br />
use in approach and recognition. In Proceedings of the 6th International<br />
Workshop on Machine Learning, pp. 392–395, Ithaca, NY.<br />
Turney, P. (2000). Types of cost in inductive concept <strong>learning</strong>. In Proceedings of<br />
the Workshop on Cost-Sensitive Learning held with the 17th International<br />
Conference on Machine Learning (ICML-2000), Stan<strong>for</strong>d, CA.<br />
Turney, P. D. (1995). Cost-sensitive classification: Empirical evaluation of a hybrid<br />
genetic decision tree induction algorithm. Journal of Artificial Intelligence<br />
Research, 2, 369–409.<br />
Ueno, K., Xi, X., Keogh, E., & Lee, D. (2006). Anytime classification using the<br />
nearest neighbor algorithm with applications to stream mining. In Proceedings<br />
of the 6th IEEE International Conference on Data Mining (ICDM-<br />
2006), pp. 623–632, Washington, DC, USA.<br />
Utgoff, P. E. (1989). Incremental induction of decision trees. Machine Learning,<br />
4(2), 161–186.<br />
Utgoff, P. E., Berkman, N. C., & Clouse, J. A. (1997). Decision tree induction<br />
based on efficient tree restructuring. Machine Learning, 29(1), 5–44.<br />
Vadera, S. (2005). Inducing cost-sensitive non-linear decision trees. Technical report<br />
03-05-2005, School of Computing, Science and Engineering, University<br />
of Sal<strong>for</strong>d.<br />
Vapnik, M. A. (1995). The Nature of Statistical Learning Theory. New York:<br />
Springer-Verlag.<br />
Wallace, R. J., & Freuder, E. C. (1995). Anytime <strong>algorithms</strong> <strong>for</strong> constraint satisfaction<br />
and SAT problems. In Working Notes of IJCAI-95 Workshop on<br />
Anytime Algorithms and Deliberation Scheduling.<br />
Webb, G. I. (1996). Further experimental evidence against the utility of Occam’s<br />
Razor. Journal of Artificial Intelligence Research, 4, 397–417.<br />
Witten, I. H., & Frank, E. (2005). Data Mining: Practical machine <strong>learning</strong> tools<br />
and techniques. Morgan Kaufmann, San Francisco, CA.<br />
165