最大频繁模式的挖掘算法

[1] As-cending Frequency Ordered Prefix-Tree:Efficient Min-ing of Frequent Patterns. Guimei Liu,Hongjun Lu,Yabo Xu,J.Xu Yu. 8th Database Systems forAdvanced Applications(DASFAA03) .

[2] Fast mining maximum frequent itemsets. LuSF,LuZD. Journal ofSoftware . 2001

[3] Pincer-search:A New Algorithm for Discovering the Maximum Frequent Set Lecture Notes in Computer Science. Lin D I,Kedem Z M. //Proceedings of the 6th European Conference on Extending Database Technology Heidelberg . 1998

[4] Efficiently Mining Long Patterns from Databases. R J Bayardo. ACM SIGMOD Conf Management of Data . 1998

[5] Association Analysis with One Scan of Databases. Huang H,Wu X,Relue R. Proc. of Pacific-Asia Conference . 2002

[6] A Tree Projection Algorithm for Generation of Frequent Itemsets. Agarwal R,Aggrawal C,Prasad V V V. Journal of Parallel and Distributed Computing . 2000

[7] Mining Frequent Patterns Without Candidate Generation. Han J,Jian Pei,Yi wen Y. Proceedings2000ACM-SIGMODInt.Conf.Management of Data . 2000

[8] Datamining:AnoverviewfromadatabaseperspectiveJ. ChenMS,HanJ,YuPS. IEEETransactionsonKnowledgeandDataEngineering . 1996

[9] An Effective Hash-based Algorithm for Mining Association Rules. J. S. Park,M. S. Chen,and P. S. Yu. Proceedings of ACM SIGMOD International Conference on Management of Data . 1995

[10] Fast algorithms for mining association rules. Agrawal R,and Srikant R. Proc,20th Int Conf, Very Large Data Bases . 1994

[1] As-cending Frequency Ordered Prefix-Tree:Efficient Min-ing of Frequent Patterns. Guimei Liu,Hongjun Lu,Yabo Xu,J.Xu Yu. 8th Database Systems forAdvanced Applications(DASFAA03) .

[2] Fast mining maximum frequent itemsets. LuSF,LuZD. Journal ofSoftware . 2001

[3] Pincer-search:A New Algorithm for Discovering the Maximum Frequent Set Lecture Notes in Computer Science. Lin D I,Kedem Z M. //Proceedings of the 6th European Conference on Extending Database Technology Heidelberg . 1998

[4] Efficiently Mining Long Patterns from Databases. R J Bayardo. ACM SIGMOD Conf Management of Data . 1998

[5] Association Analysis with One Scan of Databases. Huang H,Wu X,Relue R. Proc. of Pacific-Asia Conference . 2002

[6] A Tree Projection Algorithm for Generation of Frequent Itemsets. Agarwal R,Aggrawal C,Prasad V V V. Journal of Parallel and Distributed Computing . 2000

[7] Mining Frequent Patterns Without Candidate Generation. Han J,Jian Pei,Yi wen Y. Proceedings2000ACM-SIGMODInt.Conf.Management of Data . 2000

[8] Datamining:AnoverviewfromadatabaseperspectiveJ. ChenMS,HanJ,YuPS. IEEETransactionsonKnowledgeandDataEngineering . 1996

[9] An Effective Hash-based Algorithm for Mining Association Rules. J. S. Park,M. S. Chen,and P. S. Yu. Proceedings of ACM SIGMOD International Conference on Management of Data . 1995

[10] Fast algorithms for mining association rules. Agrawal R,and Srikant R. Proc,20th Int Conf, Very Large Data Bases . 1994