Clustering data by inhomogeneous chaotic map lattices

Details Clustering data by inhomogeneous chaotic map lattices Clustering data by inhomogeneous chaotic map lattices

2000-01-31

arxiv.org/abs/cond-mat/0001445v2

Physical Review Letters 85 (2000) 554

Physics

Condensed Matter

Statistical Mechanics

8 pages, 6 figures. Revised version accepted for publication on Physical Review Letters

Scientific paper

10.1103/PhysRevLett.85.554

A new approach to clustering, based on the physical properties of inhomogeneous coupled chaotic maps, is presented. A chaotic map is assigned to each data-point and short range couplings are introduced. The stationary regime of the system corresponds to a macroscopic attractor independent of the initial conditions. The mutual information between couples of maps serves to partition the data set in clusters, without prior assumptions about the structure of the underlying distribution of the data. Experiments on simulated and real data sets show the effectiveness of the proposed algorithm.

Affiliated with

Also associated with

No associations

Rating

Clustering data by inhomogeneous chaotic map lattices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Clustering data by inhomogeneous chaotic map lattices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clustering data by inhomogeneous chaotic map lattices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-204634