Experimental Investigation of PSO Based Web User Session Clustering

Web user session clustering is very important in web usage mining for web personalization. This paper proposes a Particle Swarm Optimization (PSO) based sequence clustering approach and presents an experimentally investigation of the PSO based sequence clustering methods, which use three original PSO variants and their corresponding variants of a hybrid PSO with real value mutation. The investigation was conducted in 45 test cases using five web user session datasets extracted from a real world web site. The experimental results of these methods are compared with the results obtained from the traditional k-means clustering method. Some interesting observations have been made. In the most of test cases under consideration, the PSO and PSO-RVM methods have better performance than the k-means method. Furthermore, the PSO-RVM methods show better performance than the corresponding PSO methods in the cases in which the similarity measure function is more complex.

[1]  Pradeep Kumar,et al.  SeqPAM: A Sequence Clustering Algorithm for Web Personalization , 2007, Int. J. Data Warehous. Min..

[2]  Tharam S. Dillon,et al.  Experimental study of a new hybrid PSO with mutation for economic dispatch with non-smooth cost function , 2010 .

[3]  Marielba Zacarias,et al.  Approaching Process Mining with Sequence Clustering: Experiments and Findings , 2007, BPM.

[4]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[5]  R. Eberhart,et al.  Comparing inertia weights and constriction factors in particle swarm optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[6]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[7]  Yongmin Kim,et al.  An Efficient Similarity Measure for Clustering of Categorical Sequences , 2006, Australian Conference on Artificial Intelligence.

[8]  Ujjwal Maulik,et al.  Genetic algorithm-based clustering technique , 2000, Pattern Recognit..

[9]  Hitoshi Iba,et al.  Particle swarm optimization with Gaussian mutation , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[10]  Shokri Z. Selim,et al.  K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Ching-Yi Chen,et al.  Alternative KPSO-Clustering Algorithm , 2005 .

[12]  Bamshad Mobasher,et al.  Data Mining for Web Personalization , 2007, The Adaptive Web.

[13]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[14]  Venu Govindaraju,et al.  Generalized regression model for sequence matching and clustering , 2007, Knowledge and Information Systems.

[15]  Gillian Dobbie,et al.  Particle Swarm Optimization Based Clustering of Web Usage Data , 2008, 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.