Incremental and interactive sequence mining
Proceedings of the eighth international conference on Information and knowledge management
Finding replicated Web collections
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Efficient Data Mining for Path Traversal Patterns
IEEE Transactions on Knowledge and Data Engineering
Mining Sequential Patterns: Generalizations and Performance Improvements
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
An Efficient Data Mining Technique for Discovering Interesting Sequential Patterns
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Adaptive Web Sites: Conceptual Cluster Mining
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Capturing User Access Patterns in the Web for Data Mining
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach
IEEE Transactions on Knowledge and Data Engineering
An efficient data mining algorithm for discovering web access patterns
APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications
Online analytical mining association rules using Chi-square test
International Journal of Business Intelligence and Data Mining
WebUser: mining unexpected web usage
International Journal of Business Intelligence and Data Mining
User Behaviour Pattern Mining from Weblog
International Journal of Data Warehousing and Mining
Hi-index | 0.00 |
Mining frequent traversal patterns is to discover the reference paths traversed by a sufficient number of users from web logs, which can be used for prefetching and suggestion for web users. However, the discovered frequent traversal patterns may become invalid or inappropriate when the user behaviours are changed. In this paper, we propose an incremental updating technique to maintain the discovered frequent traversal patterns when the traversal paths are inserted into or deleted from the database. The experimental results show that our algorithms are more efficient than other algorithms for the maintenance of mining frequent traversal patterns.