Neural Network Clustering Based on Distances Between Objects

08/29/2006
by   Leonid B. Litinskii, et al.
0

We present an algorithm of clustering of many-dimensional objects, where only the distances between objects are used. Centers of classes are found with the aid of neuron-like procedure with lateral inhibition. The result of clustering does not depend on starting conditions. Our algorithm makes it possible to give an idea about classes that really exist in the empirical data. The results of computer simulations are presented.

READ FULL TEXT
research
11/29/2019

Minkowski distances and standardisation for clustering and classification of high dimensional data

There are many distance-based methods for classification and clustering,...
research
01/18/2016

Zero-error dissimilarity based classifiers

We consider general non-Euclidean distance measures between real world o...
research
11/12/2021

A comprehensive study of clustering a class of 2D shapes

The paper concerns clustering with respect to the shape and size of 2D c...
research
06/11/2021

Rao distances and Conformal Mapping

In this article, we have described the Rao distance (due to C.R. Rao) an...
research
04/11/2018

Seed-Point Detection of Clumped Convex Objects by Short-Range Attractive Long-Range Repulsive Particle Clustering

Locating the center of convex objects is important in both image process...
research
06/08/2020

An Algorithmic Introduction to Clustering

This paper tries to present a more unified view of clustering, by identi...
research
08/20/2020

Prototype-based interpretation of the functionality of neurons in winner-take-all neural networks

Prototype-based learning (PbL) using a winner-take-all (WTA) network bas...

Please sign up or login with your details

Forgot password? Click here to reset