DBSCAN is a classical density-based clustering procedure with tremendous practical relevance. However, DBSCAN implicitly needs to compute the empirical density for each sample point, leading to a quadratic worst-case time complexity, which is too slow on large datasets. We propose DBSCAN++, a simple modification of DBS…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,694 papers · 148 categories
Trend · papers per month
41 results for “DBSCAN”
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.
Density-based clustering techniques are used in a wide range of data mining applications. One of their most attractive features con- sists in not making use of prior knowledge of the number of clusters that a dataset contains along with their shape. In this paper we propose a new algorithm named Linear DBSCAN (Lin-DBSC…
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 of the graph leads to 200x speedup and 250x RAM reduction.
Clustering analysis, a classical issue in data mining, is widely used in various research areas. This article aims at proposing a self-adaption grey DBSCAN clustering (SAG-DBSCAN) algorithm. First, the grey relational matrix is used to obtain the grey local density indicator, and then this indicator is applied to make …
Unified view of clustering algorithms presented.
problem Presenting a unified view of clustering algorithms.
method Identifying relationships between five clustering algorithms.
result A novel interpretation of DBSCAN as a climbing procedure.
Density-based spatial clustering of applications with noise (DBSCAN) is a data clustering algorithm which has the high-performance rate for dataset where clusters have the constant density of data points. One of the significant attributes of this algorithm is noise cancellation. However, DBSCAN demonstrates reduced per…
Extends MSC for triclustering tensors, using DBSCAN to find clusters.
problem Finding clusters in multi-slice triclustering of tensors with unknown cluster sizes.
method Extends Multi-Slice Clustering (MSC) with DBSCAN to find clusters in tensors.
result Can find clusters in tensors that are sums of multiple rank-one tensors.
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.
This paper defends SVMs against poisoning attacks using DBSCAN and hardness proofs.
problem Adversarial injection of specially crafted samples into training data to misclassify SVMs.
method Two strategies: robust SVM algorithms and data sanitization (DBSCAN).
result Proves hardness of simple SVM problem and effectiveness of DBSCAN for poisoning attacks.
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 …
Bi-filtration stabilizes TDA mapper results under noise.
problem Stability issues in TDA mapper results under data perturbation.
method Introduced bi-filtration approach to stabilize mapper graphs.
result Persistent homology of perturbed data set is 2δ-interleaved with original.
Determination of the critical points for systems of directed percolation class using machine learningcond-mat.stat-mech
Machine learning predicts critical points for directed percolation models.
problem Determining critical points for directed percolation models.
method Supervised and unsupervised machine learning algorithms (CNN and DBSCAN) were used.
result Machine learning accurately predicts critical points for both models.
This paper focuses on density-based clustering, particularly the Density Peak (DP) algorithm and the one based on density-connectivity DBSCAN; and proposes a new method which takes advantage of the individual strengths of these two methods to yield a density-based hierarchical clustering algorithm. Our investigation be…
Study examines how measurement errors impact clustering algorithms.
problem Impact of measurement errors on clustering algorithms.
method Monte Carlo study of two clustering algorithms: GMM with merging and DBSCAN.
result Systematic measurement errors are more problematic for clustering than random errors.
A recent proposal of data dependent similarity called Isolation Kernel/Similarity has enabled SVM to produce better classification accuracy. We identify shortcomings of using a tree method to implement Isolation Similarity; and propose a nearest neighbour method instead. We formally prove the characteristic of Isolatio…
We show that DBSCAN can estimate the connected components of the -density level set given i.i.d. samples from an unknown density . We characterize the regularity of the level set boundaries using parameter and analyze the estimation error under the Hausdorff metric. When the data …
Density-based clustering is the task of discovering high-density regions of entities (clusters) that are separated from each other by contiguous regions of low-density. DBSCAN is, arguably, the most popular density-based clustering algorithm. However, its cluster recovery capabilities depend on the combination of the t…
This study evaluates clustering algorithms on high-dimensional data.
problem Comparing clustering algorithms on high-dimensional datasets.
method Evaluation of K-means, DBSCAN, and Spectral Clustering using PCA, t-SNE, UMAP, and multiple metrics.
result UMAP preprocessing improves clustering quality across all algorithms, with Spectral Clustering excelling.
In this paper we are going to introduce a new nearest neighbours based approach to clustering, and compare it with previous solutions; the resulting algorithm, which takes inspiration from both DBscan and minimum spanning tree approaches, is deterministic but proves simpler, faster and doesnt require to set in advance …
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.
A novel approach ODAR detects outliers for clustering.
problem Outliers interfere with clustering algorithms, leading to unreliable results.
method Feature transformation to separate outliers and normal objects into distinct clusters.
result ODAR improves clustering accuracy on 7 out of 10 datasets.
We assess cluster stability by trimming extreme points and tracking data range reduction.
problem Assessing stability of one-dimensional clusters.
method Probabilistic method using diameter-shrinkage ratio to track data range reduction.
result Our method achieves higher accuracy than classical tests in small or noisy samples.
An imprecise region is referred to as a geographical area without a clearly-defined boundary in the literature. Previous clustering-based approaches exploit spatial information to find such regions. However, the prior studies suffer from the following two problems: the subjectivity in selecting clustering parameters an…
Study develops ensemble machine learning framework for predicting groundwater heavy metal pollution.
problem Statistical complexity and spatial heterogeneity of heavy metal contamination in groundwater.
method Nested cross-validated ensemble machine learning with response transformations (raw, log, Gaussian copula).
result Copula-based models with DBSCAN clustering diagnostics provide the most reliable and interpretable assessments of groundwater contamination.
We develop a new density-based clustering algorithm named CRAD which is based on a new neighbor searching function with a robust data depth as the dissimilarity measure. Our experiments prove that the new CRAD is highly competitive at detecting clusters with varying densities, compared with the existing algorithms such…
This paper presents a new clustering algorithm for space-time data based on the concepts of topological data analysis and in particular, persistent homology. Employing persistent homology - a flexible mathematical tool from algebraic topology used to extract topological information from data - in unsupervised learning …
When it comes to clustering nonconvex shapes, two paradigms are used to find the most suitable clustering: minimum cut and maximum density. The most popular algorithms incorporating these paradigms are Spectral Clustering and DBSCAN. Both paradigms have their pros and cons. While minimum cut clusterings are sensitive t…
FISHDBC is a flexible, incremental, scalable, and hierarchical density-based clustering algorithm. It is flexible because it empowers users to work on arbitrary data, skipping the feature extraction step that usually transforms raw data in numeric arrays letting users define an arbitrary distance function instead. It i…
This study examines non-retail trading on Polymarket, revealing unique behavior patterns and structural limitations.
problem Lack of address-level quote-lifecycle data in Polymarket prediction markets.
method Empirical analysis of 13 million order-filled events using DBSCAN clustering on a six-feature fill-side vector.
result Non-retail behavior is uni-modal, contradicting previous archetypal hypotheses.
The development of algorithms for unsupervised pattern recognition by nonlinear clustering is a notable problem in data science. Markov clustering (MCL) is a renowned algorithm that simulates stochastic flows on a network of sample similarities to detect the structural organization of clusters in the data, but it has n…
Cluster analysis is a field of data analysis that extracts underlying patterns in data. One application of cluster analysis is in text-mining, the analysis of large collections of text to find similarities between documents. We used a collection of about 30,000 tweets extracted from Twitter just before the World Cup st…
SPINEX improves clustering with explainable neighbors, outperforming other methods.
problem Improving clustering performance and explainability.
method Leverages similarity and higher-order interactions for clustering.
result SPINEX outperforms 13 clustering algorithms across various datasets.
Paper presents a novel neural network method for topic detection in micro-blogs.
problem Challenging topic detection without known topic count.
method Unsupervised neural sentence embedding model with attention mechanism.
result Improved clustering algorithm (RADBSCAN) discovers topics based on dataset character.
In this work we perform a study of various unsupervised methods to identify mental stress in firefighter trainees based on unlabeled heart rate variability data. We collect RR interval time series data from nearly 100 firefighter trainees that participated in a drill. We explore and compare three methods in order to pe…
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.
DeepSupp detects financial support levels using attention mechanisms.
problem Traditional SR identification methods fail to adapt to modern markets.
method Multi-head attention mechanisms, dynamic correlation matrices, DBSCAN clustering.
result DeepSupp outperforms six baseline methods across six financial metrics.
Clustering is one of the most fundamental and wide-spread techniques in exploratory data analysis. Yet, the basic approach to clustering has not really changed: a practitioner hand-picks a task-specific clustering loss to optimize and fit the given data to reveal the underlying cluster structure. Some types of losses--…
Unsupervised space partitioning improves ANNS performance without pre-processing.
problem Efficient nearest neighbor search in high-dimensional spaces.
method Custom unsupervised learning framework for space partitioning and learning-to-search.
result Our method outperforms state-of-the-art approaches on ANNS benchmarks.
This paper presents a novel adaptive resonance theory (ART)-based modular architecture for unsupervised learning, namely the distributed dual vigilance fuzzy ART (DDVFA). DDVFA consists of a global ART system whose nodes are local fuzzy ART modules. It is equipped with the distinctive features of distributed higher-ord…
CDL index improves clustering validation for non-convex data.
problem Selecting clustering algorithms and hyperparameters without labeled data.
method CDL uses compactness, centers, and covariances to compute a probabilistic description length bound.
result CDL outperforms conventional CVIs on synthetic and image benchmarks.