anytime algorithms for learning anytime classifiers saher ... - Technion

More documents

Recommendations

Info

Technion - Computer Science Department - Ph.D. Thesis PHD-2008-12 - 2008 Holte, R. (1993). Very simple classification rules perform well on most commonly used datasets. Machine Learning, 11(1), 63–90. Horvitz, E. (1990). Computation and Action under Bounded Resources. Ph.D. thesis, Computer Science Department, Stanford University. Hyafil, L., & Rivest, R. L. (1976). Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1), 15–17. Jakulin, A., & Bratko, I. (2003). Analyzing attribute dependencies. In Proceedings of the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD-2003), pp. 229–240. Springer-Verlag. John, G. H., Kohavi, R., & Pfleger, K. (1994). Irrelevant features and the subset selection problem. In Proceedings of the 11th International Conference on Machine Learning (ICML-1994), pp. 121–129. Johnson, D., Aragon, C., McGeoch, L., & Schevon, C. (1991). Optimization by simulated annealing: An experimental evaluation; part ii, graph coloring and number partitioning. Operations Research, 39(3), 378–406. Kaplan, H., Kushilevitz, E., & Mansour, Y. (2005). Learning with attribute costs. In Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (STOC-2005), pp. 356–365, New York, NY, USA. ACM. Kapoor, A., & Greiner, R. (2005). Learning and classifying under hard budgets. In Proceedings of the 9th European Conference on Machine Learning (ECML- 2005), pp. 170–181. Kearns, M., & Mansour, Y. (1996). On the boosting ability of top-down decision tree learning algorithms. In Proceedings of the 28th annual ACM symposium on Theory of computing (STOC-1996), pp. 459–468, New York, NY, USA. ACM. Kearns, M., & Mansour, Y. (1998). A fast, bottom-up decision tree pruning algorithm with near-optimal generalization. In Proceedings of the 15th International Conference on Machine Learning (ICML-1998), pp. 269–277. Morgan Kaufmann, San Francisco, CA. Kim, H., & Loh, W. (2001). Classification trees with unbiased multiway splits. Journal of the American Statistical Association, 96, 589–604. Kononenko, I. (2001). Machine learning for medical diagnosis: history, state of the art and perspective.. Artificial Intelligence in Medicine, 23(1), 89–109. Kononenko, I., & Kovacic, M. (1992). Learning as optimization: Stochastic generation of multiple knowledge. In Proceedings of the 9th International Conference on Machine Learning (ICML-1992), pp. 257–262, Aberdeen, Scotland, UK. 160
Technion - Computer Science Department - Ph.D. Thesis PHD-2008-12 - 2008 Kononenko, I., Simec, E., & Robnik-Sikonja, M. (1997). Overcoming the myopia of inductive learning algorithms with relieff. Applied Intelligence, 7(1), 39– 55. Konur, S., Ferrein, A., & Lakemeyer, G. (2004). Learning decision trees for action selection in soccer agents. In Workshop on Agents in dynamic and real-time environments, with ECAI’04. Kushilevitz, E., & Mansour, Y. (1993). Learning decision trees using the fourier spectrum. SIAM Journal of Computing, 22(6), 1331–1348. Lachiche, N., & Flach, P. (2003). Improving accuracy and cost of two-class and multi-class probabilistic classifiers using roc curves. In Proceedings of the 20th International Conference on Machine Learning (ICML-2003). Last, M., Kandel, A., Maimon, O., & Eberbach, E. (2001). Anytime algorithm for feature selection. In Proceedings of the 2nd International Conference on Rough Sets and Current Trends in Computing (RSCTC-2001), pp. 532–539. Springer-Verlag. Lenert, L., & Soetikno, R. (1997). Automated computer interviews to elicit utilities: Potential applications in the treatment of deep venous thrombosis. American Medical Informatics Association, 4(1), 49–56. Lindenbaum, M., Markovitch, S., & Rusakov, D. (2004). Selective sampling for nearest neighbor classifiers. Machine Learning, 54(2), 125–152. Ling, C. X., Yang, Q., Wang, J., & Zhang, S. (2004). Decision trees with minimal costs. In Proceedings of the 21st International Conference on Machine Learning (ICML-2004). Lizotte, D. J., Madani, O., & Greiner, R. (2003). Budgeted learning of naive bayes classifiers. In Proceedings of the 19th Conference on Uncertainty in Artificial Intelligence (UAI-2003), Acapulco, Mexico. Loh, W., & Shih, Y. (1997). Split selection methods for classification trees. Statistica Sinica, 7, 815–840. Madani, O., Lizotte, D. J., & Greiner, R. (2004). Active model selection. In Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence (UAI-2004), Banff, Canada. Mansour, Y. (1997). Pessimistic decision tree pruning based continuous-time. In Proceedings of the 14th International Conference on Machine Learning (ICML-1997), pp. 202–210, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc. Mansour, Y., & McAllester, D. (2000). Generalization bounds for decision trees. In Proceedings of the 13th Annual Conference on Computational Learning 161
Page 1 and 2:
Technion - Computer Science Departm
Page 3 and 4:
Page 5 and 6:
Page 7 and 8:
Page 9 and 10:
Page 11 and 12:
Page 13 and 14:
Page 15 and 16:
Page 17 and 18:
Page 19 and 20:
Page 21 and 22:
Page 23 and 24:
Page 25 and 26:
Page 27 and 28:
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
Page 35 and 36:
Page 37 and 38:
Page 39 and 40:
Page 41 and 42:
Page 43 and 44:
Page 45 and 46:
Page 47 and 48:
Page 49 and 50:
Page 51 and 52:
Page 53 and 54:
Page 55 and 56:
Page 57 and 58:
Page 59 and 60:
Page 61 and 62:
Page 63 and 64:
Page 65 and 66:
Page 67 and 68:
Page 69 and 70:
Page 71 and 72:
Page 73 and 74:
Page 75 and 76:
Page 77 and 78:
Page 79 and 80:
Page 81 and 82:
Page 83 and 84:
Page 85 and 86:
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
Page 113 and 114:
Page 115 and 116:
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
Page 125 and 126: Technion - Computer Science Departm
Page 175: Technion - Computer Science Departm
show all

anytime algorithms for learning anytime classifiers saher ... - Technion

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?