Affordable Access

A comparison between dissimilarity SOM and kernel SOM for clustering the vertices of a graph

Authors
Publisher
University Library of Bielefeld
Publication Date
Keywords
  • Kernel Som
  • Dissimilarity
  • Graph
  • Data Processing
  • Computer Science
  • Computer Systems
Disciplines
  • Computer Science
  • Mathematics

Abstract

Flexible and efficient variants of the Self Organizing Map algorithm have been proposed for non vector data, including, for example, the dissimilarity SOM (also called the Median SOM) and several kernelized versions of SOM. Although the first one is a generalization of the batch version of the SOM algorithm to data described by a dissimilarity measure, the various versions of the second ones are stochastic SOM. We propose here to introduce a batch version of the kernel SOM and to show how this one is related to the dissimilarity SOM. Finally, an application to the classification of the vertices of a graph is proposed and the algorithms are tested and compared on a simulated data set.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

On the number of P-vertices of some graphs

on Linear Algebra and its Applica... Jan 01, 2011

Graphs with noM-alternating path between two verti...

on Discrete Mathematics Jan 01, 2004

A comparison of the stability characteristics of s...

on IEEE Transactions on Pattern A... April 1981

Reducing the dimensionality of dissimilarity space...

on Engineering Applications of Ar... Jan 01, 2009
More articles like this..