From post

Mining association rules between sets of items in large databases

, , и . SIGMOD '93: Proceedings of the 1993 ACM SIGMOD international conference on Management of data, стр. 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.

 

Другие публикации лиц с тем же именем

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