2011 1st International eConference on Computer and Knowledge Engineering (ICCKE) 2011
DOI: 10.1109/iccke.2011.6413359
|View full text |Cite
|
Sign up to set email alerts
|

A new sliding window based algorithm for frequent closed itemset mining over data streams

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 21 publications
0
1
0
Order By: Relevance
“…These social data, according to [12], is generated daily and can be accumulated to PB or EB level. It is really difficult to dig useful information out within such big data.…”
Section: Social Structure Mining Using Sliding Windowmentioning
confidence: 99%
“…These social data, according to [12], is generated daily and can be accumulated to PB or EB level. It is really difficult to dig useful information out within such big data.…”
Section: Social Structure Mining Using Sliding Windowmentioning
confidence: 99%