參考文獻 |
[1]. A.G. Buchner, M. Baumgarten, S.S. Anand, M.D. Mulvenna and J.G. Hughes, 『Navigation Pattern Discovery from Internet Data』Proc. WEBKDD99, pp.74-91.
[2]. A. K. H. Tung, J. Han, L. V. S. Lakshmanan, and R. T. Ng, 『Constraint-Based Clustering in Large Databases』, Proc. 2001 Int. Conference on Database Theory (ICDT'01), London, U.K., Jan. 2001, pp.405-419.
[3]. Brian Dunkel, Nandit Soparkar, 『Data Organization and Access for Efficient Data Mining』Proc. Int’l Conference on Data Engineering 99, pp.522-529.
[4]. Jong Soo Park, Ming-Syan Chen, Philip S. Yu, 『Using a Hash-Based Method with Transaction Trimming for Mining Association Rules』Proc. IEEE Transactions on Knowledge and Data Engineering, pp.813-825.
[5]. J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen, U. Dayal, M.-C. Hsu, 『FreeSpan: Frequent Pattern-Projected Sequential Pattern Mining』, Proc. 2000 Int. Conference on Knowledge Discovery and Data Mining (KDD'00), Boston, MA, August 2000, pp.355-359.
[6]. J. Han, J. Pei and Y. Yin, 『Mining Frequent Patterns without Candidate Generation』Proc. ACM SIGMOD, Int’l Conference Management of Data pp. 1-12 2000, pp.1-12.
[7]. J. Pei, J. Han, B. Mortazavi-Asl, and H. Zhu 『 Mining Access Patterns Efficiently from Web Logs』, Proc. 2000 Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'00), Kyoto, Japan, April 2000, pp.396-407.
[8]. J. Pei, J. Han, and L. V. S. Lakshmanan, 『Mining Frequent Itemsets with Convertible Constraints』, Proc. 2001 Int. Conf. on Data Engineering (ICDE'01), Heidelberg, Germany, April 2001, pp.433-442.
[9]. J. Pei and J. Han 『Can We Push More Constraints into Frequent Pattern Mining? 』, Proc. 2000 Int’l. Conf. on Knowledge Discovery and Data Mining (KDD'00), Boston, MA, August 2000, pp.350-354.
[10]. J. Pei, J. Han, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu, 『PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth』, Proc. 2001 Int. Conf. on Data Engineering (ICDE'01), 2001, pp.215-224.
[11]. J.S. Park, M.S. Chen, and P.S. Yu, 『An Efficient Hash-Based Algorithm for Mining Association Rules』Proc. SIGMOD95, pp. 175-186.
[12]. J.S. Park, M.S. Chen, and P.S. Yu, 『Data Mining for Path Traversal Patterns in a Web Environment』Proc. 16th Int’l Conference on Distributed Computing System, pp.385-392, 1996.
[13]. J.S. Park, M.S. Chen, and P.S. Yu, 『Efficient Data Mining for Path Traversal Pattern』IEEE Tran. on Knowledge and Data Engineering, pp.209-220 1998.
[14]. Jaideep Srivastava, Robert Cooley, Mukund Deshpande, Pang-Ning Tan, 『Web Usage Mining: Discovery and Applications of Usage Patterns from Web Data』To appear in SIGKDD Explorations, Vol. 1, Issue 2, 2000, pp.12-23.
[15]. K. Wang, Y. He and J. Han, 『 Mining Frequent Itemsets Using Support Constraints』 Proc. 2000 Int’l. Conf. on Very Large Data Bases (VLDB'00), Cairo, Egypt, Sept. 2000, pp.43-52.
[16]. Myra Spiliopoulou and Lukas C. Faulstich, 『WUM:A Tool for Web Utilization Analysis』Proc. EDBT Workshop WebDB 1998, pp.184-193.
[17]. R. Agrawal, C. Aggarwal and V. V. V. Prasad, 『Depth-first Generation of Large Item Sets for Association Rules』IBM Tech. Report RC21538 1999.
[18]. R. Agrawal, C. Aggarwal and V. V. V. Prasad, 『A Tree Projection Algorithm for Generation of Frequent Item Sets』Proc. Int’l Conference J. Parallel and Distributed Computing 2000, pp128-142.
[19]. R. Agrawal and R. Srikant, 『Mining Sequential Patterns』Proc. Int’l Conference Data Engineering 1995, pp3-14.
[20]. R. Agrawal, T.Imielinski and A. Swami, 『Mining Association Rules between Sets of Items in the Large Database』Proc. SIGMOD 93, pp.207-216.
[21]. R. Agrawal and R. Srikant, 『Fast Algorithm for Mining Association Rules in Large Database』Proc. Int’l Conference on Very Large Data Bases 1994, pp.478-499.
[22]. Robert Cooley, Bamshad Mobasher, and Jaideep Srivastava, 『Grouping Web Page References into Transaction for Mining World Wide Web Browsing Pattern』Technical Report TR97-121, Dept. of Computer Science, Univ. of Minnesota, Minneapolis, USA, June 1997.
[23]. Robert Cooley, Bamshad Mobasher and Jaideep Srivastava, 『Web Mining:Information and Pattern Discovery on the World Wide Web』Proc. 9th IEEE Int’l Conference on Tools with Artificial Intelligence pp.558-567 1997.
[24]. Robert Cooley, Bamshad Mobasher and Jaideep Srivastava, 『Data Preparation for Mining World Wide Web Browsing Patterns』 Knowledge and Information Systems 1(1), 1999, pp.5-32.
[25]. Robert Cooley, Bamshad Mobasher and Jaideep Srivastava, 『Data Preparation for Mining World Wide Web Browsing Patterns』 Knowledge and Information Systems 1(1), 1999, pp.5-32.
[26]. 沈錳坤, 李華富. 『Mining Non-Simple Traversal Paths from Web Access Logs』.2000年網際網路與分散式系統研討會論文集, pp.266-272.
[27]. University of California-Irvine:Machine Learning Database Repositories.
[28]. http://www.cs.berkeley.edu/logs/http/ |