• Corpus ID: 88523069

Batch Self Organizing maps for distributional data using adaptive distances

@inproceedings{Irpino2018BatchSO,
  title={Batch Self Organizing maps for distributional data using adaptive distances},
  author={Antonio Irpino and Francisco de A. T. de Carvalho and Rosanna Verde and Antonio Balzanella},
  year={2018},
  url={https://api.semanticscholar.org/CorpusID:88523069}
}
An adaptive version of the DBSOM algorithm that tackles the different contribution of the variables with an additional step: a relevance weight is automatically learned for each distributional-valued variable.
[PDF] Semantic Reader
1 Citation

Figures and Tables from this paper

One Citation

Discriminant analysis of distributional data via fractional programming

54 References

Fuzzy clustering of distributional data with automatic weighting of variable components

Batch SOM algorithms for interval-valued data with automatic weighting of the variables

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

This paper presents a self-organizing map for interval-valued data based on adaptive Mahalanobis distances in order to do clustering of interval data with topology preservation.

Essentials of the self-organizing map

Self-organizing map based on L2 distance for interval-valued data

An algorithm to train the self-organizing map for interval data is proposed using an extension of the Euclidian distance to compare two vectors of intervals and is applied on real interval data issued from meteorological stations in China.

Self-organizing map based on hausdorff distance for interval-valued data

This paper proposes an algorithm to train the self-organizing map for interval data using the Hausdorff distance to compare two vectors of intervals and applies it on real interval data issued from meteorological stations in China.

Fuzzy clustering of distribution-valued data using an adaptive L2 Wasserstein distance

A fuzzy c-means algorithm based on an adaptive L2-Wasserstein distance for histogram-valued data is proposed and the effectiveness of the proposed algorithm is demonstrated through experiments with synthetic and real-world datasets.

Dynamic clustering of histogram data based on adaptive squared Wasserstein distances

Self-Organizing Map Based on City-Block Distance for Interval-Valued Data

This paper proposes an algorithm to train the self-organizing map for interval data using the city-block distance to compare two vectors of intervals and applies it on real interval data issued from meteorological stations in France.

A New Wasserstein Based Distance for the Hierarchical Clustering of Histogram Symbolic Data

A new distance is presented, based on the Wasserstein metric, in order to cluster a set of data described by distributions with finite continue support, or, as called in SDA, by “histograms”, a measure of inertia of data with respect to a barycenter that satisfies the Huygens theorem of decomposition of inertia.
...