2013
DOI: 10.11591/telkomnika.v11i7.2825
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Algorithm for Mining Top-K Closed Frequent Itemsets over Data Streams over Data Streams

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…Mining frequent patterns has been done in data stream with DSCL algorithm [18] and Top-K Closed [19]. With frequent pattern we can have strong/sharp discrimination power where have large growth rate and support in target (D2) dataset and other support in contrasting (D1) dataset is small [5][6][7].…”
Section: Mining Frequent Patternmentioning
confidence: 99%
“…Mining frequent patterns has been done in data stream with DSCL algorithm [18] and Top-K Closed [19]. With frequent pattern we can have strong/sharp discrimination power where have large growth rate and support in target (D2) dataset and other support in contrasting (D1) dataset is small [5][6][7].…”
Section: Mining Frequent Patternmentioning
confidence: 99%
“…Frequent pattern is a combination of feature patterns that appear in dataset with frequency not less than a user-specified threshold [1] and the frequent pattern synonym with large pattern was first proposed for market basket analysis in the form of association rules [4]. Mining frequent patterns has been done in data stream with DSCL algorithm [18] and Top-K Closed [19]. With frequent pattern we can have strong/sharp discrimination power where have large growth rate and support in target (D2) dataset and other support in contrasting (D1) dataset is small [5][6][7].…”
Section: Mining Frequent Patternmentioning
confidence: 99%