Author:
Singer Jeremy,Brown Gavin,Luján Mikel,Pocock Adam,Yiapanis Paraskevas
Subject
General Computer Science,Theoretical Computer Science
Reference21 articles.
1. Agrawal, R., T. Imielinski and A. Swami, Mining association rules between sets of items in large databases, in: Proceedings of the International Conference on Management of Data, 1993, pp. 207–216.
2. Agrawal, R. and R. Srikant, Fast algorithms for mining association rules, in: Proceedings of the 20th International Conference on Very Large Databases, 1994, pp. 487–499.
3. Bajracharya, S., T. Ngo, E. Linstead, Y. Dou, P. Rigor, P. Baldi and C. Lopes, Sourcerer: a search engine for open source code supporting structure-based search, in: Companion to the 21st ACM SIGPLAN Symposium on Object-Oriented Programming, Systems, Languages, and Applications, 2006, pp. 681–682.
4. Blackburn, S. M. et al., The DaCapo benchmarks: Java benchmarking development and analysis, in: Proceedings of the 21st Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, 2006, pp. 169–190.
5. Brin, S., R. Motwani, J. Ullman and S. Tsur, Dynamic itemset counting and implication rules for market basket data, in: Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, 1997, pp. 255–264.
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献