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

Demir G. N., Uyar A. Ş., Öğüdücü Ş.

Annual Conference of Genetic and Evolutionary Computation Conference, London, Canada, 7 - 11 July 2007, pp.1943-1950 identifier

  • Publication Type: Conference Paper / Full Text
  • City: London
  • Country: Canada
  • Page Numbers: pp.1943-1950
  • Istanbul Technical University Affiliated: Yes


In web recommender systems, clustering is done offline to extract usage patterns and a successful recommendation highly depends oil the quality, Of this clustering solution. lit these types of applications, data to be clustered is in the form of user sessions which area 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 session,, 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 oil sample data sets and the most suitable approach is determined.