By Topic

Local Variance Driven Self-Organization for Unsupervised 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)
Kyan, M. ; Sydney Univ., NSW ; Ling Guan

We propose a new, novel unsupervised clustering technique based on traditional Kohonen self organization, competitive Hebbian learning (CHL), and the Hebbian based maximum eigenfilter (HME). This method fits into the family of dynamic self-generating, self-organizing map (SOM) algorithms. The approach uses a vigilance based, global parsing strategy as a guide for the hierarchical partitioning of an underlying data distribution into a set of dominant prototypes: each consisting of a dual memory element for the online estimation of both position and maximal local variance. A co-operative scheme exploits the interplay between global vigilance and maximal local variance such that an informed choice may be made regarding insertion sites for new nodes into the map. The network is related to self-organizing tree maps (SOTM), growing neural gas (GNG) and their variants. A framework is presented and performance demonstrated against GNG

Published in:

Pattern Recognition, 2006. ICPR 2006. 18th International Conference on  (Volume:3 )

Date of Conference:

0-0 0