Interval data clustering using self-organizing maps based on adaptive Mahalanobis distances

2013 ◽  
Vol 46 ◽  
pp. 124-132 ◽  
Author(s):  
Chantal Hajjar ◽  
Hani Hamdan
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.


Author(s):  
Marjan Vračko ◽  
Subhash C. Basak ◽  
Dwaipayan Sen ◽  
Ashesh Nandy

: In this report we consider a data set, which consists of 310 Zika virus genome sequences taken from different continents, Africa, Asia and South America. The sequences, which were compiled from GenBank, were derived from the host cells of different mammalian species (Simiiformes, Aedes opok, Aedes africanus, Aedes luteocephalus, Aedes dalzieli, Aedes aegypti, and Homo sapiens). For chemometrical treatment the sequences have been represented by sequence descriptors derived from their graphs or neighborhood matrices. The set was analyzed with three chemometrical methods: Mahalanobis distances, principal component analysis (PCA) and self organizing maps (SOM). A good separation of samples with respect to the region of origin was observed using these three methods. Background: Study of 310 Zika virus genome sequences from different continents. Objective: To characterize and compare Zika virus sequences from around the world using alignment-free sequence comparison and chemometrical methods. Method: Mahalanobis distance analysis, self organizing maps, principal components were used to carry out the chemometrical analyses of the Zika sequence data. Results: Genome sequences are clustered with respect to the region of origin (continent, country) Conclusion: Africa samples are well separated from Asian and South American ones.


Sign in / Sign up

Export Citation Format

Share Document