Mining frequent tree-like patterns in large datasets

Data and Knowledge Engineering

Volumn 62, Issue 1, 2007, Pages 65-83

  Chen, Tzung Shi ^a   Hsu, Shih Chun ^a  

^a NATIONAL UNIVERSITY OF TAINAN   (Taiwan)

Author keywords

Data mining; Frequent patterns; Sequential patterns; Tree like patterns; World wide web

Indexed keywords

DATA MINING; DATA STRUCTURES; DYNAMIC PROGRAMMING; EMBEDDED SYSTEMS; QUEUEING THEORY; WORLD WIDE WEB;

FREQUENT PATTERNS; SEQUENTIAL PATTERNS; TREE-LIKE PATTERNS;

DECISION TREES;

EID: 34247375237     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2006.07.003     Document Type: Article

References (25)

1. R. Agrawal, R. Srikant, Fast algorithm for mining association rules, in: Proceedings of the 20th International Conference on Very Large Databases, Santiago, Chile, September 1994, pp. 487-499.
2. R. Agrawal, R. Srikant, Mining sequential patterns, in: Proceedings of the 1995 International Conference on Data Engineering (ICDE'95), Taipei, Taiwan, March 1995, pp. 3-14.
3. Chen T.-S. Mining traversal patterns on the Internet. IEICE Transactions on Information and Systems E86-D 12 (2003) 2722-2730
4. Chen M.-S., Park J.-S., and Yu P.-S. Efficient data mining for path traversal patterns. IEEE Transactions on Knowledge and Data Engineering 10 2 (1998) 209-221
5. H. Cheng, X. Yan, J. Han, IncSpan: incremental mining of sequential patterns in large database, in: Proceedings of 2004 International Conference on Knowledge Discovery and Data Mining (KDD'04), Seattle, WA, August 2004.
6. M. El-Hajj, O. R. Zaiane, COFI-tree Mining: a new approach to pattern growth with reduced candidacy generation, in: Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, Melbourne, FL, November 2003.
7. Facca F.M., and Lanzi P.L. Mining interesting knowledge from weblogs: a survey. Data & Knowledge Engineering 53 4 (2005) 225-241
8. Huang X., Cercone N., and An A. Comparison of interestingness functions for learning web usage patterns. Proceedings of the Eleventh International Conference on Information and Knowledge Management (2002), ACM Press 617-620
9. Y.-F. Huang, S.-Y. Lin, Mining sequential patterns using graph search techniques, in: Proceedings of the 27th Annual International Computer Software and Applications Conference (COMPSAC'03), Dallas, TX, November 2003, pp. 4-9.
10. IBM Almaden research center, Available from: .
11. A. Inokuchi, T. Washio, N. Yoshio, H. Motoda, A fast algorithm for mining frequent connected graphs, IBM Research Report, RT0448, February 2002.
12. M. Kuramochi, G. Karypis, Frequent subgraph discovery, in: Proceedings of IEEE 2001 International Conference on Data Mining (ICDM'01), San Jose, CA, USA, November 2001, pp. 313-320.
13. Kubat M., Hafez A., Raghavan V.V., Lekkala J.R., and Chen W.-K. Itemset trees for targeted association querying. IEEE Transactions on Knowledge and Data Engineering 15 6 (2003) 1522-1534
14. X. Lin, C. Liu, Y. Zhang, X. Zhou, Efficiently computing frequent tree-like topology patterns in a web environment, in: Proceedings of the 31st International Conference on Technology of Object-Oriented Languages and Systems, Nanjing, China, September 1999, pp. 22-25.
15. F. Masseglia, F. Cathala, P. Poncelet, The PSP approach for mining sequential patterns, in: Proceedings of the 2nd European Symposium on Principles of Data Mining and Knowledge Discovery (PKDD'98), LNAI, vol. 1510, Nantes, France, September 1998, pp. 236-244.
16. Masseglia F., Poncelet P., and Teisseire M. Incremental mining of sequential patterns in large databases. Data & Knowledge Engineering 46 1 (2003) 97-121
17. J. Pei, J. Han, H. Lu, S. Nishio, S. Tang, D. Yang, H-Mine: hyper-structure mining of frequent patterns in large databases, in: Proceedings of IEEE International Conference on Data Mining, San Jose, CA, November 2001, pp. 441-448.
18. Pei J., Han J., Mortazavi-Asl B., Wang J., Pinto H., Chen Q., Dayal U., and Hsu M.-C. Mining sequential patterns by pattern-growth: The PrefixSpan approach. IEEE Transactions on Knowledge and Data Engineering 16 11 (2004) 1424-1440
19. J. Pei, J. Han, B. Mortazavi-asl, H. Zhu, Mining access patterns efficiently from web logs, in: Proceedings of the 2002 Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2000, pp. 396-407.
20. U. Rückert, S. Kramer, Frequent free tree discovery in graph data, in: Proceedings of the 2004 ACM Symposium on Applied Computing (SAC 2004), Nicosia, Cyprus, March 2004, pp. 564-570.
21. M. Seno, G. Karypis, SLPMiner: an algorithm for finding frequent sequential patterns using length-decreasing support constraint, in: Proceedings of IEEE 2002 International Conference on Data Mining (ICDM'02), Maebashi, Japan, December 2002, pp. 424-428.
22. X. Yan, J. Han, gSpan: graph-based substructure pattern mining, in: Proceedings of International Conference on Data Mining (ICDM'02), Maebashi, Japan, December 2002, pp. 721-724.
23. J. Yang, W. Wang, P. S. Yu, STAMP: on discovery of statistically important pattern repeats in long sequential data, in: Proceedings of the 3rd SIAM International Conference on Data Mining, San Francisco, CA, USA, May 2003, pp. 224-238.
24. M. J. Zaki, Efficiently mining frequent trees in a forest, in: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, pp. 71-80.
25. M. J. Zaki, K. Gouda, Fast vertical mining using diffsets, in: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, pp. 326-335.