The novel hierarchical clustering approach using self‐organizing map with optimum dimension selection

Fuente: Wiley Open Access
Salvato in:
Dettagli Bibliografici
Autore principale: Kshitij Tripathi
Natura: Artículo Open Access
Pubblicazione: Wiley 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1867005095742275584
author Kshitij Tripathi
author_facet Kshitij Tripathi
Kshitij Tripathi
collection Wiley Open Access
contents The novel hierarchical clustering approach using self‐organizing map with optimum dimension selection Kshitij Tripathi Health Care Science AbstractIntroductionData clustering is an important field of machine learning that has applicability in wide areas, like, business analysis, manufacturing, energy, healthcare, traveling, and logistics. A variety of clustering applications have already been developed. Data clustering approaches based on self‐organizing map (SOM) generally use the map dimensions (of the grid) ranging from 2 × 2 to 8 × 8 (4–64 neurons [microclusters]) without any explicit reason for using the particular dimension, and therefore optimized results are not obtained. These algorithms use some secondary approaches to map these microclusters into the lower dimension (actual number of clusters), like, 2, 3, or 4, as the case may be, based on the optimum number of clusters in the specific data set. The secondary approach, observed in most of the works, is not SOM and is an algorithm, like, cut tree or the other.MethodsIn this work, the proposed approach will give an idea of how to select the most optimal higher dimension of SOM for the given data set, and this dimension is again clustered into the lower actual dimension. Primary and secondary, both utilize the SOM to cluster the data and discover that the weight matrix of the SOM is very meaningful. The optimized two‐dimensional configuration of SOM is not the same for every data set, and this work also tries to discover this configuration.ResultsThe adjusted randomized index obtained on the Iris, Wine, Wisconsin diagnostic breast cancer, New Thyroid, Seeds, A1, Imbalance, Dermatology, Ecoli, and Ionosphere is, respectively, 0.7173, 0.9134, 0.7543, 0.8041, 0.7781, 0.8907, 0.8755, 0.7543, 0.5013, and 0.1728, which outperforms all other results available on the web and when no reduction of attributes is done in this work.ConclusionsIt is found that SOM is superior to or on par with other clustering approaches, like, k‐means or the other, and could be used successfully to cluster all types of data sets. Ten benchmark data sets from diverse domains like medical, biological, and chemical are tested in this work, including the synthetic data sets. 10.1002/hcs2.90 http://creativecommons.org/licenses/by-nc/4.0/
doi_str_mv 10.1002/hcs2.90
format Artículo Open Access
id wiley_oa_10_1002_hcs2_90
institution Wiley Open Access
license_str_mv http://creativecommons.org/licenses/by-nc/4.0/
publishDate 2024
publisher Wiley
record_format wiley_oa
spellingShingle The novel hierarchical clustering approach using self‐organizing map with optimum dimension selection
Kshitij Tripathi
Health Care Science
The novel hierarchical clustering approach using self‐organizing map with optimum dimension selection Kshitij Tripathi Health Care Science AbstractIntroductionData clustering is an important field of machine learning that has applicability in wide areas, like, business analysis, manufacturing, energy, healthcare, traveling, and logistics. A variety of clustering applications have already been developed. Data clustering approaches based on self‐organizing map (SOM) generally use the map dimensions (of the grid) ranging from 2 × 2 to 8 × 8 (4–64 neurons [microclusters]) without any explicit reason for using the particular dimension, and therefore optimized results are not obtained. These algorithms use some secondary approaches to map these microclusters into the lower dimension (actual number of clusters), like, 2, 3, or 4, as the case may be, based on the optimum number of clusters in the specific data set. The secondary approach, observed in most of the works, is not SOM and is an algorithm, like, cut tree or the other.MethodsIn this work, the proposed approach will give an idea of how to select the most optimal higher dimension of SOM for the given data set, and this dimension is again clustered into the lower actual dimension. Primary and secondary, both utilize the SOM to cluster the data and discover that the weight matrix of the SOM is very meaningful. The optimized two‐dimensional configuration of SOM is not the same for every data set, and this work also tries to discover this configuration.ResultsThe adjusted randomized index obtained on the Iris, Wine, Wisconsin diagnostic breast cancer, New Thyroid, Seeds, A1, Imbalance, Dermatology, Ecoli, and Ionosphere is, respectively, 0.7173, 0.9134, 0.7543, 0.8041, 0.7781, 0.8907, 0.8755, 0.7543, 0.5013, and 0.1728, which outperforms all other results available on the web and when no reduction of attributes is done in this work.ConclusionsIt is found that SOM is superior to or on par with other clustering approaches, like, k‐means or the other, and could be used successfully to cluster all types of data sets. Ten benchmark data sets from diverse domains like medical, biological, and chemical are tested in this work, including the synthetic data sets. 10.1002/hcs2.90 http://creativecommons.org/licenses/by-nc/4.0/
title The novel hierarchical clustering approach using self‐organizing map with optimum dimension selection
topic Health Care Science
url https://onlinelibrary.wiley.com/doi/10.1002/hcs2.90