New clustering algorithm uses reverse nearest neighbour for better density-based clustering.
problem Density-based clustering of separated high-density regions.
method Uses reverse nearest neighbour (RNN) queries to estimate densities and recover clusters.
result Outperforms DBSCAN and ISDBSCAN on synthetic and real-world data.
Lin-DBSCAN is a fast density-based clustering algorithm for spatial data.
problem Efficient clustering of large datasets without prior knowledge of cluster number and shape.
method Grid-based scan and merge approach to a discrete density model of DBSCAN.
result Lin-DBSCAN outperforms DBSCAN in efficiency and validity for spatial data clustering.
Skeleton clustering detects clusters in high-dimensional data without needing prototypes.
problem Detecting clusters in high-dimensional data with irregular shapes.
method Skeleton clustering combines prototype methods, density-based clustering, and hierarchical clustering using surrogate density measures.
result Skeleton clustering reliably detects clusters in multivariate and high-dimensional data.
A new measure DCSI quantifies separability for density-based clustering.
problem Quantifying meaningful clusters in data sets.
method Developed a new separability measure DCSI based on separation and connectedness.
result Correctly identifies touching or overlapping classes that do not correspond to meaningful density-based clusters.
Proposes a deep density-based image clustering method.
problem Challenges in clustering images with unknown cluster number and shape.
method Two-stage approach: feature extraction with CAE and t-SNE, followed by density-based clustering.
result Achieves clustering performance comparable to state-of-the-art methods.
A new method combines spectral and density-based clustering for robust nonconvex clustering.
problem Finding robust clusterings for nonconvex shapes with varying densities and noise.
method Combining spectral and density-based clustering approaches to optimize a density criterion.
result Our method provides robust and reliable clusterings on synthetic and real-world data.
FISHDBC clusters arbitrary data with flexible, scalable, and hierarchical features.
problem Clustering arbitrary data with arbitrary distance functions efficiently.
method Flexible, incremental, scalable, hierarchical density-based clustering algorithm.
result Flexible clustering of arbitrary data without feature extraction.
New framework quantifies uncertainty in flexible density-based clustering.
problem Uncertainty quantification in clustering with non-parametric density estimation.
method Martingale posterior distributions and density-based clustering.
result Efficient GPU-compatible inference on clustering structures with uncertainty.
SDCOR clusters massive datasets efficiently, detecting outliers with low memory usage.
problem Local outlier detection in large-scale datasets.
method Chunk-based density clustering with incremental updates.
result SDCOR achieves lower linear time complexity and better efficiency than traditional methods.
Stable density-based clustering via multiparameter persistence.
problem Density-based clustering stability to data perturbations.
method Degree-Rips construction, correspondence-interleaving distance, multiparameter stability analysis.
result Persistable pipeline yields stable, consistent density-based clustering.
Proposes DISCO, the first CVI for density-based clustering with noise.
problem Evaluation of noise assignments in density-based clustering.
method Density-connectivity and Silhouette Coefficient adaptation for noise evaluation.
result DISCO is the first CVI to explicitly assess noise assignments.
We improve density-based distances using normalizing flows and score matching.
problem Inaccurate density estimates and poor convergence in graph-based methods for high-dimensional spaces.
method Learn densities with normalizing flows and refine geodesics with a score model.
result Improved density-based distances that scale to high dimensions and improve numerical stability.
This paper presents a simple but effective density-based outlier detection approach with the local kernel density estimation (KDE). A Relative Density-based Outlier Score (RDOS) is introduced to measure the local outlierness of objects, in which the density distribution at the location of an object is estimated with a …
We present an accelerated algorithm for hierarchical density based clustering. Our new algorithm improves upon HDBSCAN*, which itself provided a significant qualitative improvement over the popular DBSCAN algorithm. The accelerated HDBSCAN* algorithm provides comparable performance to DBSCAN, while supporting variable …
DBSCAN clustering improved by using nearest neighbour-induced Isolation Similarity.
problem Improving clustering performance of DBSCAN.
method Proposed nearest neighbour method to implement Isolation Similarity.
result DBSCAN clustering performance surpassed by DP algorithm.
Proposes a new clustering algorithm using random forest.
problem Density-based clustering with optimal level determination.
method Best-scored random forest algorithm.
result Guaranteed consistency and fast convergence rates.
Expands causal clustering framework with hierarchical and density-based methods.
problem Identifying heterogeneous treatment effects in unknown subgroup structure.
method Integrates hierarchical and density-based clustering algorithms into causal k-means clustering.
result Plug-in estimators for causal clustering are simple and readily implementable.
DPSM clusters nodes in data and graph spaces via density propagation and subcluster merging.
problem Automatic clustering of nodes in data and graph spaces.
method Density-based node clustering with propagation process and spectral clustering on subclusters.
result DPSM effectively clusters nodes in both data and graph spaces.
A novel density-based approach QC detects outliers in data with high precision.
problem Detecting outliers in data with high precision and sensitivity.
method Quantum Clustering (QC) approach based on the density of data points.
result QC effectively finds hidden outliers and subtle outliers with parameter adjustment.
Efficient clustering in high dimensions with Quick Shift and LSH.
problem Density-based clustering in high-dimensional data.
method Combines Quick Shift and LSH for efficient density estimation.
result Achieves almost linear time complexity for consistency.
Parameter-free clustering method using cluster catch digraphs (CCDs).
problem Finding the correct number of clusters in data without specifying a parameter.
method Hybrid of density-based and graph-based clustering methods using Ripley's K function.
result Minimum dominating sets of RK-CCDs estimate and distinguish clusters from noise.
Adaptive DBSCAN improves clustering for varying density clusters.
problem Reduced performance for clusters with different densities.
method Proposes an adaptive DBSCAN algorithm.
result Significantly improves performance for varying density clusters.
Most density-based clustering methods largely rely on how well the underlying density is estimated. However, density estimation itself is also a challenging problem, especially the determination of the kernel bandwidth. A large bandwidth could lead to the over-smoothed density estimation in which the number of density …
BOKE optimizes expensive functions with reduced computational costs.
problem High computational cost of Gaussian process-based Bayesian optimization.
method Kernel regression and density-based exploration integrated into confidence bounds.
result BOKE achieves global convergence and superior computational efficiency.
Hybrid clustering combines partitional and hierarchical clustering for computational effectiveness and versatility in cluster shape. In such clustering, a dissimilarity measure plays a crucial role in the hierarchical merging. The dissimilarity measure has great impact on the final clustering, and data-independent prop…
We present a simple, yet effective, approach to Semi-Supervised Learning. Our approach is based on estimating density-based distances (DBD) using a shortest path calculation on a graph. These Graph-DBD estimates can then be used in any distance-based supervised learning method, such as Nearest Neighbor methods and SVMs…
Paper uses DBSCAN variation to detect ship anomalies.
problem Detecting anomalous ship behavior.
method Variation of DBSCAN algorithm applied to AIS data.
result Alternative anomaly metric is more statistically informative.
This paper proposes using contextualized word representations for better concept taxonomies.
problem Current taxonomy learning systems define concepts as single words, limiting their semantic understanding.
method Defines concepts as synsets, learns density-based approximations of contextualized word representations, and measures similarity and hypernymy.
result Contextualized word representations can improve the accuracy of concept taxonomies.
New method clusters large datasets using geometric properties.
problem Clustering large datasets using DBSCAN* and HDBSCAN* is infeasible.
method Exploiting Euclidean space geometry, systematically construct clusters from subsets of data.
result Clusters of large datasets are possible with controlled subset sizes.
Optimizes basis for density-based atomic representations to enhance compactness and accuracy.
problem Improving the efficiency and accuracy of machine learning models for atomic properties.
method An unsupervised approach to determine the optimal basis set for atom density representations using splines.
result Optimal basis sets that encode structural information more compactly and accurately.
Unified framework for various probability distribution distances.
problem Handling diverse probability distribution distances in statistics.
method General framework covering density-based and distribution-function-based divergences.
result Unified approach to classical and modern statistical procedures.
The paper exposes common misconceptions about OOD detection and proposes a new framework.
problem Density-based OOD detection fails in deep learning settings.
method Proposes the OOD proxy framework to unify likelihood-ratio-based methods.
result Likelihood ratio is a principled method for OOD detection.
Approach to detect and adapt to concept drift in unlabeled streaming data.
problem Detect and adapt to concept drift in high-dimensional, noisy, low-context data.
method Density-based clustering for virtual drift and weak supervision for real drift.
result 90% precision in detecting and adapting to concept drift for 4 years after initial deployment.
CRAD clusters data with robust depth-based dissimilarity, outperforming existing methods.
problem Clustering data with varying densities and unknown true number of clusters.
method CRAD uses a robust data depth as dissimilarity measure and a novel neighbor searching function.
result CRAD outperforms DBSCAN, OPTICS, and DBCA in detecting clusters with varying densities.
ceVAE improves anomaly detection in medical images by combining reconstruction and density-based scoring.
problem Lack of formal assertions and comparability in anomaly scores based on reconstruction error.
method Proposes Context-encoding Variational Autoencoder (ceVAE) that combines reconstruction and density-based scoring.
result ceVAE achieves unsupervised ROC-AUCs of 0.95 and 0.89 on BraTS-2017 and ISLES-2015 benchmarks, outperforming state-of-the-art methods.
Non-parametric estimation of a multivariate density estimation is tackled via a method which combines traditional local smoothing with a form of global smoothing but without imposing a rigid structure. Simulation work delivers encouraging indications on the effectiveness of the method. An application to density-based c…
Generative Ensembles improve anomaly detection by reducing OoD errors.
problem Out-of-Distribution (OoD) errors in likelihood models for anomaly detection.
method Generative Ensembles estimate epistemic uncertainty to robustify density-based OoD detection.
result WAIC performs surprisingly well in practice despite not accounting for the typical set of a distribution.
A novel clustering algorithm inspired by atomic fission.
problem Grouping similar elements in datasets.
method Fission clustering algorithm that uses distance matrix and local density indicators.
result The algorithm outperforms other clustering methods in speed and accuracy.
New research shows semantic data matching can degrade SSDL performance.
problem The limits of semantic data set matching in semi-supervised learning.
method Demonstrated through simulations and a new dissimilarity measure.
result Semantic data matching can degrade SSDL performance under non-IID data.
We compute persistent homology using an intrinsic metric derived from density.
problem Estimating topological features from high-dimensional data.
method Density-based metric learning for persistent homology.
result Persistent homology converges to intrinsic manifold metric.
We survey agglomerative hierarchical clustering algorithms and discuss efficient implementations that are available in R and other software environments. We look at hierarchical self-organizing maps, and mixture models. We review grid-based clustering, focusing on hierarchical density-based approaches. Finally we descr…
The study optimizes bandwidth for nonparametric modal clustering.
problem Optimizing bandwidth for nonparametric modal clustering.
method Asymptotic analysis of density-based partitions and bandwidth selection.
result Asymptotic approximation of a metric for partition distance.
Proposes a new hierarchical clustering method combining DP and DBSCAN strengths.
problem Combining strengths of DP and DBSCAN for arbitrary shape clusters.
method DC-HDP: Combines Density Peak and Density-Connectivity approaches.
result Produces best clustering results on 14 datasets.
PostNet predicts uncertainty without OOD data, improving OOD detection and calibration.
problem Accurate uncertainty estimation for safe systems.
method PostNet uses Normalizing Flows to learn individual posterior distributions over predicted probabilities.
result PostNet achieves state-of-the-art results in OOD detection and uncertainty calibration.
The level set tree approach of Hartigan (1975) provides a probabilistically based and highly interpretable encoding of the clustering behavior of a dataset. By representing the hierarchy of data modes as a dendrogram of the level sets of a density estimator, this approach offers many advantages for exploratory analysis…
CDF transform-and-shift homogenizes cluster densities for better clustering.
problem Inhomogeneous cluster densities bias algorithms towards dense clusters.
method Apply a Cumulative Distribution Function (CDF) transform-and-shift method to homogenize cluster densities.
result The method outperforms existing solutions in clustering and anomaly detection.
SNG-DBSCAN clusters data faster with subsampled similarity queries.
problem Efficiently clustering large datasets with DBSCAN's high complexity.
method Subsampled ε-neighborhood graph for similarity queries. result Subsampling 0.1% of the graph leads to 200x speedup and 250x RAM reduction. Method estimates number of clusters in Block Markov Chain trajectories.
problem Challenges in choosing number of clusters for sequential data.
method Spectral embedding and density-based clustering.
result Asymptotically consistent method for estimating clusters.