Interval data clustering using self-organizing maps based on adaptive Mahalanobis distances - CentraleSupélec Access content directly
Journal Articles Neural Networks Year : 2013

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

Hani Hamdan

Abstract

The self-organizing map is a kind of artificial neural network used to map high dimensional data into a low dimensional space. 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. Two methods based on the batch training algorithm for the self-organizing maps are proposed. The first method uses a common Mahalanobis distance for all clusters. In the second method, the algorithm starts with a common Mahalanobis distance per cluster and then switches to use a different distance per cluster. This process allows a more adapted clustering for the given data set. The performances of the proposed methods are compared and discussed using artificial and real interval data sets.

Dates and versions

hal-00862571 , version 1 (17-09-2013)

Identifiers

Cite

Chantal Hajjar, Hani Hamdan. Interval data clustering using self-organizing maps based on adaptive Mahalanobis distances. Neural Networks, 2013, 46, pp.124-132. ⟨10.1016/j.neunet.2013.04.009⟩. ⟨hal-00862571⟩
65 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More