Metraipolis › archive › dc_efc9125dcedc

GRAND-HC: Graph-Refined Author Name Disambiguation — arXiv:2609.01636

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.01636
License (as archived)
CC0-1.0
Archived
2026-10-17T05:46:44.799Z
SHA-256 of the archived text
727ea695667e9488cc12034c21d6d87f18a8d2eb9f15cf1fa0c87cd1f0ccbd2d
Stable URL of this page
https://metraipolis.com/documento/dc_efc9125dcedc

How to cite

GRAND-HC: Graph-Refined Author Name Disambiguation — arXiv:2609.01636 — arXiv (en), https://arxiv.org/abs/2609.01636 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_efc9125dcedc (Metraipolis archive dc_efc9125dcedc, sha256 727ea695667e9488cc12034c21d6d87f18a8d2eb9f15cf1fa0c87cd1f0ccbd2d)
BibTeX
@misc{dcefc9125dcedc,
  title = {GRAND-HC: Graph-Refined Author Name Disambiguation — arXiv:2609.01636},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.01636},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_efc9125dcedc; sha256 727ea695667e9488cc12034c21d6d87f18a8d2eb9f15cf1fa0c87cd1f0ccbd2d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.01636. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

From-Scratch Name Disambiguation (SND) groups papers sharing an ambiguous name into clusters of distinct real-world authors. Existing methods suffer from two critical limitations: (1) inherent long-tailed author distribution biases representation learning, causing over-merging of tail authors; (2) existing cluster number estimation methods are unreliable for long paper sequences, hindering large-scale deployment. We propose \textbf{GRAND-HC}, a complete end-to-end SND framework. We construct a heterogeneous paper graph via co-author, co-organization, and co-venue relations, using a graph attention network as the embedding backbone. \textbf{Harmony Contrastive Learning (HCL)} dynamically reweights training loss to suppress overfitting to prolific authors, learning discriminative embeddings. A \textbf{Graph-Refined Distance Matrix (GRDM)} leverages graph topology to optimize pairwise distances, further preventing tail author over-merging. Meanwhile, a lightweight \textbf{Paper Compression Module (PCM)} achieves accurate cluster number estimation across varying scales. Finally, Hierarchical Agglomerative Clustering outputs the final clusters. Extensive experiments demonstrate state-of-the-art macro F1 performance. GRAND-HC has been deployed in a billion-scale academic database. Source code: this https URL .

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-03 in cs.IR).
Categorie arXiv: Information Retrieval (cs.IR).
Pagina del lavoro: https://arxiv.org/abs/2609.01636 — 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-17T05:23:20.819Z dalla pagina https://arxiv.org/catchup/cs.IR/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).