1982
DOI: 10.2307/2287316
|View full text |Cite
|
Sign up to set email alerts
|

A Hybrid Clustering Method for Identifying High-Density Clusters

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0
1

Year Published

1989
1989
2011
2011

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 33 publications
(17 citation statements)
references
References 0 publications
0
16
0
1
Order By: Relevance
“…The SASS System provides six kinds of programs for cluster analyses; i. e., average linkage (Sokal and Michener 1958), centroid hierarchical (Sokal and Michener 1958), density linkage (Wong 1982, Wong andLane 1983), single linkage (Florek et a/. 1951, McQuitty 1957, McQuitty 1966, Sneath 1957), two-stage density, and Ward's minimum variance (Ward 1963) cluster analyses.…”
Section: Discussionmentioning
confidence: 99%
“…The SASS System provides six kinds of programs for cluster analyses; i. e., average linkage (Sokal and Michener 1958), centroid hierarchical (Sokal and Michener 1958), density linkage (Wong 1982, Wong andLane 1983), single linkage (Florek et a/. 1951, McQuitty 1957, McQuitty 1966, Sneath 1957), two-stage density, and Ward's minimum variance (Ward 1963) cluster analyses.…”
Section: Discussionmentioning
confidence: 99%
“…130-145], based on [54]) is carried out on eight MCA first principal axes, accounting for a significant proportion of the inertia contained in the data table. This process starts by choosing a partition in a number of clusters with random initial centres and then updating those centres calculating the centroids of the groups of individuals nearest to the centres (K-means algorithm); the process is repeated until the clusters are stable.…”
Section: Mca Of Categorical Variables and Clusteringmentioning
confidence: 99%
“…The former are implemented by sequentially merging or dividing groups of observations into proper clusters, while the latter attempt to group the observations into a predetermined number of clusters. The hierarchical algorithms include single linkage (or nearest neighbor), average linkage (or average distance), centroid linkage, complete linkage (or farthest neighbor), minimum variance method [14], and hybrid method [15], amongst others. The non-hierarchical algorithms include K-means [16], Euclidean cluster analysis [17], and algorithm by Friedman and Rubin [18].…”
Section: Literature Reviewsmentioning
confidence: 99%