Local Variance Driven Self-Organization for Unsupervised Clustering

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 approa...

Full description

Saved in:
Bibliographic Details
Main Authors: Kyan, M., Ling Guan
Format: Conference Proceeding
Language:English
Subjects:
Bioinformatics
Clustering algorithms
Data mining
Genetics
Hebbian theory
Mining industry
Partitioning algorithms
Pattern recognition
Prototypes
Unsupervised learning
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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
ISSN:1051-4651
2831-7475
DOI:10.1109/ICPR.2006.772