Metraipolis › archive › dc_77025d7179da
HDLouvain: High-Throughput Incremental Clustering for Hyperdimensional Data — arXiv:2610.30687
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.30687
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-23T15:24:27.643Z
- SHA-256 of the archived text
1a1cab4ff95b0ef1c0c502455865a141e334299e51d2bd2197dd7e0c47c14760- Stable URL of this page
https://metraipolis.com/documento/dc_77025d7179da
How to cite
HDLouvain: High-Throughput Incremental Clustering for Hyperdimensional Data — arXiv:2610.30687 — arXiv (en), https://arxiv.org/abs/2610.30687 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_77025d7179da (Metraipolis archive dc_77025d7179da, sha256 1a1cab4ff95b0ef1c0c502455865a141e334299e51d2bd2197dd7e0c47c14760)
BibTeX
@misc{dc77025d7179da,
title = {HDLouvain: High-Throughput Incremental Clustering for Hyperdimensional Data — arXiv:2610.30687},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.30687},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_77025d7179da; sha256 1a1cab4ff95b0ef1c0c502455865a141e334299e51d2bd2197dd7e0c47c14760},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.30687. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Modern shotgun proteomics generates tens of thousands of tandem mass spectra per hour, producing hundreds of gigabytes of data that strain conventional clustering pipelines. DBSCAN and hierarchical agglomerative clustering (HAC) offer flexible similarity search, but DBSCAN is unstable across varying data densities, HAC costs $O(n^2)$, and both yield poor cluster quality. Graph-based methods such as Louvain produce high-quality clusters but scale poorly on streaming data. We observe that Louvain's poor scalability can be resolved without sacrificing its quality, and present HDLouvain, which combines Louvain community detection with the bit-parallel similarity computation of hyperdimensional computing (HDC). HDLouvain partitions a bootstrap fraction of the stream into precursor-mass buckets, applies Louvain to each bucket's kNN similarity graph, and condenses each community into a single binary hypervector by bitwise-majority bundling rather than iterative centroid recomputation. New spectra are assigned by a GPU-accelerated Hamming distance lookup against representatives in their mass bucket, or seed a new cluster when no match meets a similarity threshold $\tau$, so the partition grows incrementally without full re-clustering. On five PRIDE datasets (0.99M to 21.13M spectra), sweeping the bootstrap fraction $\alpha$ from 0.2 to 0.9 exposes an explicit, monotonic throughput-fidelity trade-off. On PXD003258, speedup ranges from 4.5x at $\alpha=0.3$ to 1.65x at $\alpha=0.7$. Modularity rises from 0.75-0.76 at $\alpha=0.2$ to 0.95-0.97 at $\alpha=0.9$, never more than 8% below full static recomputation. The Louvain stage achieves 0.86-0.93 normalized mutual information (NMI) on LFR benchmark networks with 30k to 2M nodes, whereas DBSCAN and HAC degrade to 0.57. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.AR, nuovi lavori del giorno). Categorie arXiv: Hardware Architecture (cs.AR). Pagina del lavoro: https://arxiv.org/abs/2610.30687 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-23T15:10:23.348Z dalla pagina https://arxiv.org/list/cs.AR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).