A New Clustering Algorithm Based Upon Flocking On Complex Network

12/30/2008
by   Qiang Li, et al.
0

We have proposed a model based upon flocking on a complex network, and then developed two clustering algorithms on the basis of it. In the algorithms, firstly a k-nearest neighbor (knn) graph as a weighted and directed graph is produced among all data points in a dataset each of which is regarded as an agent who can move in space, and then a time-varying complex network is created by adding long-range links for each data point. Furthermore, each data point is not only acted by its k nearest neighbors but also r long-range neighbors through fields established in space by them together, so it will take a step along the direction of the vector sum of all fields. It is more important that these long-range links provides some hidden information for each data point when it moves and at the same time accelerate its speed converging to a center. As they move in space according to the proposed model, data points that belong to the same class are located at a same position gradually, whereas those that belong to different classes are away from one another. Consequently, the experimental results have demonstrated that data points in datasets are clustered reasonably and efficiently, and the rates of convergence of clustering algorithms are fast enough. Moreover, the comparison with other algorithms also provides an indication of the effectiveness of the proposed approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/30/2008

A Novel Clustering Algorithm Based Upon Games on Evolving Network

This paper introduces a model based upon games on an evolving network, a...
research
12/03/2008

A Novel Clustering Algorithm Based on Quantum Games

Enormous successes have been made by quantum algorithms during the last ...
research
02/16/2015

Clustering by Descending to the Nearest Neighbor in the Delaunay Graph Space

In our previous works, we proposed a physically-inspired rule to organiz...
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
07/23/2021

Text Classification and Clustering with Annealing Soft Nearest Neighbor Loss

We define disentanglement as how far class-different data points from ea...
research
08/22/2019

Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms

Given a data set D containing millions of data points and a data consume...
research
08/05/2014

Multilayer bootstrap networks

Multilayer bootstrap network builds a gradually narrowed multilayer nonl...

Please sign up or login with your details

Forgot password? Click here to reset