2020
DOI: 10.1016/j.eswa.2019.112967
|View full text |Cite
|
Sign up to set email alerts
|

Distributed mining of high utility time interval sequential patterns using mapreduce approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 28 publications
(7 citation statements)
references
References 41 publications
0
7
0
Order By: Relevance
“…Hybrid algorithms which finds patterns satisying more than one constraints result in generation of more useful knowledge [21]. Various hybrid algorithms have been proposed in the past such as UTMining [19], UTMining_A [43], TU-UFM [44], HUIPM [45], FDHUP [16,17], UIPrefixSpan [46] which consider more than one parameter during mining. The algorithm algorithm proposed in this paper is also a hybrid algorithm satisfying both support and utility as constraints in mining.…”
Section: B Utility Miningmentioning
confidence: 99%
“…Hybrid algorithms which finds patterns satisying more than one constraints result in generation of more useful knowledge [21]. Various hybrid algorithms have been proposed in the past such as UTMining [19], UTMining_A [43], TU-UFM [44], HUIPM [45], FDHUP [16,17], UIPrefixSpan [46] which consider more than one parameter during mining. The algorithm algorithm proposed in this paper is also a hybrid algorithm satisfying both support and utility as constraints in mining.…”
Section: B Utility Miningmentioning
confidence: 99%
“…As the rapid growth for the research of HUSPM, it is necessary to develop an efficient model to discover the set of HUSPs from a large-scale efficiency. Sumalatha and Subramanyam [39] then presented a distributed high utility time interval sequential pattern mining (DHUTISP) algorithm based on the MapReduce framework. Two upper-bound models are then designed to reduce the computational cost.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Kuang et al [67] proposed the parallel implementation of FP-Growth algorithm in Hadoop by removing the data redundancy between the different data partitions, which allows to handle the transactions in a single pass. Sumalatha et al [68] introduces the concept of distributed temporal high utility sequential patterns, and propose an intelligent strategy by creating a time interval utility data structure for evaluating the candidate patterns. The authors also defined two utility upper bounds, remaining utility, and co-occurrence utility to prune the search space.…”
Section: Related Workmentioning
confidence: 99%