Approximate mining of global closed frequent itemsets over data streams

Lichao Guo; Hongye Su; Yu Qu

doi:10.1016/j.jfranklin.2011.04.006

ScienceGate Book Chapters

JOURNAL ARTICLE

Approximate mining of global closed frequent itemsets over data streams

Lichao Guo Hongye Su Yu Qu

Year: 2011 Journal: Journal of the Franklin Institute Vol: 348 (6)Pages: 1052-1081 Publisher: Elsevier BV

DOI: 10.1016/j.jfranklin.2011.04.006

Get Full-Text PDF Get Analytical Report

Keywords:

Data stream mining Tree (set theory) Computer science Data mining Data stream Window (computing) STREAMS Sliding window protocol Algorithm Tree structure Mathematics Binary tree

Metrics

Cited By

2.99

FWCI (Field Weighted Citation Impact)

Refs

0.92

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Data Mining Algorithms and Applications

Physical Sciences → Computer Science → Information Systems

Data Management and Algorithms

Physical Sciences → Computer Science → Signal Processing

Advanced Database Systems and Queries

Physical Sciences → Computer Science → Computer Networks and Communications

Approximate mining of global closed frequent itemsets over data streams

Metrics

Citation History

Topics

Related Documents

Mining Approximate Frequent Itemsets over Data Streams

Mining Frequent Closed Itemsets over Data Streams Using TranDigraph

Mining Approximate Closed Frequent Itemsets over Stream

An Efficient Frequent Closed Itemsets Mining Algorithm Over Data Streams

Mining Closed Frequent Itemsets in Sliding Window over Data Streams