Scribd
Upload
21 views1 page

A Mining Algorithm For Frequent Closed Pattern On Data Stream Based On Sub-Structure Compressed in Prefix-Tree

This paper proposes a method for mining frequent closed patterns from data streams using a sliding window approach. The method divides the data stream into basic windows and mines all frequent closed patterns within each window, storing them in a compressed prefix tree structure. As the sliding window updates with new data, the tree can be incrementally updated by deleting infrequent or unclosed patterns. Experimental results demonstrate the method is efficient in terms of time and space for mining frequent closed patterns from streaming data.

Uploaded by

Siva Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
21 views1 page

A Mining Algorithm For Frequent Closed Pattern On Data Stream Based On Sub-Structure Compressed in Prefix-Tree

This paper proposes a method for mining frequent closed patterns from data streams using a sliding window approach. The method divides the data stream into basic windows and mines all frequent closed patterns within each window, storing them in a compressed prefix tree structure. As the sliding window updates with new data, the tree can be incrementally updated by deleting infrequent or unclosed patterns. Experimental results demonstrate the method is efficient in terms of time and space for mining frequent closed patterns from streaming data.

Uploaded by

Siva Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

A MINING ALGORITHM FOR FREQUENT CLOSED PATTERN ON

DATA STREAM BASED ON SUB-STRUCTURE COMPRESSED IN

PREFIX-TREE

ABSTRACT

The knowledge embedded in data stream has the property of decaying with time,
so people are more interested in the new data stream. This paper proposes a method for
mining the frequent closed patterns in a sliding window to capture information timely and
accurately when new data stream arrives.

Data stream is divided into several basic windows. This method is composed of
two main steps and uses the clustering and classification techniques. The main purpose is
to detect, analyze and predict students' behavioral patterns in a university network and
identify the main factors that affect their tendency in using internet.

All possible frequent closed patterns are mined in each basic window and be
stored in Closed Pattern-tree in the form of node compression to save space; As the data
in sliding window updates, Closed Pattern-tree can be incrementally updated and the
infrequent or unclosed patterns will be deleted from the tree. The experimental results of
the simulation show that the method for mining the frequent closed patterns in a sliding
window is efficient in time and space.

You might also like