2015
DOI: 10.1007/978-3-319-19665-7_15
|View full text |Cite
|
Sign up to set email alerts
|

Consensus Clustering Using kNN Mode Seeking

Abstract: Abstract. In this paper we present a novel clustering strategy which combines two recent strategies, consensus clustering and two stage clustering as represented by the mean shift spectral clustering algorithm. We introduce the kNN mode seeking algorithm in the consensus clustering framework, and the information theoretic kNN Cauchy Schwarz divergence as foundation for spectral clustering. In combining these frameworks, two well known issues are directly bypassed; the kernel bandwidth choice of the kernel dens… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2017
2017
2018
2018

Publication Types

Select...
2
2

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 19 publications
0
5
0
Order By: Relevance
“…• Spectral clustering techniques could be used in the final step [66,1,67] • Quick Shift or medioid shift could replace kNN mode seeking [68,69].…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…• Spectral clustering techniques could be used in the final step [66,1,67] • Quick Shift or medioid shift could replace kNN mode seeking [68,69].…”
Section: Discussionmentioning
confidence: 99%
“…Our experience is that the proposed algorithm works for a wide range of parameters. However, for all experiments we used the same parameters, inspired by and extended from the previous work [1], where we used a fixed range of neighborhood parameters to capture cluster structures on different number of scales. This showed promising results, and in this work we use a slightly modified range when sampling the k parameters used in the proposed algorithm:…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…For this reason it is important that the clustering method is robust and not sensitive to parameter choices. We therefore use the kNN mode seeking consensus clustering algorithm [16] (Appendix A), which has been shown to be robust on a variety of datasets. The idea with the clustering is to identify groups of patients of different health status.…”
Section: Predictive Anchors Via Exploratory Analysismentioning
confidence: 99%
“…Given a critical point 2 m, r(m) = 0, all points that have integral curves that converges to the critical point are said to lie in the basin of attraction of m [43]. This property is the foundation of mode based clustering algorithms, e.g mean shift clustering [44,45].…”
Section: Properties Of Density Ridgesmentioning
confidence: 99%