Mining frequent tree-like patterns in large datasets
Authors:
- Tzung-Shi ChenTCTzung-Shi Chen
- Shih-Chun HsuSHShih-Chun Hsu
- 1 July 2007
- journal article
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 62 (1) , 65-83
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Mining interesting knowledge from weblogs: a surveyData & Knowledge Engineering, 2005
- Mining sequential patterns by pattern-growth: the PrefixSpan approachIEEE Transactions on Knowledge and Data Engineering, 2004
- IncSpan2004
- Frequent free tree discovery in graph data2004
- Itemset trees for targeted association queryingIEEE Transactions on Knowledge and Data Engineering, 2003
- Incremental mining of sequential patterns in large databasesData & Knowledge Engineering, 2003
- STAMP: On Discovery of Statistically Important Pattern Repeats in Long Sequential Data2003
- SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint2002
- Mining Access Patterns Efficiently from Web Logs2000
- Efficient data mining for path traversal patternsIEEE Transactions on Knowledge and Data Engineering, 1998