Cart (Loading....) | Create Account
Close category search window
 

Self-organization of pulse-coupled oscillators with application to clustering

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Rhouma, M.B.H. ; Dept. of Math., Georgia Inst. of Technol., Atlanta, GA, USA ; Frigui, H.

We introduce an efficient synchronization model that organizes a population of integrate-and-fire oscillators into stable and structured groups. Each oscillator fires synchronously with all the others within its group, but the groups themselves fire with a constant phase difference. The structure of the synchronized groups depends on the choice of the coupling function. We show that by defining the interaction between oscillators according to the relative distance between them, our model can be used as a general clustering algorithm. Unlike existing models, our model incorporates techniques from relational and prototype-based clustering methods and results in a clustering algorithm that is simple, efficient, robust, unbiased by the size of the clusters, and that can find an arbitrary number of clusters. In addition to helping the model self-organize into stable groups, the synergy between clustering and synchronization reduces the computational complexity significantly. The resulting clustering algorithm has several advantages over conventional clustering techniques. In particular, it can generate a nested sequence of partitions and it can determine the optimum number of clusters in an efficient manner. Moreover, since our approach does not involve optimizing an objective function, it is not sensitive to initialization and it can incorporate nonmetric similarity measures. We illustrate the performance of our algorithms with several synthetic and real data sets

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:23 ,  Issue: 2 )

Date of Publication:

Feb 2001

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.