2017
DOI: 10.1016/j.neucom.2017.06.053
|View full text |Cite
|
Sign up to set email alerts
|

A review of clustering techniques and developments

Abstract: This paper presents a comprehensive study on clustering: exiting methods and developments made at various times. Clustering is defined as an unsupervised learning where the objects are grouped on the basis of some similarity inherent among them. There are different methods for clustering the objects such as hierarchical, partitional, grid, density based and model based. The approaches used in these methods are discussed with their respective states of art and applicability. The measures of similarity as well a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
477
0
14

Year Published

2017
2017
2023
2023

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 939 publications
(549 citation statements)
references
References 136 publications
0
477
0
14
Order By: Relevance
“…We also adopted a data driven approach (correlation-based hierarchical clustering) to define our region of interest. In this method, we used average linkage clustering on Spearman correlation between the temporal responses recorded by each pair of electrodes to cluster the channels into groups [32].…”
Section: Eegmentioning
confidence: 99%
“…We also adopted a data driven approach (correlation-based hierarchical clustering) to define our region of interest. In this method, we used average linkage clustering on Spearman correlation between the temporal responses recorded by each pair of electrodes to cluster the channels into groups [32].…”
Section: Eegmentioning
confidence: 99%
“…We choose three widespread partitioning clustering methods [31,39,42] for our purpose: -means, PAM (Partitioning Around Medoids), and CLARA (Clustering LARge Application). In the following paragraphs, we introduce the main ideas behind these well-known methods.…”
Section: Clustering Methodsmentioning
confidence: 99%
“…To show the advantage of using our proposed clustering method, different clustering techniques such as K‐mean, partitioning around medoids, clustering for large applications, and clustering large applications based on randomized search, which were proposed by Saxena et al (), are run along with SOM. Table compares these clustering techniques considering Davies–Bouldin index (see Kapoor, Zeya, Singhal, & Nanda, ) that is based on dispersion measure within each cluster i (i.e., S i ) and cluster dissimilarity between two clusters i and j (i.e., D ij ).…”
Section: Case Studymentioning
confidence: 99%