%0 Conference Paper %1 Agrawal:1994 %A Agrawal, Rakesh %A Srikant, Ramakrishnan %B Proc. 20th Int. Conf. Very Large Data Bases, VLDB %D 1994 %K conceptual_graphs %T Fast Algorithms for Mining Association Rules %X We consider the problem of discovering association rules between items in a large database of sales transactions. We present two new algorithms for solving this problem that are fundamentally different from the known algorithms. Experiments with synthetic as well as real-life data show that these algorithms outperform the known algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems. We also show how the best features of the two proposed ...

@inproceedings{Agrawal:1994, abstract = {We consider the problem of discovering association rules between items in a large database of sales transactions. We present two new algorithms for solving this problem that are fundamentally different from the known algorithms. Experiments with synthetic as well as real-life data show that these algorithms outperform the known algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems. We also show how the best features of the two proposed ...}, added-at = {2007-12-14T02:35:11.000+0100}, author = {Agrawal, Rakesh and Srikant, Ramakrishnan}, biburl = {https://www.bibsonomy.org/bibtex/224d24f79aeaefa77af9a1833e8eb7428/diego_ma}, booktitle = {Proc. 20th Int. Conf. Very Large Data Bases, VLDB}, interhash = {385fb6f60e7dc2ef5b2c634eb6fec067}, intrahash = {24d24f79aeaefa77af9a1833e8eb7428}, keywords = {conceptual_graphs}, timestamp = {2007-12-14T02:35:11.000+0100}, title = {Fast Algorithms for Mining Association Rules}, year = 1994 }