Skip to content
AI News HubLIVE
Original source2 min read

Fast and Memory-Light Evaluation of Density-Based Clusterings with the DISCO Index in R

Summary

The discoCVI R package version 0.2.0 computes the DISCO index exactly using single-linkage merge trees, reducing memory to linear and achieving 23-138x speedups, scoring 100,000 points in ~50 seconds with <200 MB.

SourcearXiv Machine LearningAuthor: Amin Entezari
Fast and Memory-Light Evaluation of Density-Based Clusterings with the DISCO Index in R
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 18 Nov 2026]

Title:Fast and Memory-Light Evaluation of Density-Based Clusterings with the DISCO Index in R

View a PDF of the paper titled Fast and Memory-Light Evaluation of Density-Based Clusterings with the DISCO Index in R, by Amin Entezari

View PDF HTML (experimental)

Abstract:DISCO is a recent internal cluster validity index for density-based clustering that, unlike earlier indices, also evaluates the quality of noise labels. The discoCVI package makes DISCO available in R. This article describes the design of the package and a typical workflow, in which DISCO is used to compare clusterings and to choose the parameters of HDBSCAN without ground truth, followed by the implementation introduced in version 0.2.0. DISCO is defined through density-connectivity distances between all pairs of points, so direct implementations store several n-by-n matrices. We show that every quantity DISCO needs can be read off the single-linkage merge tree of the mutual-reachability minimum spanning tree, so that the index can be computed exactly with memory that grows linearly with the number of points, while the running time remains quadratic as in the original definition. The implementation is tested against the previous version, agrees with the original Python implementation to within $3 \times 10^{-13}$, and corrects the score of singleton clusters to match the published definition. In benchmarks, discoCVI is 23 to 138 times faster than its previous version for 500 to 4,000 points and 3 to 9 times faster than the Python reference for 500 to 8,000 points, using a fraction of the memory of both, and it scores 100,000 points in about 50 seconds with less than 200 MB of memory.

Comments: 12 pages, 4 figures. R package discoCVI available on CRAN

Subjects:

Machine Learning (cs.LG); Computation (stat.CO)

Cite as: arXiv:2611.25114 [cs.LG]

(or arXiv:2611.25114v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2611.25114

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Amin Entezari [view email] [v1] Wed, 18 Nov 2026 19:52:38 UTC (72 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Fast and Memory-Light Evaluation of Density-Based Clusterings with the DISCO Index in R, by Amin Entezari

View PDF

HTML (experimental)

TeX Source

view license

Additional Features

Audio Summary

Current browse context:

cs.LG

new | recent | 2026-11

Change to browse by:

cs stat stat.CO

References & Citations

SciX

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

IArxiv recommender toggle

IArxiv Recommender (What is IArxiv?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

InvestorsAdvanced

Key points

  • DISCO is the first internal cluster validity index that also evaluates noise label quality for density-based clustering
  • New algorithm reads all needed quantities from the single-linkage merge tree of the mutual-reachability MST, reducing memory to O(n)
  • 23-138x faster than previous version for 500-4000 points; 3-9x faster than Python reference for 500-8000 points
  • Agrees with Python implementation to within 3e-13 and corrects singleton cluster scores to match the published definition

Highlights and analysis are generated automatically and may contain errors. Check the original source.