arXiv (All)
open access
Probabilistic linkage with graphs: leveraging cluster structure to improve the accuracy of entity resolution at scale
Probabilistic record linkage identifies records belonging to the same entity even when identifiers are incomplete or imperfect, and is increasingly used to conduct population-level inferences from administrative data at scale. Linkage produces noisy pairwise links that must then be resolved into dis
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
- DualGuard: Dual-Mode Quality Control for Logic-Preserving Data Augmentation#1116762
- MUFFLe: Efficient Model Update Compression via Generalized Deduplication for Federated Learning#271865
- Graph-Native Reinforcement Learning Enables Traceable Scientific Hypothesis Generation through Conceptual Recombination#329107
- Neurobagel: building an international network for distributed data discovery#173504
- legacy-datasets/mc4#786942
Record · ID 1155501
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