2018
DOI: 10.1016/j.patcog.2017.11.023
|View full text |Cite
|
Sign up to set email alerts
|

Robust clustering using a kNN mode seeking ensemble

Abstract: In this paper we present a new algorithm for parameter-free clustering by mode seeking. Mode seeking, especially in the form of the mean shift algorithm, is a widely used strategy for clustering data, but at the same time prone to poor performance if the parameters are not chosen correctly. We propose to form a clustering ensemble consisting of repeated and bootstrapped runs of the recent kNN mode seeking algorithm, an algorithm which is faster than ordinary mean shift and more suited for high dimensional data… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
4
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 36 publications
(5 citation statements)
references
References 51 publications
1
4
0
Order By: Relevance
“…This variation may be due to the effect of humans on nature. These results confirm research conducted by de Larsen et al (Larsen et al, 2020) in 2020, and results of other studies detailed (Maillo et al, n.d.;Saikia et al, n.d.;Erdal and Aytug, 2016;Min et al, 2003;Nordhaug et al, 2018;Pardis et al, 2019).…”
Section: Analysis and Comparison Of Air Temperature And Global Solar ...supporting
confidence: 89%
See 1 more Smart Citation
“…This variation may be due to the effect of humans on nature. These results confirm research conducted by de Larsen et al (Larsen et al, 2020) in 2020, and results of other studies detailed (Maillo et al, n.d.;Saikia et al, n.d.;Erdal and Aytug, 2016;Min et al, 2003;Nordhaug et al, 2018;Pardis et al, 2019).…”
Section: Analysis and Comparison Of Air Temperature And Global Solar ...supporting
confidence: 89%
“…the class that is predicted by the largest number of individual classifiers is selected as the prediction) (Ho, n.d.). In the case of regression, the aggregation is performed by performing the average of the individual predictions (Maillo et al, n.d.;Saikia et al, n.d.;Erdal and Aytug, 2016;Nordhaug et al, 2018).…”
Section: Random Forestmentioning
confidence: 99%
“…Garcia and Maureira propose a kNN quantum cuckoo search algorithm for solving the multi-dimensional knapsack problem [9]. Myhre et al propose a robust clustering method, which uses a kNN-seeking model to ensemble the clusters [10]. Different from the conventional kNN method, their method can divide the cluster not only based on the density of the data but also considering the statistical characteristic (mean shift) to further divide the cluster into smaller clusters with higher member similarity.…”
Section: Related Workmentioning
confidence: 99%
“…the class that is predicted by the largest number of individual classifiers is selected as the prediction) [28]. In the case of regression, the aggregation is performed by performing the average of the individual predictions [29][30].…”
Section: Random Forestmentioning
confidence: 99%