1[9]Han J.,et al.Mining Frequent Patterns without Candidate Generation[C].SIGMOD Conference,2000.1-12.
2[10]Bayardo R.J.,et al.Efficiently mining long patterns from databases[C].In: proc.1998 ACM-SIGMOD Int.Conf.Management of Data.Seattle,1998.85-93.
3[1]Han J.Towards on-line analytical mining in lare database sysytems[C].ACM-SIGMOD,1998.97-107.
4[2]Chen M.S.,et al.Data mining:An overview from a database perspective[J].IEEE Transactions on knowledge and Data Engineering.1996,8(6.):866-883.
5[3]Fayyad U.M.,et al.Advances in Knoeledge Discovery and Data Mining[C].Cambridge,MA:AAAI/MIT Press,1996.
6[4]Han J.,et al.Data Mining:Concepts and Techniques.Morgan Kaufmann Publishers[M].(高等教育出版社,影印版),2001.
7[5]Agrawal R.,et al.Mining association rule between sets of items in large database.Proceedings of tie ACM SIGMOD International Conference on Management of Data[C].Wa-shington,D.C.,ACM Press,1993.207-216.
8[6]Agrawal R.et al.A tree projection algorithm for generation of frequent itemsets[J].In Ijournal of parallel and Distributed Computing.2000.
9[7]Ankerst M.,et al.Visual classification: An interactive approach to decision tree construction[C].In Proc.1999 ACM-SIGMOD Int.Conf.Management of Data.Philadephia,1999.46-60.
10[8]Wile R.Restructuring lattice theory: An approach based on hierarchiesof concepts[C].In: Rival I ed.Ordered Sets.Dordrecht: Reidel.1982.445-470.
