Data Clustering using Self-Organizing Maps segmented by Mathematic Morphology and Simplified Cluster Validity Indexes: an application in remotely sensed images

Author(s):  
M.L. Goncalves ◽  
M.L. de Andrade Netto ◽  
J.A.F. Costa ◽  
J. Zullo
2017 ◽  
Vol 25 (6) ◽  
pp. 1020-1033 ◽  
Author(s):  
Leandro Antonio Pasa ◽  
José Alfredo F. Costa ◽  
Marcial Guerra de Medeiros

Abstract Data Clustering aims to discover groups within the data based on similarities, with a minimal, if any, knowledge of their structure. Variations in the results may occur due to many factors, including algorithm parameters, initialization and stopping criteria. The usage of different attributes or even different subsets of data usually lead to different results. Self-organizing maps (SOM) has been widely used for a variety of tasks regarding data analysis, including data visualization and clustering. A machine committee, or ensemble, is a set of neural networks working independently with some system that enable the combination of individual results into a single output, with the aim to achieve a better generalization compared to a unique neural network. This article presents a new ensemble method that uses SOM networks. Cluster validity indexes are used to combine neuron weights from different maps with different sizes. Results are shown from simulations with real and synthetic data, from the UCI Repository and Fundamental Clustering Problems Suite. The proposed method presented promising results, with increased performance compared with conventional single Kohonen map.


Author(s):  
Olcay Akman ◽  
Timothy Comar ◽  
Daniel Hrozencik ◽  
Josselyn Gonzales

2017 ◽  
Vol 133 ◽  
pp. 234-254 ◽  
Author(s):  
Diego S. Comas ◽  
Juan I. Pastore ◽  
Agustina Bouchet ◽  
Virginia L. Ballarin ◽  
Gustavo J. Meschino

Algorithms ◽  
2020 ◽  
Vol 13 (5) ◽  
pp. 109 ◽  
Author(s):  
Marian B. Gorzałczany ◽  
Filip Rudziński

In this paper, we briefly present several modifications and generalizations of the concept of self-organizing neural networks—usually referred to as self-organizing maps (SOMs)—to illustrate their advantages in applications that range from high-dimensional data visualization to complex data clustering. Starting from conventional SOMs, Growing SOMs (GSOMs), Growing Grid Networks (GGNs), Incremental Grid Growing (IGG) approach, Growing Neural Gas (GNG) method as well as our two original solutions, i.e., Generalized SOMs with 1-Dimensional Neighborhood (GeSOMs with 1DN also referred to as Dynamic SOMs (DSOMs)) and Generalized SOMs with Tree-Like Structures (GeSOMs with T-LSs) are discussed. They are characterized in terms of (i) the modification mechanisms used, (ii) the range of network modifications introduced, (iii) the structure regularity, and (iv) the data-visualization/data-clustering effectiveness. The performance of particular solutions is illustrated and compared by means of selected data sets. We also show that the proposed original solutions, i.e., GeSOMs with 1DN (DSOMs) and GeSOMS with T-LSs outperform alternative approaches in various complex clustering tasks by providing up to 20 % increase in the clustering accuracy. The contribution of this work is threefold. First, algorithm-oriented original computer-implementations of particular SOM’s generalizations are developed. Second, their detailed simulation results are presented and discussed. Third, the advantages of our earlier-mentioned original solutions are demonstrated.


Sign in / Sign up

Export Citation Format

Share Document