Learning first order logic time series classifiers: Rules and boosting *

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1910, Issue , 2000, Pages 299-308

  Rodŕguez, Juan J ^a   Alonso, Carlos J ^a   Boström, Henrik ^b  

^a UNIVERSITY OF VALLADOLID   (Spain)

^b STOCKHOLM UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; DATA MINING; FORMAL LOGIC; TIME SERIES;

DISTANCE-BASED; EUCLIDEAN DISTANCE; FIRST ORDER LOGIC; MULTIVARIATE TIME SERIES; TOPDOWN;

INDUCTIVE LOGIC PROGRAMMING (ILP);

EID: 84974705046     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45372-5_29     Document Type: Conference Paper

References (19)

1. th Hellenic Conference on Informatics, Ioannina, Greece, 1999.
2. C.J. Alonso and J.J. Rodríguez. A graphical rule language for continuous dynamic systems. In Computational Intelligence for Modelling, Control and Automation, CIMCA-99. IOS Press, 1999.
3. E. Bauer and R. Kohavi. An empirical comparison of voting classification algorithms: Bagging, boosting and variants. Machine Learning, 36(1/2), 1999.
4. S.D. Bay. The UCI KDD archive, 1999. http://kdd.ics.uci.edu/.
5. F. Bergadano and D. Gunetti. Inductive Logic Programming: from machine learning to software engineering. The MIT Press, 1995.
6. D.J. Berndt and J. Clifford. Finding patterns in time series: a dynamic programming approach. In U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining. AAAI Press / MIT Press, 1996.
7. C.L. Blake and C.J. Merz. UCI repository of machine learning databases, 1998. http://www.ics.uci.edu/~mlearn/MLRepository.html.
8. H. Blockeel and L. De Raedt. Lookahead and discretization in ILP. In 7th International Workshop on Inductive Logic Programming, ILP’97. Springer, 1997.
9. L. Breiman, J.H. Friedman, A. Olshen, and C.J. Stone. Classification and Regression Trees. Chapman & Hall, New York, 1993.
10. W.W. Cohen and Y. Singer. A simple, fast, and effective rule learner. In 16th National Conference on Artificial Intelligence, AAAI-99, 1999.
11. T.G. Dietterich. An experimental comparison of three methods for constructing ensembles of decision trees: bagging, boosting, and randomization. Machine Learning, 1999.
12. M.W. Kadous. Learning comprehensible descriptions of multivariate time series. In 16th International Conference of Machine Learning (ICML-99). Morgan Kaufmann, 1999.
13. M. Kubat, I. Koprinska, and G. Pfurtscheller. Learning to classify biomedical signals. In R.S. Michalski, I. Bratko, and M. Kubat, editors, Machine Learning and Data Mining. John Wiley & Sons, 1998.
14. R.J. Mooney and M.E. Califf. Induction of first-order decision lists: results on learning the past tense of english verbs. JAIR, 3, 1995.
15. J.R. Quinlan. Boosting first-order learning. In S. Arikawa and A. Sharma, editors, Algorithmic Learning Theory, 7th International Workshop, ALT’96. Springer, 1996.
16. R.E. Schapire. Using output codes to boost multiclass learning problems. In 14th International Conference on Machine Learning (ICML-97), 1997.
17. R.E. Schapire. A brief introduction to boosting. In 16th International Joint Conference on Artificial Intelligence (IJCAI-99). Morgan Kaufmann, 1999.
18. A. Srinivasan and R.C. Camacho. Numerical reasoning with an ILP system capable of lazy evaluation and customized search. Journal of Logic Programming, 40(2-3), 1999.
19. W. Van Laer, L. De Raedt, and S. Dzeroski. On multi-class problems and discretization in inductive logic programming. In 10th International Symposium on Methodologies for Intelligent Systems (ISMIS97). Springer, 1997.