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

More documents

Recommendations

Info

Technion - Computer Science Department - Ph.D. Thesis PHD-2008-12 - 2008 Theory (COLT-2000), pp. 69–74, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc. Margineantu, D. (2005). Active cost-sensitive learning. In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-2005), Edinburgh, Scotland. Markovitch, S., & Rosenstein, D. (2002). Feature generation using general constructor functions. Machine Learning, 49, 59–98. McAllester, D. (1998). Some PAC-bayesian theorems. In Proceedings of the 11th annual conference on Computational learning theory (COLT-1998), pp. 230–234, New York, NY, USA. ACM. Melville, P., Saar-Tsechansky, M., Provost, F., & Mooney, R. J. (2004). Active feature acquisition for classifier induction. In Proceedings of the 4th IEEE International Conference on Data Mining (ICDM-2004), pp. 483– 486, Brighton, UK. Mingers, J. (1989). An empirical comparison of selection measures for decisiontree induction. Machine Learing, 3(4), 319–342. Minton, S., Johnston, M. D., Philips, A. B., & Laird, P. (1992). Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58(1-3), 161–205. Mitchell, T. M. (1982). Generalization as search. Artificial Intelligence, 18, 203– 226. Mitchell, T. M. (1997). Machine Learning. McGraw Hill. Murphy, O. J., & McCraw, R. L. (1991). Designing storage efficient decision trees. IEEE Transactions on Computers, 40(3), 315–320. Murphy, P. M., & Pazzani, M. J. (1994). Exploring the decision forest: an empirical investigation of Occam’s Razor in decision tree induction. Journal of Artificial Intelligence Research, 1, 257–275. Murthy, S., Kasif, S., & Salzberg, S. (1994). A system for induction of oblique decision trees. Journal of Artificial Intelligence Research, 2, 1–32. Murthy, S. K., & Salzberg, S. (1995). Lookahead and pathology in decision tree induction. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-1995), pp. 1025–1033, Montreal, Canada. Nijssen, S., & Fromont, E. (2007). Mining optimal decision trees from itemset lattices. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD-2007), pp. 530–539, New York, NY, USA. ACM. 162
Technion - Computer Science Department - Ph.D. Thesis PHD-2008-12 - 2008 Norton, S. W. (1989). Generating better decision trees. In Sridharan, N. S. (Ed.), Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pp. 800–805, Detroit, Michigan, USA. Nunez, M. (1991). The use of background knowledge in decision tree induction. Machine Learning, 6, 231–250. Oates, T., & Jensen, D. (1997). The effects of training set size on decision tree complexity. In Proceedings of the 14th International Conference on Machine Learning (ICML-1997), pp. 254–262. Morgan Kaufmann. Opitz, D. W. (1995). An Anytime Approach to Connectionist Theory Refinement: Refining the Topologies of Knowledge-Based Neural Networks. Ph.D. thesis, Department of Computer Sciences, University of Wisconsin-Madison. Page, D., & Ray, S. (2003). Skewing: An efficient alternative to lookahead for decision tree induction. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-2003), Acapulco, Mexico. Page, D., & Ray, S. (2004). Sequential skewing: an improved skewing algorithm. In Proceedings of the 21st International Conference on Machine Learning (ICML-2004), Banff, Alberta, Canada. Papagelis, A., & Kalles, D. (2001). Breeding decision trees using evolutionary techniques. In Proceedings of the 18th International Conference on Machine Learning (ICML-2001), pp. 393–400, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc. Pazzani, M., Merz, C., Murphy, P., Ali, K., Hume, T., & Brunk, C. (1994). Reducing misclassification costs: knowledge intensive approaches to learning from noisy data. In Proceedings of the 11th International Conference on Machine Learning (ICML-1994). Provost, F., & Buchanan, B. (1995). Inductive policy: The pragmatics of bias selection. Machine Learning, 20(1-2), 35–61. Provost, F., Melville, P., & Saar-Tsechansky, M. (2007). Data acquisition and cost-effective predictive modeling: targeting offers for electronic commerce. In Proceedings of the 9th International Conference on Electronic Commerce (ICEC-2007), pp. 389–398, New York, NY, USA. ACM. Quinlan, J. R. (1993). C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA. Quinlan, J. R., & Cameron-Jones, R. M. (1995). Oversearching and layered search in empirical learning. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-1995), pp. 1019–1024. 163
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:
Page 127 and 128: Technion - Computer Science Departm
Page 177: 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?