Towards tight bounds for rule learning

Proceedings, Twenty-First International Conference on Machine Learning, ICML 2004

Volumn , Issue , 2004, Pages 711-718

  Rückert, Ulrich ^a   Kramer, Stefan ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR ANALYSIS; LEARNING ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; PERTURBATION TECHNIQUES; RANDOM PROCESSES; VECTORS;

RULE LEARNING; RULE LEARNING APPROACHES; SET COVERING MACHINE; TIGHT BOUNDS;

LEARNING SYSTEMS;

EID: 14344263324     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Blake, C., & Merz, C. (1998). UCI repository of machine learning databases.
2. Breiman, L. (2001). Random forests. Machine Learning, 45, 5-32.
3. Cohen, W., & Singer, Y. (1999). A simple, fast, and effective rule learner. Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99) (pp. 335-342). AAAI Press.
4. Cohen, W. W. (1995). Fast effective rule induction. Proc. 12th International Conf. on Machine Learning (pp. 115-123). Morgan Kaufmann.
5. Frank, E., & Witten, I. H. (1998). Generating accurate rule sets without global optimization. Proc. 15th International Conf. on Machine Learning (pp. 144-151). Morgan Kaufmann.
6. Golea, M., Bartlett, P., Lee, W. S., & Mason, L. (1998). Generalization in decision trees and DNF: Does size matter? Advances in Neural Information Processing Systems. The MIT Press.
7. Hoos, H. H. (1998). Stochastic local search - methods, models, applications. Doctoral dissertation, TU Darmstadt.
8. Kearns, M. J., & Vazirani, U. V. (1994). An introduction to computational learning theory. Cambridge, MA: The MIT Press.
9. Littlestone, N., & Warmuth, M. K. (1994). The weighted majority algorithm. Information and Computation, 108, 212-261.
10. Mansour, Y., & McAllester, D. (2000). Generalization bounds for decision trees. Proc. 13th Annu. Conference on Comput. Learning Theory (pp. 69-80). Morgan Kaufmann.
11. Marchand, M., Shah, M., Shawe-Taylor, J., & Sokolova, M. (2003). The set covering machine with data-dependent half-spaces. Proc. 20th International Conf. on Machine Learning (pp. 520-527). Morgan Kaufmann.
12. Marchand, M., & Shawe-Taylor, J. (2001). Learning with the set covering machine. Proc. 18th International Conf. on Machine Learning (pp. 345-352). Morgan Kaufmann.
13. McAllester (1999). PAC-bayesian model averaging. COLT: Proceedings of the Workshop on Computational Learning Theory. Morgan Kaufmann.
14. Pfahringer, B., Holmes, G., & Kirkby, R. (2001). Optimizing the induction of alternating decision trees. Proceedings of the Fith Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining (PAKDD2001) (pp. 477-487).
15. Rücken, U., & Kramer, S. (2003). Stochastic local search in k-term DNF learning. Proc. 20th International Conf. on Machine Learning (pp. 648-655). AAAI Press.
16. Sokolova, M., Marchand, M., Japkowicz, N., & Shawe-Taylor, J. (2003). The decision list machine. Advances in Neural Information Processing Systems 15 (pp. 921-928). MIT-Press, Cambridge, MA, USA.
17. Weiss, S., & Indurkhya, N. (2000). Lightweight rule induction. Proc. 17th International Conf. on Machine Learning (pp. 1135-1142). Morgan Kaufmann.
18. Witten, I. H., & Frank, E. (1999). Data mining: Practical machine learning tools and techniques with Java implementations. Morgan Kaufmann, hardcopy.