Optimal Bandwidth Selection for DENCLUE Algorithm

Hao Wang
7/6/2023
cs.LGcs.IR

No confident code implementation found for this paper.

Abstract

In modern day industry, clustering algorithms are daily routines of algorithm engineers. Although clustering algorithms experienced rapid growth before 2010. Innovation related to the research topic has stagnated after deep learning became the de facto industrial standard for machine learning applications. In 2007, a density-based clustering algorithm named DENCLUE was invented to solve clustering problem for nonlinear data structures. However, its parameter selection problem was largely neglected until 2011. In this paper, we propose a new approach to compute the optimal parameters for the DENCLUE algorithm, and discuss its performance in the experiment section.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{wang2023optimal,
  title  = {Optimal Bandwidth Selection for DENCLUE Algorithm},
  author = {Hao Wang},
  year   = {2023},
  eprint = {2307.03206},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2307.03206v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2307.03206.svg)](https://codeofpaper.com/paper/2307.03206)

Discussion