Autor:	Yu, Shoujian, Zhou, Yiyang
Rok vydání:	2016
Předmět:	Computer Science - Data Structures and Algorithms Computer Science - Databases
Druh dokumentu:	Working Paper
Popis:	Association rules is a very important part of data mining. It is used to find the interesting patterns from transaction databases. Apriori algorithm is one of the most classical algorithms of association rules, but it has the bottleneck in efficiency. In this article, we proposed a prefixed-itemset-based data structure for candidate itemset generation, with the help of the structure we managed to improve the efficiency of the classical Apriori algorithm. Comment: 9 pages, 2 figures
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1601.01746 Zobrazit plný text záznamu View this record from Arxiv