Mining maximal sequential patterns with layer coded breadth-first linked WAP-tree

PACIIA 2009 - 2009 2nd Asia-Pacific Conference on Computational Intelligence and Industrial Applications

Volumn 1, Issue , 2009, Pages 61-65

  Liu, Lizhi ^a   Liu, Jun ^a  

^a WUHAN INSTITUTE OF TECHNOLOGY   (China)

Author keywords

BFWAP tree mining; Layer codes; Maximal sequential patters; Web usage mining

Indexed keywords

BREADTH-FIRST; DATA MINING TECHNIQUES; FREQUENT SEQUENCES; FREQUENT SEQUENTIAL PATTERNS; MINING TECHNIQUES; PERFORMANCE GAIN; SEQUENTIAL DATABASE; SEQUENTIAL PATTERNS; TREE MINING; WEB MINING; WEB PAGE; WEB USAGE MINING; WEB USERS; WEBLOGS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CELLULAR TELEPHONE SYSTEMS; COMPUTATIONAL EFFICIENCY; INDUSTRIAL APPLICATIONS; MINING; WORLD WIDE WEB;

DATA MINING;

EID: 77749252824     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACIIA.2009.5406373     Document Type: Conference Paper

References (9)

1. R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules," Proc. 1994 Int'l Conf. Very Large Data Bases (VLDB '94), pp. 487-499, Sept. 1994.
2. Kosala and Blockeel, "Web mining research: A survey," SIGKDD: SIGKDD Explorations: Newsletter of the Special Interest Group (SIG) on Knowledge Discovery and Data Mining, ACM, Vol. 2, 2000.
3. S. K. Madria, S. S. Bhowmick, W. K. Ng, and E.-P. Lim, "Research issues in web data mining," in Data Warehousing and Knowledge Discovery, 1999, pp. 303-312.
4. M. N. Garofalakis, R. Rastogi, S. Seshadri, and K. Shim, "Data mining and the web: Past, present and future," in ACM CIKM'99 2nd Workshop on Web Information and Data Management (WIDM'99), Kansas City, Missouri, USA, November 5-6, 1999, C. Shahabi, Ed. ACM, 1999, pp. 43-47.
5. C.I. EZEIFE, and YI LU, "Mining Web Log Sequential Patterns with Position Coded Pre-Order Linked WAP-Tree." Proc. 2005 Springer Science + Business Media, Inc. Manufactured in The Netherlands. Data Mining and Knowledge Discovery, pp. 5-38, Oct. 2005
6. Han, J., Pei, J., Mortazavi-Asl, B., Chen, Q., Dayal, U., and Hsu, M.-C. 2000. FreeSpan: Frequent pattern-projected sequential pattern mining. In Proceedings of the 2000 Int. Conference on Knowledge Discovery and Data Mining (KDD'00). Boston, MA, U.S.A., pp. 355-359.
7. Han, J., Pei, J., Yin, Y., and Mao, R. 2004. Mining frequent patterns without candidate generation: A frequentpattern tree approach. International Journal of Data Mining and Knowledge Discovery. Kluwer Academic Publishers, 8(1): 53-87.
8. Burdick, D., Calimlim,M., and Gehrke, J. 2001. MAFIA: A maximal frequent itemset algorithm for transactional databases. In IEEE IntI. Conf. on Data Engineering, pp. 443-452.
9. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In 7th IntI. Conf. on Database Theory, January 1999.