Clustering hierarchical data using self-organizing map: A graph-theoretical approach

8Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The application of Self-Organizing Map (SOM) to hierarchical data remains an open issue, because such data lack inherent quantitative information. Past studies have suggested binary encoding and Generalizing SOM as techniques that transform hierarchical data into numerical attributes. Based on graph theory, this paper puts forward a novel approach that processes hierarchical data into a numerical representation for SOM-based clustering. The paper validates the proposed graph-theoretical approach via complexity theory and experiments on real-life data. The results suggest that the graph-theoretical approach has lower algorithmic complexity than Generalizing SOM, and can yield SOM having significantly higher cluster validity than binary encoding does. Thus, the graph-theoretical approach can form a data-preprocessing step that extends SOM to the domain of hierarchical data. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Argyrou, A. (2009). Clustering hierarchical data using self-organizing map: A graph-theoretical approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5629 LNCS, pp. 19–27). https://doi.org/10.1007/978-3-642-02397-2_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free