2015
DOI: 10.1007/s00180-015-0590-x
|View full text |Cite
|
Sign up to set email alerts
|

Combining dissimilarity matrices by using rank correlations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 18 publications
0
3
0
Order By: Relevance
“…To this end, the corresponding rows and columns of radial lines within Π are removed. To cluster the remaining branches using the reduced Π, Π , the dissimilarity matrix [28] needs to be obtained for Π . The dissimilarity matrix ( ) for Π is calculated as follow:…”
Section: Test System Preparationmentioning
confidence: 99%
See 1 more Smart Citation
“…To this end, the corresponding rows and columns of radial lines within Π are removed. To cluster the remaining branches using the reduced Π, Π , the dissimilarity matrix [28] needs to be obtained for Π . The dissimilarity matrix ( ) for Π is calculated as follow:…”
Section: Test System Preparationmentioning
confidence: 99%
“…Where is the all-ones matrix [28]: this subtraction ensures that tightly meshed lines will have low dissimilarity to each other. Then, the diagonal components in are artificially set to zero, and it is a symmetric and square matrix.…”
Section: Test System Preparationmentioning
confidence: 99%
“…() is the square of the Pearson correlation between them[3]. A value of a r,s equal zero or near zero implies that the two matrices are not linearly related, whereas a value close to one indicates a strong linear relationship between B s and B r .…”
mentioning
confidence: 99%