摘要: … where our sampling method does not produce all association rules, the missing rules can be … Next we analyze the relation of sample size to the accuracy of results. We first consider how …
unibz.it 
acm.org 参考文章(17)
Heikki Mannila, A. Inkeri Verkamo, Hannu Toivonen, Efficient algorithms for discovering association rules knowledge discovery and data mining. pp. 181- 192 ,(1994)
Heikki Mannila, Hannu Toivonen, On an algorithm for finding all interesting sentences Cybernetics and Systems. pp. 973- 978 ,(1996)
Ramakrishnan Srikant, Rakesh Agrawal, Fast Algorithms for Mining Association Rules in Large Databases very large data bases. pp. 487- 499 ,(1994)
F. Olken, D. Rotem, Random sampling from B + trees very large data bases. pp. 269- 277 ,(1989)
Ramakrishnan Srikant, Rakesh Agrawal, Mining Generalized Association Rules very large data bases. pp. 407- 419 ,(1995)
Rudy Setiono, Huan Liu, Hongjun Lu, NeuroRule: A Connectionist Approach to Data Mining very large data bases. pp. 478- 489 ,(1995)
Heikki Mannila, A. Inkeri Verkamo, Ramakrishnan Srikant, Hannu Toivonen, Rakesh Agrawal, Fast discovery of association rules knowledge discovery and data mining. pp. 307- 328 ,(1996)
Jiawei Han, Yongjian Fu, Discovery of Multiple-Level Association Rules from Large Databases very large data bases. pp. 420- 431 ,(1995)
Shamkant B. Navathe, Edward Omiecinski, Ashoka Savasere, An Efficient Algorithm for Mining Association Rules in Large Databases very large data bases. pp. 432- 444 ,(1995)
William J Frawley, Christopher J Matheus, Knowledge Discovery in Databases MIT Press. ,(1991)