Finding recently frequent itemsets adaptively over online transactional data streams,

Information Systems

Volumn 31, Issue 8, 2006, Pages 849-869

  Chang, Joong Hyuk ^a   Lee, Won Suk ^a  

^a Yonsei University   (South Korea)

Author keywords

Data streams; Decay rate; Delayed insertion; Information decay; Itemset pruning; Lexicographic tree; Recently frequent itemsets

Indexed keywords

ALGORITHMS; DATA ACQUISITION; DATA MINING; EMBEDDED SYSTEMS; GRAPH THEORY; OPTIMIZATION;

DECAY RATE; DELAYED INSERTION; INFORMATION DECAY; LEXICOGRAPHIC TREE; RECENTLY FREQUENT ITEMSETS;

ONLINE SYSTEMS;

EID: 33748676847     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2005.04.001     Document Type: Article

References (26)

1. M.N. Garofalakis, J. Gehrke, R. Rastogi, Querying and mining data streams: you only get one look, The Tutorial Notes of the 28th International Conference on Very Large Data Bases, 2002.
2. Charikar M., Chen K., and Farach-Colton M. Finding frequent items in data streams. Theoret. Comput. Sci. 312 1 (2004) 3-15
3. Datar M., Gionis A., Indyk P., and Motwani R. Maintaining stream statistics over sliding windows. SIAM J. Comput. 31 6 (2002) 1794-1813
4. Domingos P., and Hulten G. Mining high-speed data streams. Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2000) 71-80
5. Guha S., and Koudas N. Approximating a data stream for querying and estimation: algorithms and performance evaluation. Proceedings of the 18th International Conference on Data Engineering (2002) 567-576
6. Hulten G., Spencer L., and Domingos P. Mining time-changing data streams. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2001) 97-106
7. Lambert D., and Pinheiro J.C. Mining a stream of transactions for customer patterns. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2001) 305-310
8. Manku G.S., and Motwani R. Approximate frequency counts over data streams. Proceedings of the 28th International Conference on Very Large Data Bases (2002) 346-357
9. Qiao L., Agrawal D., and Abbadi A.E. RHist: adaptive summarization over continuous data streams. Proceedings of the 11th International Conference on Information and Knowledge Management (2002) 469-476
10. Aumann Y., Feldman R., Lipshtat O., and Manilla H. Borders: an efficient algorithm for association generation in dynamic databases. J. Intell. Inform. Syst. 12 1 (1999) 61-73
11. Ganti V., Gehrke J., and Ramakrishnan R. DEMON: mining and monitoring evolving data. IEEE Trans. Knowl. Data Eng. 13 1 (2001) 50-63
12. G. Dong, J. Han, L.V.S. Lakshmanan, J. Pei, H. Wang, P.S. Yu, Online mining of changes from data streams: research problems and preliminary results, Proceedings of the Workshop on Management and Processing of Data Streams, 2003.
13. Lee C.-H., Lin C.-R., and Chen M.-S. Sliding-window filtering: an efficient method for incremental mining on a time variant database. Inform. Syst. 30 3 (2005) 227-244
14. Agarwal R.C., Aggarwal C.C., and Prasad V.V.V. A tree projection algorithm for generation of frequent itemsets. J. Parallel Distrib. Comput. 61 3 (2001) 350-371
15. Brin S., Motwani R., Ullman J.D., and Tsur S. Dynamic itemset counting and implication rules for market basket data. Proceedings of the ACM SIGMOD International Conference on Management of Data (1997) 255-264
16. Wang J., and Han J. BIDE: efficient mining of frequent closed sequences. Proceedings of the 20th International Conference on Data Engineering (2004) 79-90
17. Agrawal R., and Srikant R. Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (1994) 487-499
18. Savasere A., Omiecinski E., and Navathe S.B. An efficient algorithm for mining association rules in large databases. Proceedings of the 21st International Conference on Very Large Data Bases (1995) 432-444
19. Hidber C. Online association rule mining. Proceedings of the ACM SIGMOD International Conference on Management of Data (1999) 145-156
20. Cheung D.W.-L., Han J., Ng V., and Wong C.Y. Maintenance of discovered association rules in large databases: an incremental updating technique. Proceedings of the 12th International Conference on Data Engineering (1996) 106-114
21. Cheung D.W.-L., Lee S.D., and Kao B. A general incremental technique for maintaining discovered association rules. Proceedings of the Fifth International Conference on Databases Systems for Advanced Applications (1997) 185-194
22. A. Veloso, W. Meira Jr., M. de Carvalho, B. Possas, S. Parthasarathy, M.J. Zaki, Mining frequent itemsets in evolving databases, Proceedings of the Second SIAM International Conference on Data Mining, 2002.
23. Thomas S., Bodagalr S., Alsabti K., and Ranka S. An efficient algorithm for the incremental updation of association rules in large databases. Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (1997) 263-266
24. Yi B.-K., Sidiropoulos N.D., Johnson T., Jagadish H.V., Faloutsos C., and Biliris A. Online data mining for co-evolving time sequences. Proceedings of the 16th International Conference on Data Engineering (2000) 13-22
25. H.S. Javitz, A. Valdes, The NIDES statistical component description and justification, Annual Report A010, 1994.
26. Babcock B., Datar M., and Motwani R. Sampling from a moving window over streaming data. Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (2002) 633-634