PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Using d-gap patterns for index compression
Proceedings of the 16th international conference on World Wide Web
Efficient mining of frequent sequence generators
Proceedings of the 17th international conference on World Wide Web
Real-time data pre-processing technique for efficient feature extraction in large scale datasets
Proceedings of the 17th ACM conference on Information and knowledge management
Efficient incremental mining of frequent sequence generators
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Efficient Mining of Gap-Constrained Subsequences and Its Various Applications
ACM Transactions on Knowledge Discovery from Data (TKDD)
An application of improved gap-BIDE algorithm for discovering access patterns
Applied Computational Intelligence and Soft Computing - Special issue on Awareness Science and Engineering
Graph-Based Modelling of Concurrent Sequential Patterns
International Journal of Data Warehousing and Mining
CSSF-trie structure to mine constraint sequential patterns from progressive database
International Journal of Knowledge Engineering and Data Mining
Mining sequential patterns with extensible knowledge representation
Intelligent Data Analysis
| Hi-index | 0.00 |
Finding Contiguous Sequential Patterns (CSP) is an important problem in Web usage mining. In this paper we propose a new data structure, UpDown Tree, for CSP mining. An UpDown Tree combines suffix tree and prefix tree for efficient storage of all the sequences that contain a given item. The special structure of UpDown Tree ensures efficient detection of CSPs. Experiments show that UpDown Tree improves CSP mining in terms of both time and memory usage comparing to previous approaches.