2AGRAWAL R,IMIELINSKI T,SWAMI A.Mining association rules between sets of items in large database[A].In Proc.of the ACM SIGMOD Intl Conf.on Management of Data[C].Washington,D.C.,1993.207 -216.
3PARK JS,CHEN MS,YU PS.An effective hash based algorithm for mining association rules[A].ACM SIGMOD International Conference Management of Data[C].1995.175-186.
4SAVASERE A,OMIECINSKI E,NAVATHE S.An efficient algorithm for mining association rules in large database[A].In:Proc.of 21th Intl Conf.on Very Large DataBase[C].Zurich,Swizerland,1995.432-443.
5PASQUIER N,BASTIDE Y,TAOUIL R,et al.Discovering frequent closed item sets for association rules[A].ICDT'99,Israel[C].1999.398 -416.
6HAN J,PEI J,YIN Y.Mining frequent patterns without candidate generation[A].In:Proceedings of the 2000 ACM SIGMOD Internal Conference on Management of Data[C].Dallas,Texas:ACM Press,2000.1-12.
7PASQUOER N,BASTIDE Y,TAOUIL R.Effictient mining of association rules using closed item set lattices[J].Information System,1999,24(1):25 -46.
8BERZAL F,CUBERO J-C,MARIN N.TBAR:An efficient method for association rule mining in relational databases[J].Data & Knowledge Engineering,2001,37:47-64.
9HAN J-W,KAMBR M.Data mining concepts and techniques[M].Beijing:Higher Education Press,2001.255-279.
