Interval data clustering using self-organizing maps based on adaptive Mahalanobis distances
From MaRDI portal
Publication:461140
DOI10.1016/j.neunet.2013.04.009zbMath1296.68129OpenAlexW2045527658WikidataQ30638269 ScholiaQ30638269MaRDI QIDQ461140
Publication date: 10 October 2014
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2013.04.009
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (8)
A hierarchical clustering method for random intervals based on a similarity measure ⋮ Batch self-organizing maps for distributional data with an automatic weighting of variables and components ⋮ A novel data-driven visualization of \(n\)-dimensional feasible region using interpretable self-organizing maps (iSOM) ⋮ The fuzzy cluster analysis for interval value using genetic algorithm and its application in image recognition ⋮ Automatic clustering algorithm for interval data based on overlap distance ⋮ Interval-valued functional clustering based on the Wasserstein distance with application to stock data ⋮ An automatic clustering for interval data using the genetic algorithm ⋮ A survey of neighborhood construction algorithms for clustering and classifying data points
Cites Work
This page was built for publication: Interval data clustering using self-organizing maps based on adaptive Mahalanobis distances
