Personalized Web Recommendation Based on Path Clustering
Each user accesses a Website with certain interests. The interest can be manifested by the sequence of each Web user access. The access paths of all Web users can be clustered. The effectiveness and efficiency are two problems in clustering algorithms. This paper provides a clustering algorithm for personalized Web recommendation. It is path clustering based on competitive agglomeration (PCCA). The path similarity and the center of a cluster are defined for the proposed algorithm. The algorithm relies on competitive agglomeration to get best cluster numbers automatically. Recommending based on the algorithm doesn’t disturb users and needn’t any registration information. Experiments are performed to compare the proposed algorithm with two other algorithms and the results show that the improvement of recommending performance is significant.
KeywordsAssociation Rule Cluster Center User Access User Interest Membership Grade
Unable to display preview. Download preview PDF.
- 9.Wang, S., Gao, W., Li, J.T.: Path clustering: discovering the knowledge in the Website. Journal of Computer Research & Development 38(4), 482–486 (2001)Google Scholar
- 10.Frigui, H., Krishnapuram, R.: A robust clustering algorithm based on competitive agglomeration and soft rejection of outliers. In: Conference on Computer Vision and Pattern Recognition (CVPR 1996), pp. 550–555. IEEE Computer Society, San Francisco (1996)Google Scholar
- 11.Chun, J., Oh, J., Kwon, S.: Simulating the effectiveness of using association rules for recommendation systems. In: AsiaSim 2004, pp. 306–314. Springer, Jeju Island (2005)Google Scholar
- 12.Ji, G.L., Sun, Z.H.: An algorithm for mining optimized confidence quantitative association rules. Journal of Southeast University (Natural Science Edition) 31(2), 31–34 (2001)Google Scholar