Learning Web Users Profiles With Relational Clustering Algorithms - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Learning Web Users Profiles With Relational Clustering Algorithms

Résumé

In the context of web personalization and dynamic content recommendation, it is crucial to learn typical user profiles. Although there exists several approaches to mine user profiles (such as association rules or sequential patterns extraction), this paper focuses on the application of relational clustering algorithms on web usage data to characterize user access profiles. These methods rely on the definition of a distance (or dissimilarity) measure between user sessions and thus can carry more information (content, sequence of page views, context of navigation) than simple transactions. Moreover, as web user sessions are often noisy, uncertain or inaccurate (because of proxy web server, local browser cache and sessions building heuristics), we propose to use two clustering algorithms: the leader Ant clustering algorithm that is inspired by the chemical recognition system of ants and a new variant of the fuzzy C Medoids. The paper also describes the similarity measures used to compare these algorithms with the traditional fuzzy C Medoids on real web usage data sets from French museums. The evaluation is conducted according to the quality of the output partitions and the interpretability of each cluster based on its content.
Fichier non déposé

Dates et versions

hal-01335966 , version 1 (22-06-2016)

Identifiants

  • HAL Id : hal-01335966 , version 1

Citer

Nicolas Labroche. Learning Web Users Profiles With Relational Clustering Algorithms. Workshop On Intelligent Techniques for Web Personalization, AAAI 2007 Conference, Jul 2007, Vancouver, Canada. pp.54-64. ⟨hal-01335966⟩
47 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More