2013 Special Issue: Growing self-organizing trees for autonomous hierarchical clustering

Authors:
Nhat-Quang Doan;Hanane Azzag;Mustapha Lebbah
Affiliations:
-;-;-
Venue:
Neural Networks
Year:
2013

Citing 10
Cited 0

Molecular computation of solutions to combinatorial problems

Science
The Self-Organizing Map of Trees

Neural Processing Letters
S-TREE: self-organizing trees for data clustering and online vector quantization

Neural Networks
Self-Organization in Biological Systems

Self-Organization in Biological Systems
Cluster ensembles --- a knowledge reuse framework for combining multiple partitions

The Journal of Machine Learning Research
Minimum Spanning Tree Based Clustering Algorithms

ICTAI '06 Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence
Self-assembling graphs

Natural Computing: an international journal
Unsupervised feature selection for multi-cluster data

Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Complexity of graph self-assembly in accretive systems and self-destructible systems

DNA'05 Proceedings of the 11th international conference on DNA Computing
On the complexity of graph self-assembly in accretive systems

DNA'06 Proceedings of the 12th international conference on DNA Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new unsupervised learning method based on growing processes and autonomous self-assembly rules. This method, called Growing Self-organizing Trees (GSoT), can grow both network size and tree topology to represent the topological and hierarchical dataset organization, allowing a rapid and interactive visualization. Tree construction rules draw inspiration from elusive properties of biological organization to build hierarchical structures. Experiments conducted on real datasets demonstrate good GSoT performance and provide visual results that are generated during the training process.