Author:
Jaroszewicz Szymon,Simovici Dan A.
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Ratnaparkhi Adwait. A simple introduction to maximum entropy models for natural language processing. IRCS Report 97-08, University of Pennsylvania, 3401 Walnut Street, Suite 400A, Philadelphia, PA, May 1997. ftp://www.cis.upenn.edu/pub/ircs/tr/97-08.ps.Z .
2. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD Conference on Management of Data, pages 207–216, Washington, D.C., 1993.
3. Y. Aumann and Y. Lindell. A statistical theory for quantitative association rules. In Knowledge Discovery and Data Mining, pages 261–270, 1999.
4. A. H. Andersen. Multidimensional contigency tables. Scand. J. Statist, 1:115–127, 1974.
5. R. J. Bayardo and R. Agrawal. Mining the most interesting rules. In Proc. of the 5th ACM SIGKDD Int’l Conf. on Knowledge Discovery and Data Mining, pages 145–154, August 1999.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献