Abstract
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.
- Mulvenna, M.D., An, S.S., and Buchner, A.G. (2000). "Personalization on the Net using Web Mining," Communications of the ACM, Vol. 43, No. 8, pp. 123--125. Google Scholar
Digital Library
- Srivastava, J., Cooley, R., Deshpande, M., and Tan, P. (2000). "Web Usage Mining: Discovery and Applications of Web Usage Patterns from Web Data," SIGKDD Explorations, Vol. 1, No. 2, pp. 12--23. Google Scholar
Digital Library
- Lin, W., Alvarez, S.A., and Ruiz C. (2002). "Efficient Adaptive-Support Association Rule Mining for Recommender Systems," Data Mining and Knowledge Discovery, Vol. 6, No. 1, pp. 83--105. Google Scholar
Digital Library
- Deshpande, M. and Karypis, G. (2004). "Selective Markov Models for Predicting Web Page Accesses," ACM Transaction on Internet Technology, Vol. 4, No. 2, pp. 163--184. Google Scholar
Digital Library
- Kohonen, T. (1995). Self-Organizing Maps, Berlin: Springer-Verlag. Google Scholar
Digital Library
- Yang, B. and Song, W. (2005). "A SOM-Based Web Text Clustering Approach," In Proceedings of the Eleventh International Fuzzy Systems Association World Congress (IFSA), pp. 618--621.Google Scholar
- Masseglia, F., Teisseire, M., and Poncelet, P. (2005). "Sequential Pattern Mining: A Survey on Issues and Approaches," Encyclopedia of Data Warehousing and Mining. Idea Group Reference, 1028--1032.Google Scholar
- Zaki, M. J. (2001). "SPADE: An Efficient Algorithm for Mining Frequent Sequences," Machine Learning, Vol. 42 Nos.1-2, pp. 31--60. Google Scholar
Digital Library
- Agrawal, R., Srikant, R. (1995). "Mining Sequential Patterns," Proceedings of the Eleventh International Conference on Data Engineering, pp. 3--14. Google Scholar
Digital Library
- Ayres, J., Gehrke, J., Yiu, T., Flannick, J. (2002). "Sequential Pattern Mining Using a Bitmap Representation," Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 429--435. Google Scholar
Digital Library
- Han, J., Pei J., Mortazavi-Asl, B., Chen, Q., Dayal U., Hsu, M. (2000). "FreeSpan: Frequent Pattern-Projected Sequential Pattern Mining," Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 355--359. Google Scholar
Digital Library
- Masseglia, F., Cathala, F., Poncelet, P. (1998). "The PSP Approach for Mining Sequential Patterns," Proceedings of the Second European Symposium on Principles of Data Mining and Knowledge Discovery, pp. 176--184. Google Scholar
Digital Library
- Pei J., Han, J., Mortazavi-Asl, B., Wang, J., Pinto, H., Chen, Q., Dayal U., Hsu, M. (2004). "Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach," IEEE Transaction on Knowledge and Data Engineering Vol. 16, No. 11, pp. 1424--1440. Google Scholar
Digital Library
- Srikant, R., Agrawal, R. (1996). "Mining Sequential Patterns: Generalizations and Performance Improvements," Proceedings of the Fifth International Conference on Extending Database Technology, pp. 3--17. Google Scholar
Digital Library
- Wang, W., Yang, J. (2005). Mining Sequential Patterns from Large Data Sets. New York: Springer. Google Scholar
Digital Library
- Zaki, M. J. (2001). "SPADE: An Efficient Algorithm for Mining Frequent Sequences," Machine Learning Vol. 42, Nos. 1-2, pp. 31--60. Google Scholar
Digital Library
Index Terms
- Algorithm of mining sequential patterns for web personalization services
Recommendations
Fast accumulation lattice algorithm for mining sequential patterns
ACOS'07: Proceedings of the 6th Conference on WSEAS International Conference on Applied Computer Science - Volume 6Sequential Patterns has many diverse applications in many fields recently. And it has become one of the most important issues of Data Mining. The major problem in previous studies of mining sequential patterns is too many candidates sequences has been ...
Efficient algorithms for simultaneously mining concise representations of sequential patterns based on extended pruning conditions
The concise representations of sequential patterns, including maximal sequential patterns, closed sequential patterns and sequential generator patterns, play an important role in data mining since they provide several benefits when compared to ...
Mining negative sequential patterns
ACOS'07: Proceedings of the 6th Conference on WSEAS International Conference on Applied Computer Science - Volume 6Sequential pattern mining is to discover all frequent sequences from a sequence database and has been an important issue in data mining. A lot of methods have been proposed for mining sequential pattern. However, conventional methods consider only the ...





Comments