BitBIRCH Clustering Refinement Strategies

Chemical libraries are becoming not only increasingly bigger, but they are doing so at an accelerated pace. Keeping up with this explosion in chemical data demands more than just hardware upgrades; we need dramatically more efficient algorithms as well. We have been working in this direction, with the introduction of the instant similarity (iSIM) framework, which uses <i>n</i>-ary similarity to speed up the processing of very large sets. Recently, we showed how to use this technique to cluster billions of molecules with unprecedented efficiency through the BitBIRCH algorithm. In this Application Note, we present a package fully dedicated to expanding on the BitBIRCH method, including multiple options that give the user appreciable control over the tree structure, while dramatically improving the quality of the final partitions. Remarkably, this is achieved without compromising the efficiency of the original method. We also present new postprocessing tools that help dissect the clustering information, as well as ample examples showcasing the new functionalities. BitBIRCH is publicly available at: https://github.com/mqcomplab/bitbirch.

Authors

Institutions

Publication Details

Journal
Journal of Chemical Information and Modeling
Published
2025-05-27
DOI
https://doi.org/10.1021/acs.jcim.5c00627
Citations
2
Primary Topic
Advanced Clustering Algorithms Research
Type
article
Field-Weighted Citation Impact
4.96
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

BitBIRCH Clustering Refinement Strategies

Kate Huddleston, Ramón Alain Miranda‐Quintana, Vicky Jung, Kenneth López Pérez
2 citations
Journal of Chemical Information and Modeling
Advanced Clustering Algorithms Research
4.96
article

BitBIRCH Clustering Refinement Strategies

Kate Huddleston, Ramón Alain Miranda‐Quintana, Vicky Jung, Kenneth López Pérez
article en
2 citations

Abstract

Chemical libraries are becoming not only increasingly bigger, but they are doing so at an accelerated pace. Keeping up with this explosion in chemical data demands more than just hardware upgrades; we need dramatically more efficient algorithms as well. We have been working in this direction, with the introduction of the instant similarity (iSIM) framework, which uses <i>n</i>-ary similarity to speed up the processing of very large sets. Recently, we showed how to use this technique to cluster billions of molecules with unprecedented efficiency through the BitBIRCH algorithm. In this Application Note, we present a package fully dedicated to expanding on the BitBIRCH method, including multiple options that give the user appreciable control over the tree structure, while dramatically improving the quality of the final partitions. Remarkably, this is achieved without compromising the efficiency of the original method. We also present new postprocessing tools that help dissect the clustering information, as well as ample examples showcasing the new functionalities. BitBIRCH is publicly available at: https://github.com/mqcomplab/bitbirch.

Journal of Chemical Information and ModelingVol. 65(11)
University of Florida (US)
Openalex Percentile: Top 5%
Advanced Clustering Algorithms Research
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.