Mining Incrementally Closed Itemsets over Data Stream with the Technique of Batch-Update

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Currently incremental mining techniques can be divided into two groups: direct-update technique and batch-update technique. Mining closed item sets is one of the core tasks of data mining. In addition, advances in hardware technology and information technology have created huge data streams in recent years. Therefore, mining incrementally closed item sets over data streams with the batch-update technique is necessary. Incremental algorithms are always associated with an intermediate structure such as tree, lattice, table… In the previous study, the author proposed an intermediate structure which is a linear list called constructive set. In this paper, an incremental mining algorithm based on the constructive with the batch-update technique is proposed in order to mine data streams.

Cite

CITATION STYLE

APA

Nguyen, T. T., Nguyen, Q., & Hung, N. T. (2019). Mining Incrementally Closed Itemsets over Data Stream with the Technique of Batch-Update. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11814 LNCS, pp. 68–84). Springer. https://doi.org/10.1007/978-3-030-35653-8_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free