1966
DOI: 10.1177/001316446602600402
|View full text |Cite
|
Sign up to set email alerts
|

Similarity Analysis by Reciprocal Pairs for Discrete and Continuous Data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
81
0
6

Year Published

1986
1986
2022
2022

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 159 publications
(87 citation statements)
references
References 2 publications
0
81
0
6
Order By: Relevance
“…Next, a symmetric matrix E = (D + D T ) / 2 was created. We then used E to hierarchically cluster the LRR proteins with the method of McQuitty (38) and the hclust function in the R programming language. The clustering result was combined with positional information for each LRR class in each LRR protein using a Perl program and visualized using the representation scheme described previously (39).…”
Section: Methodsmentioning
confidence: 99%
“…Next, a symmetric matrix E = (D + D T ) / 2 was created. We then used E to hierarchically cluster the LRR proteins with the method of McQuitty (38) and the hclust function in the R programming language. The clustering result was combined with positional information for each LRR class in each LRR protein using a Perl program and visualized using the representation scheme described previously (39).…”
Section: Methodsmentioning
confidence: 99%
“…Several agglomeration methods are also provided by the NbClust package, namely: Ward (Ward 1963), single (Florek, Lukaszewicz, Perkal, and Zubrzycki 1951;Sokal and Michener 1958), complete (Sørensen 1948), average (Sokal and Michener 1958), McQuitty (McQuitty 1966), median (Gower 1967) and centroid (Sokal and Michener 1958). All of these methods and distance measures are described in detail in Section 3.…”
Section: Indexmentioning
confidence: 99%
“…It can be defined, for example as the distance of the elements that are the farthest away in two clusters (complete-linkage;Sorensen 1948), the shortest distance between two elements not yet belonging to the same cluster (single; Sokal & Michener 1958), the average distance of the elements inside two clusters (average; Sokal & Michener 1958), and the squared Euclidean distance between the gravity centres of two clusters (centroid; Sokal & Michener 1958). Linkage criteria also can be determined with the weighted mean of the between-cluster distances (McQuitty;McQuitty 1966), the median of the between-cluster distances (median; Gower 1966), or with minimizing withincluster variance (Ward and its second variant;Ward 1963;Murtagh & Legendre 2014).…”
Section: C3 Hierarchical Clusteringmentioning
confidence: 99%