2015 1st International Conference on Next Generation Computing Technologies (NGCT) 2015
DOI: 10.1109/ngct.2015.7375201
|View full text |Cite
|
Sign up to set email alerts
|

Cluster quality based performance evaluation of hierarchical clustering method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0
1

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 31 publications
(11 citation statements)
references
References 2 publications
0
10
0
1
Order By: Relevance
“…The PCs were used in the HCA to avoid collinearity of the input data and to enable the identification of multi-segment patterns. The HCA created a cluster tree (or dendrogram) using an agglomerative strategy, or a “bottom-up” approach, which consists of three steps: (1) a measure of dissimilarity between sets of subjects using the Euclidean distance, (2) subject linkage using the Ward’s minimum variance method ( Ward, 1963 ), and (3) optimal cluster determination based on the cluster division that rendered the highest average Silhouette index ( Rousseeuw, 1987 ; Arbelaitz et al, 2013 ; Nisha and Kaur, 2016 ).…”
Section: Methodsmentioning
confidence: 99%
“…The PCs were used in the HCA to avoid collinearity of the input data and to enable the identification of multi-segment patterns. The HCA created a cluster tree (or dendrogram) using an agglomerative strategy, or a “bottom-up” approach, which consists of three steps: (1) a measure of dissimilarity between sets of subjects using the Euclidean distance, (2) subject linkage using the Ward’s minimum variance method ( Ward, 1963 ), and (3) optimal cluster determination based on the cluster division that rendered the highest average Silhouette index ( Rousseeuw, 1987 ; Arbelaitz et al, 2013 ; Nisha and Kaur, 2016 ).…”
Section: Methodsmentioning
confidence: 99%
“…For the unsupervised classification, Clustering [9] will be used with the help of centroid-based algorithms (k-means) to see how the groups will be distributed in 3 configurations; first with the original data, then with a reduction of dimensionality using PCA and finally applying t-SNE.…”
Section: Model Learningmentioning
confidence: 99%
“…degree of similarity, and they are different from objects, which are located outside the cluster [2]. In general, the techniques which are used in the clustering process can be classified into several categories: Partitioning Clustering, Hierarchical Clustering, Density-Based Clustering, Grid-Based Clustering, Model-Based Clustering, etc.…”
Section: Jurnal Ilmu Komputer Dan Informasi (Journal Of Computer Sciementioning
confidence: 99%
“…[3]. The main method which is discussed in this paper is Hierarchical Clustering where a number of formed clusters are mapped in the form of trees [2]. The process of Hierarchical Clustering is done by calculating the distance between sub clusters.…”
Section: Jurnal Ilmu Komputer Dan Informasi (Journal Of Computer Sciementioning
confidence: 99%
See 1 more Smart Citation