2018
DOI: 10.1007/s10586-018-1859-y
|View full text |Cite
|
Sign up to set email alerts
|

Improved algorithm for parallel mining collaborative frequent itemsets in multiple data streams

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 23 publications
0
2
0
Order By: Relevance
“…Wang. Q and X Wang [26] developed Parallel Mining Collaborative frequent itemsets in Multiple Data stream (PMCMD-Stream). Two algorithms are developed to generate and analyze the potential frequent itemsets from the streams of data.…”
Section: Literature Surveymentioning
confidence: 99%
See 1 more Smart Citation
“…Wang. Q and X Wang [26] developed Parallel Mining Collaborative frequent itemsets in Multiple Data stream (PMCMD-Stream). Two algorithms are developed to generate and analyze the potential frequent itemsets from the streams of data.…”
Section: Literature Surveymentioning
confidence: 99%
“…These methods are using some filtering constraints to find Frequent Patterns (FP) [35], [36], [37], [38]. Although this is a challenging task to find the use pattern, and different patterns carry different importance [23], [24], [25], [26]. In this research, a scheme is proposed based on the FP tree to extract significant information from the dataset.…”
Section: Introductionmentioning
confidence: 99%