2008
DOI: 10.1016/j.patrec.2008.04.008
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic clustering of interval data using a Wasserstein-based distance

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

1
72
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 110 publications
(73 citation statements)
references
References 12 publications
1
72
0
Order By: Relevance
“…Then, a basic belief assignment (BBA) is represented by a set of belief intervals, which can also be considered as a set of interval numbers or data. For two different BBAs, we calculate the distance between their corresponding focal element's belief intervals using the distance of interval numbers [12]. Based on the interval distance values corresponding to different focal elements, we propose an Euclidean-family distance based on sum of squares, and a Chebyshev-family distance based on the maximum selection, respectively.…”
Section: Introductionmentioning
confidence: 99%
“…Then, a basic belief assignment (BBA) is represented by a set of belief intervals, which can also be considered as a set of interval numbers or data. For two different BBAs, we calculate the distance between their corresponding focal element's belief intervals using the distance of interval numbers [12]. Based on the interval distance values corresponding to different focal elements, we propose an Euclidean-family distance based on sum of squares, and a Chebyshev-family distance based on the maximum selection, respectively.…”
Section: Introductionmentioning
confidence: 99%
“…From a computational point of view, the difficulties of computing an exact value for S 2 W (Y ) is related to the possibility of computing the ρ i,j . Irpino and Verde [15], Irpino et al [14] proposed a closed form for computing the squared Wasserstein distance between two histogram-valued data and from that formation it is also possible to derive the closed form related to ρ i,j . The computation is also done in a time that is linear with respect to the number of bins of the histograms.…”
Section: Definitionmentioning
confidence: 99%
“…Another result presented in [15,14] is related to the variance decomposition in a framework of clustering analysis of histogram-valued data. [15,14], after showing that the ℓ 2 Wasserstein distance is an extension of the Euclidean distance between quantile functions, the authors showed that it was possible to obtain a decomposition of the variability of a set of histograms according to the Huygens theorem of decomposition of the inertia and used such properties for extending some clustering methods for standard data to histogram-valued data.…”
Section: Definitionmentioning
confidence: 99%
See 1 more Smart Citation
“…Several distances between interval objects have been extended to distances between hyperrectangles and remain a subject of research in automatic classification. These include the distance based on city block distance [1], Hausdorff distance between hyperrectangles, Wasserstein based distance [2], and single adaptive distance [3]. Finally, the third type of reduction leads to new uncorrelated variables but poses significant mathematical problems such as the search for compromise space and the number of observations to be used for the reduction of each entry table (see [4,5]).…”
Section: Introductionmentioning
confidence: 99%