We study the problem of mining informative (association) rule set for prediction over data streams. On dense datasets and low minimum support threshold, the generating of informative rule set does not use all mined frequent itemsets (FIs). Therefore, we will waste a portion of FIs if we run existing algorithms for finding FIs from data streams as the first stage to mine informative rule set. We propose an algorithm for mining informative rule set directly from data streams over a sliding window. Our experiments show that our algorithm not only attains high accurate results but also out performs the two-stage process, find FIs and then generate rules, of mining informative rule set. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Nhan, N. D., Hung, N. T., & Bac, L. H. (2010). Mining informative rule set for prediction over a sliding window. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5991 LNAI, pp. 431–440). https://doi.org/10.1007/978-3-642-12101-2_44
Mendeley helps you to discover research relevant for your work.