Multi-Scaling Sampling: An Adaptive Sampling Method for Discovering Approximate Association Rules

Evfimievski A, Srikant R, Agrawal R, Gehrke J. Privacy preserving mining of association rules. In Proc. the 8th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, EDmonton, Alberta, Canada, July 2002, pp.217–228.

Agrawal R, Mannila H, Srikant R et al. Fast Discovery of the Association Rules. Advances in Knowledge Discovery and Data Mining, AAAI Press, 1996, pp.307–328.

Li Q, Wang H et al. Efficient mining of association rules by reducing the number of passes over the database. Journal of Computer Science and Technology, 2001, 16(2): 182–188.

Zaki M J. Parallel and distributed association mining: A survey. IEEE Concurrency, 1999, 7(4): 14–25.

Agrawal R, Shafer J C. Parallel mining of association rules. IEEE Trans. Knowledge and Data Engineering, 1996, 8(6): 962–969.

SAS Institute Inc. Data mining and case for sampling: Solving business problems using SAS enterprise miner software. {SAS Institute White Paper}, 1998.

Chen B, Haas P, Scheuermann P. A new two-phase sampling based algorithms for discovery association rules. In Proc. the 8th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, EDmonton, Alberta, Canada, July 2002, pp.462–468.

Parthasarathy S. Efficient progressive sampling for association rules. In Proc. the IEEE Int. Conf. Data Mining (ICDM’02), Maebashi City, Japan, Dec., 2002, pp.354–361.

Toivonen H. Sampling large databases for association rules. In Proc. the 22nd Int. Conf. Very Large Data Bases, Mumbai, Bombay, India, Sept. 1996, pp.134–145.

Zaki M J, Parthasarathy S, Li W et al. Evaluation of sampling for data mining of association rules. In Proc. the 7th Workshop on Research Issues in Data Engineer, Birmingham, UK, April 1997, pp.42–50.

Watanabe O. Simple sampling techniques for discovery science. IEICE Trans. Information and Systems, 2000, E83-D(1): 19–26.

Zhang C, Zhang S, Webb G I. Identifying approximate itemsets of interest in large databases. Applied Intelligence, 2003, 18: 91–104.

Valiant L G. A theory of the learnable. Communications of the ACM, 1984, 27: 1134–1142.

John G H, Langley P. Static versus dynamic sampling for data mining. In Proc. the 2nd Int. Conf. Knowledge Discovery and Data Mining, KDD-96, Portland, OR, Aug. 1996, pp.367–370.

Suzuki E. Sampling theories for rule discovery based on generality and accuracy, the worst case and a distribution-based case. Communication of Institute of Information and Computing Machinery, May, 2002, 5(2): 83–88.

Zaki M J, Hsiao C J. CHARM: An efficient algorithm for closed association rule mining. {Technical Report 99-10}, Computer Science Dept., Rensselaer Polytechnic Institute, Oct., 1999.

Burdick D, Calimlim M, Gehrke J. MAFIA: A maximal frequent itemset algorithm for transactional databases. In Proc. the 17th Int. Conf. Data Engineering, Heidelberg, Germany, April, 2001, pp.443–452.

Agrawal R, Srikant R. Fast algorithms for mining association rules. In Proc. the 20th Int. Conf. Very Large Data Bases, Santiago, Chile, 1994, pp.487–499.

Han J, Pei J, Yin Y. Mining frequent patterns without candidate generation. In Proc. the ACM SIGMOD Int. Conf. the Management of Data, Dallas, TX, May 2000, pp.1–12.

Pei J, Han J, Mao R. CLOSET: An efficient algorithm for mining frequent closed itemsets. In Proc. the ACM-SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, Dallas, TX, May, 2000, pp.21–30.

Provost F, Jensen D, Oates T. Efficient progressive sampling. In Proc. the 5th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, San Diego, CA, USA, Aug. 1999, pp.23–32.

Vitter J S. An efficient algorithm for sequential random sampling. ACM Trans. Mathematical Software, 1987, 13(1): 58–67.

http://fuzzy.cs.uni-magdeburg.de/~borgelt/