2Agrawl R, Shafer J. Parallel Minging of Association Rules: Design, Implementation, and Experience [P] . USA: CA 95120, 1996.
3Brin S, Motwani R, Silverstein C. Beyond Market Baskets: Generlizing Association Rules to Correlations [A]. Proceedings of the ACM SIGMOD [C]. NewYork: ACM Press, 1996. 255-276.
4Brin S, Motwani R, Ullman J D, et al. Dynamic Itemset counting and implication Rulesf for Market Basket Data [A] . ACM SIGMOD International Conference On the Management of Data[C] . New York: ACM Press, 1997.
5Kleinberg J, Papadimitriou C, Raghavan P. Segmentation Problems [A] . Proceedings of the 30th Annual Symposium on the Theory of Computing [C] . New York: ACM Press, 1998.
3Savasere A, Omieeinski E, Navathe S. An Efficient Algorithm for Mining Association Rules In Large Databases [ C ]//Proceedings of the 21st International Conference on Very Large Databases. New York : ACM, 1995:432-443.
4Agrawal R, Srikant R. Fast Algorithms for Mining Association Rules[ C ]//Proceedings of the 20th International Conference on Very Large Databases. Santiago, Chile:Morgan Kaufmann Publisher, 1994:487-499.
5Toiconen H. Sampling Large Databases for Association Rules [ C]//Proceedings of the 22nd International Conference on Very Large Databases. Bombay, India: Morgan Kaufmann Publisher, 1996:134-145.
