Mining frequent patterns without candidate generation

@inproceedings{citeulike:1166266, abstract = {Mining frequent patterns in transaction databases, timeseries databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist proli\#c patterns and\#or long patterns. In this study,we propose a novel frequent pattern tree \#FP-tree\# structure, which is an extended pre\#xtree structure for...}, author = {Han, Jiawei and Pei, Jian and Yin, Yiwen }, booktitle = {2000 ACM SIGMOD Intl. Conference on Management of Data}, citeulike-article-id = {1166266}, editor = {Chen, Weidong and Naughton, Jeffrey and Bernstein, Philip A. }, keywords = {association-rule}, month = {May}, pages = {1--12}, posted-at = {2008-01-17 03:53:49}, priority = {5}, publisher = {ACM Press}, title = {Mining frequent patterns without candidate generation}, url = {http://citeseer.ist.psu.edu/han99mining.html}, year = {2000} }

TY - CONF ID - citeulike:1166266 L3 - citeulike-article-id:1166266 TI - Mining frequent patterns without candidate generation T2 - 2000 ACM SIGMOD Intl. Conference on Management of Data SP - 1 EP - 12 PB - ACM Press N2 - Mining frequent patterns in transaction databases, timeseries databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist proli#c patterns and#or long patterns. In this study,we propose a novel frequent pattern tree #FP-tree# structure, which is an extended pre#xtree structure for... KW - association-rule AU - Han, Jiawei AU - Pei, Jian AU - Yin, Yiwen A2 - Chen, Weidong A2 - Naughton, Jeffrey A2 - Bernstein, Philip PY - 2000/05// UR - http://citeseer.ist.psu.edu/han99mining.html ER -