Due to the wide availability of huge data collection comprising multiple sequences that evolve over time, the process of adapting the classical data-mining techniques, making them capable to work into this new context, becomes today a strong necessity. In [1] we proposed a methodology permitting the application of a classification tree on sequential raw data and the extraction of the rules having a temporal dimension. In this article, we propose a formalism based on temporal first logic-order and we review the main steps of the methodology through this theoretical frame. Finally, we present some solutions for a practical implementation. © 2002 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Cotofrei, P., & Stoffel, K. (2002). Classification rules + time = temporal rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2329 LNCS, pp. 572–581). Springer Verlag. https://doi.org/10.1007/3-540-46043-8_58
Mendeley helps you to discover research relevant for your work.