An Efficient Algorithm for Mining Frequent Closed Itemsets over Data Stream

Guo Dong Li; Ke Wen Xia

doi:10.4028/www.scientific.net/AMM.151.570

Paper Titles

The Research of a Multi-Language Supporting Description-Oriented Clustering Algorithm on Meta-Search Engine Result
p.549

Design and Error Analysis of Tool Checking Instrument on CNC Lathe
p.554

Implementation of Hierarchical Database Attributes Covering in Multidetector A-R Mining Algorithm
p.560

RETRACTED: Towards the Visualization of XML
p.565

An Efficient Algorithm for Mining Frequent Closed Itemsets over Data Stream
p.570

A Recommendation System Framework Based on Web Mining
p.576

Performance Analysis of a Simple Power Saving Scheme for Energy Efficient Ethernet
p.583

Performance Evaluation of Active Control Systems in Diffuse Fields
p.587

An Appraisal System for Bilateral Vehicle Accident
p.592

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 151An Efficient Algorithm for Mining Frequent Closed...

An Efficient Algorithm for Mining Frequent Closed Itemsets over Data Stream

Abstract:

Aiming at the problem of NewMoment algorithm frequently do leftcheck operation in the data mining process, which leads to the low efficiency of algorithm. In this paper, a new method, called LevelMoment, is proposed to improve the NewMoment algorithm which mines frequent closed itemsets over data streams. In this process, a new data structure that added in level node, called LevelCET, is proposed. On this structure, using level checking strategy and optimum frequent closed items checking strategy can quickly tap all the frequent closed itemsets over data streams. The experiments and analysis show that the algorithm has good performance.

You might also be interested in these eBooks

New Trends in Mechatronics and Materials Engineering

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 151)

Pages:

570-575

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.151.570

Citation:

Cite this paper

Online since:

January 2012

Authors:

Guo Dong Li, Ke Wen Xia

Keywords:

Data Stream, Frequent Closed Itemset, Level Checking Strategy, Optimum Frequent Closed Items Checking Strategy, Sliding Window

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] YUAN Zheng-wu; YUAN Song-biao. Data Stream Mining Based on Time and Space Partitioning [J]. Computer Engineering, 2010, 36(7): 61-63.

Google Scholar

[2] CHENG Zhuan-liu; HU Xue-gang. Frequent Closed Patterns Mining over Data Streams [J]，Computer Engineering，2008，34（16）：50-52.

Google Scholar

[3] CAIKEZAXI; HUANG Jing-lian. Efficient Frequent Item Set Mining Algorithm Based on Prefix Tree [J]，Computer Engineering，2010，36（4）：42-44.

Google Scholar

[4] LIU Ying-dong; LENG Ming-wei; CHEN Xiao-yun. Maximal Frequent Itemsets Mining Algorithm Based on Linked List Array [J]，Computer Engineering，2010，36（6）：89-90 Reference to a chapter in an edited book.

Google Scholar

[5] Li,H. -F. et al., Incremental updates of closed frequent itemsets over continuous data streams[J]. Expert Systems with Applications, Volume 36, March 2009, Issue 2, Part 1, pp.2451-2458.

DOI: 10.1016/j.eswa.2007.12.054

Google Scholar