A Spark-based Apriori algorithm with reduced shuffle overhead

Mining frequent itemset is considered as a core activity to find association rules from transactional datasets. Among the different well-known approaches to find frequent itemsets, the Apriori algorithm is the earliest proposed. Many attempts have been made to adopt the Apriori algorithm for large-s...

Celý popis

Podrobná bibliografia

Vydané v:	The Journal of supercomputing Ročník 77; číslo 1; s. 133 - 151
Hlavní autori:	Raj, Shashi, Ramesh, Dharavath, Sethi, Krishan Kumar
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.01.2021
Predmet:	Compilers Computer Science Interpreters Processor Architectures Programming Languages Apriori algorithm Large-scale datasets Shuffle overhead Apache Spark
ISSN:	0920-8542, 1573-0484
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!