Accelerated Density-Based Clustering using Bayesian Sequential Partitioning

This paper presents our work on improving an existing density-based clustering algorithm. By using Bayesian sequential partitioning (BSP) in the density estimation part of the algorithm, we were able to significantly reduce the computational complexity of the clustering algorithm. Simulation results...

Full description

Saved in:
Bibliographic Details
Main Authors: Majdara, Aref, Nooshabadi, Saeid
Format: Conference Proceeding
Language:English
Subjects:
Acceleration
Bayes methods
Classification algorithms
Clustering algorithms
Estimation
Kernel
Partitioning algorithms
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents our work on improving an existing density-based clustering algorithm. By using Bayesian sequential partitioning (BSP) in the density estimation part of the algorithm, we were able to significantly reduce the computational complexity of the clustering algorithm. Simulation results showed 15 to 40% reduction in computation time, depending on the dimensions of the data, while retaining the clustering accuracy of the original algorithm.
ISSN:2158-1525
2158-1525
DOI:10.1109/ISCAS45731.2020.9181237