arXiv (All)
open access
Reliable data clustering with Bayesian community detection
From neuroscience and genomics to systems biology and ecology, researchers rely on clustering similarity data to uncover modular structure. Most methods work in two steps: first reduce noise, then cluster. The first step runs without regard to the second: it forces arbitrary choices, discards useful
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Representation-Aware Modularity with a Distance-Calibrated Null Model#1216463
- Detecting modules in multiplex networks – an application for integrating expression profiles across multiple species#1026614
- Predicting missing links in food webs using stacked models and species traits#1133989
- Scalable dynamic community detection on temporal graphs using graph neural networks#792354
- Scalable dynamic community detection on temporal graphs using graph neural networks#788354
Record · ID 1386948
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive