arXiv (All)
open access
T-ARC: Topology-Aware Randomized Clustering via Distributionally Robust Stochastic Block Models
In this work, we introduce a new clustering method, namely T-ARC (Topology-Aware Randomized Clustering), that corrects the geometric bias of K-means by embedding topological information directly into the optimization objective. Building on the assumption that the data admits an underlying hidden str
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
- Cluster randomized crossover trials with very few clusters but multiple periods: which analyses for continuous outcomes should be used?#974948
- NVE: A Separability and Coverage-Aware Internal Validation Metric for Biclustering#793269
- NVE: A Separability and Coverage-Aware Internal Validation Metric for Biclustering#789265
- Grouping the Stochastic Machine: Precision, Not Capability, as the Frontier Metric for AI Systems#467110
- Causal Topology Detection: A Framework of Algorithms for Enterprise Causal Intelligence#30187
Record · ID 1144433
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