Graph-based Sequence Clustering through Multiobjective Evolutionary Algorithms for Web Recommender Systems


In web recommender systems, clustering is done offline to extract usage patterns and a successful recommendation highly depends on the quality of this clustering solution. In these types of applications, data to be clustered is in the form of user sessions which are sequences of web pages visited by the user. Sequence clustering is one of the important tools to work with this type of data. One way to represent sequence data is through weighted, undirected graphs where each sequence is a vertex and the pairwise similarities between the user sessions are the edges. Through this representation, the problem becomes equivalent to graph partitioning which is NP-complete and is best approached using multiple objectives. Hence it is suitable to use multiobjective evolutionary algorithms (MOEA) to solve it. The main focus of this paper is to determine an effective MOEA to cluster sequence data. Several existing approaches in literature are compared on sample data sets and the most suitable approach is determined

Similar works

This paper was published in CiteSeerX.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.