Author of the publication

Mining association rules between sets of items in large databases

, , and . SIGMOD '93: Proceedings of the 1993 ACM SIGMOD international conference on Management of data, page 207--216. New York, NY, USA, ACM Press, (1993)
DOI: http://doi.acm.org/10.1145/170035.170072

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Data Sentinel: A Declarative Production-Scale Data Validation Platform., , and . ICDE, page 1579-1590. IEEE, (2020)Web caching and prefetching: a data mining approach., , and . Data Mining and Knowledge Discovery: Theory, Tools, and Technology, volume 4384 of SPIE Proceedings, page 84-91. SPIE, (2001)Using unsuccessful auction bids to identify latent demand., , and . SMC, page 2911-2916. IEEE, (2001)Mining association rules between sets of items in large databases, , and . SIGMOD '93: Proceedings of the 1993 ACM SIGMOD international conference on Management of data, page 207--216. New York, NY, USA, ACM Press, (1993)Optimization of Large Join Queries. Stanford University, Department of Computer Science, (1989)A Validated Cost Model for Main Memory Databases.. SIGMETRICS, page 235. ACM, (1989)Optimization of Large Join Queries., and . SIGMOD Conference, page 8-17. ACM Press, (1988)SIGMOD Record 17(3), September 1988.A One-Pass Space-Efficient Algorithm for Finding Quantiles., and . COMAD, Tata McGraw-Hill, (1995)Limits of Parallelism in Hash Join Algorithms., , , and . Perform. Evaluation, 20 (1-3): 301-316 (1994)Mining Association Rules between Sets of Items in Large Databases., , and . SIGMOD Conference, page 207-216. ACM Press, (1993)