參考文獻 |
[AAP00] R.C. Agarwall, C. Aggarwal and V.V.V. Prasad. A tree projection algorithm for generation of frequent itemsets. Journal of Parallel and Distributed Computing, 2000.
[AS94] R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 1994 Int. Conf. Very Large Data Bases (VLDB’94), pages 487-499, Santiago, Chile, Sept. 1994.
[AS95] R. Agrawal and R. Srikant. Mining sequential patterns. In Proc. 1995 Int. Conf. Data Engineering (ICDE’95), pages 3-14, Taipei, Taiwan, Mar. 1995.
[Car97] P. Carbone. Data Mining or Knowledge Discovery in Databases: An Overview. Data Management Handbook, New York: Auerbach Publications, 1997.
[CHY96] M.S. Chen, J. Han, and P.S. Yu. Data Mining: An Overview from a Database Perspective. IEEE Transactions on Knowledge and Data Engineering, 8(6): 866-883, 1996.
[CMS99] R. Cooley, B. Mobasher, and J. Srivastava. Data Preparation for Mining World Wide Web Browsing Patterns. Journal of Knowledge and Information Systems, 1(1):5-32, 1999.
[FPM91] W. J. Frawley, G. Piatetsky-Shapiro and C. J. Matheus. Knowledge Discovery in Databases:An Overview, AAAI/MIT press, 1991.
[GGK01] V. Guralnik, N. Garg and G. Karypis. Parallel Tree Projection Algorithm for Sequence Mining, 7th International European Conference on Parallel Processing (Euro-Par 2001), Pages 310-320, Manchester, UK, Aug. 2001.
[Han01] Jiawei Han. Data Mining:Concepts and Techniques. Academic Press, 2001.
[HDY99] J. Han, G. Dong, and Y. Yin. . In Proc. 1999 Int. Conf. on Data Engineering (ICDE’’99), Pages 106-115, Sydney, Australia, March 1999.
[HGY98] J. Han, W. Gong, and Y. Yin. Mining Segment-Wise Periodic Patterns in Time-Related Databases. In Proc. of 1998 Int. Conf. on Knowledge Discovery and Data Mining (KDD’’98), Pages 214-218, New York City, NY, Aug. 1998.
[HPMA+00] J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen, U. Dayal, and M.-C. Hsu. FreeSpan: Frequent Pattern-Projected Sequential Pattern Mining. In Proc. 2000 Int. Conf. on Knowledge Discovery and Data Mining (KDD’00), Pages 355-359, Boston, MA, Aug 2000.
[MH01] Sheng Ma and J. L. Hellerstein. Mining partially periodic event patterns with unknown periods. In Proc. 17th Int. Conf. Data Engineering (ICDE’’01), Pages 205-214, Heidelberg, Germany, April 2001.
[MTIV95] H. Mannila, H. Toivonen, and A. Inkeri Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1(3): 259 -289, November 1997.
[PHMAZ00] J. Pei, J. Han, B. Mortazavi-Asl, and H. Zhu. Mining Access Patterns Efficiently from Web Logs. In Proc. 2000 Pacific-Asia Conf. on Knowledge Discovery and Data Mining (PAKDD’’00), Pages 396-407, Kyoto, Japan, April 2000.
[PHPC+01] J. Pei, J. Han, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu. Prefix Span: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth. In Proc. 2001 Int. Conf. on Data Engineering (ICDE’’01), Heidelberg, Germany, Apr. 2001.
[SA96] R. Srikant, R. Agrawal. Mining Sequential Patterns: Generalizations and Performance Improvements. In Proc. of the Fifth Int’’l Conference on Extending Database Technology (EDBT’96), Avignon, France, Mar. 1996.
[WPC01] P.-H. Wu, W.-C. Peng and M.-S. Chen. Mining Sequential Alarm Patterns in a Telecommunication Database. Workshop on Databases in Telecommunications (VLDB 2001), Sept. 2001.
[Zak01] M. J. Zaki. SPADE:An Efficient Algorithm for Mining Frequent Sequences. In Proc. of Machine Learning Journal, special issue on Unsupervised Learning (Doug Fisher, ed.), 42(1/2):31-60, Jan/Feb 2001. |