1992
DOI: 10.2307/1269576
|View full text |Cite
|
Sign up to set email alerts
|

Finding Groups in Data: An Introduction to Cluster Analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

3
653
0
39

Year Published

2016
2016
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 525 publications
(695 citation statements)
references
References 0 publications
3
653
0
39
Order By: Relevance
“…This clustering method relies on the medoid concept [34]. A medoid, in this case a cluster medoid, is the point of the cluster whose value is the closest to the mean value of the whole cluster, or, in other words, the most central point of the cluster.…”
Section: K-medoidsmentioning
confidence: 99%
“…This clustering method relies on the medoid concept [34]. A medoid, in this case a cluster medoid, is the point of the cluster whose value is the closest to the mean value of the whole cluster, or, in other words, the most central point of the cluster.…”
Section: K-medoidsmentioning
confidence: 99%
“…Once the classification tool was developed, it was also necessary to determine whether an unsupervised approach would yield a breakdown of topics similar to that of the AskNature taxonomy [43] keeping in mind that there may be overlap in terms or an alternative way to view topics. Exploratory analysis of the text composition was carried out through an unsupervised application of a random forest machine learning algorithm, which was used to generate a proximity matrix to apply towards a partition around medoids (PAM) algorithm [45]. The optimal k or number of clusters was analyzed, and a k = 8 was selected to determine the degree of possible concordance between the manually assigned labels and the PAM clusters.…”
Section: Taxonomymentioning
confidence: 99%
“…While SED is not metric due to being asymmetric, it satisfies triangle inequality, non-negativity, and subgraphidentity. Several higher-order tasks such as clustering and indexing rely on such properties [21,15,24,43,46,50,52,10,12]. Existing neural approaches do not preserve these properties, which limits their usability for these higher order tasks.…”
Section: Introduction and Related Workmentioning
confidence: 99%