Self-organizing maps
Personalization on the Net using Web mining: introduction
Communications of the ACM
FreeSpan: frequent pattern-projected sequential pattern mining
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
SPADE: an efficient algorithm for mining frequent sequences
Machine Learning
Efficient Adaptive-Support Association Rule Mining for Recommender Systems
Data Mining and Knowledge Discovery
Mining Sequential Patterns: Generalizations and Performance Improvements
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
The PSP Approach for Mining Sequential Patterns
PKDD '98 Proceedings of the Second European Symposium on Principles of Data Mining and Knowledge Discovery
Sequential PAttern mining using a bitmap representation
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Web usage mining: discovery and applications of usage patterns from Web data
ACM SIGKDD Explorations Newsletter
Selective Markov models for predicting Web page accesses
ACM Transactions on Internet Technology (TOIT)
Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach
IEEE Transactions on Knowledge and Data Engineering
Mining Sequential Patterns from Large Data Sets (The Kluwer International Series on Advances in Database Systems)
An application of improved gap-BIDE algorithm for discovering access patterns
Applied Computational Intelligence and Soft Computing - Special issue on Awareness Science and Engineering
| Hi-index | 0.00 |
This paper focuses on the requirements of web personalization service for sequential patterns and sequential mining algorithms. Previous sequential mining algorithms treated sequential patterns uniformly, but individual patterns in sequences often have different importance weights. To solve this problem, we propose a new algorithm to identify weighted maximal frequent sequential patterns. First, frequency of frequent single items is used to calculate the weights of frequent sequences. Then, the frequent weighted sequence is defined, leading not only to the discovery of important maximal sequences, but the property of anti-monotony. Web usage mining has been used effectively to inform web personalization and recommender systems, and this new algorithm provides an effective method for optimizing these services. A variety of recommendation frameworks have been proposed previously, including some based on non-sequential models such as association rules, as well as sequential models. In this paper, we present a hybrid web personalization system based on clustering and contiguous sequential patterns. Our system clusters log files to determine the basic architecture of websites, and for each cluster, we use contiguous sequential pattern mining to further optimize the topologies of websites. Finally, we propose two evaluating parameters to test the performance of our system.