Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
102 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Une adaptation des cartes auto-organisatrices pour des données décrites par un tableau de dissimilarités (0709.3586v1)

Published 22 Sep 2007 in cs.NE and cs.LG

Abstract: Many data analysis methods cannot be applied to data that are not represented by a fixed number of real values, whereas most of real world observations are not readily available in such a format. Vector based data analysis methods have therefore to be adapted in order to be used with non standard complex data. A flexible and general solution for this adaptation is to use a (dis)similarity measure. Indeed, thanks to expert knowledge on the studied data, it is generally possible to define a measure that can be used to make pairwise comparison between observations. General data analysis methods are then obtained by adapting existing methods to (dis)similarity matrices. In this article, we propose an adaptation of Kohonen's Self Organizing Map (SOM) to (dis)similarity data. The proposed algorithm is an adapted version of the vector based batch SOM. The method is validated on real world data: we provide an analysis of the usage patterns of the web site of the Institut National de Recherche en Informatique et Automatique, constructed thanks to web log mining method.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Aïcha El Golli (3 papers)
  2. Fabrice Rossi (72 papers)
  3. Brieuc Conan-Guez (12 papers)
  4. Yves Lechevallier (5 papers)
Citations (9)

Summary

We haven't generated a summary for this paper yet.