dorsal/arxiv
View SchemaPanning for Gold: Expanding Domain-Specific Knowledge Graphs with General Knowledge
| Authors | Runhao Zhao, Weixin Zeng, Wentao Zhang, Chong Chen, Zhengpin Li, Xiang Zhao, Lei Chen |
|---|---|
| Categories | |
| ArXiv ID | 2601.10485vv2 |
| URL | https://arxiv.org/abs/2601.10485 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
Domain-specific knowledge graphs (DKGs) often lack coverage compared to general knowledge graphs (GKGs). To address this, we introduce Domain-specific Knowledge Graph Fusion (DKGF), a novel task that enriches DKGs by integrating relevant facts from GKGs. DKGF faces two key challenges: high ambiguity in domain relevance and misalignment in knowledge granularity across graphs. We propose ExeFuse, a simple yet effective Fact-as-Program paradigm. It treats each GKG fact as a latent semantic program, maps abstract relations to granularity-aware operators, and verifies domain relevance via program executability on the target DKG. This unified probabilistic framework jointly resolves relevance and granularity issues. We construct two benchmarks, DKGF(W-I) and DKGF(Y-I), with 21 evaluation configurations. Extensive experiments validate the task's importance and our model's effectiveness, providing the first standardized testbed for DKGF.
{
"annotation_id": "dba69b9e-e5b2-44bb-8b86-88e413f3ce7c",
"date_created": "2026-02-17T05:53:24.334000Z",
"date_modified": "2026-02-17T05:53:24.334000Z",
"file_hash": "acaea0a0d761df4a0d5bcf4ae0ec9b433fa2a9a4d5a13864c4b36b315da48de9",
"private": false,
"record": {
"abstract": "Domain-specific knowledge graphs (DKGs) often lack coverage compared to general knowledge graphs (GKGs). To address this, we introduce Domain-specific Knowledge Graph Fusion (DKGF), a novel task that enriches DKGs by integrating relevant facts from GKGs. DKGF faces two key challenges: high ambiguity in domain relevance and misalignment in knowledge granularity across graphs. We propose ExeFuse, a simple yet effective Fact-as-Program paradigm. It treats each GKG fact as a latent semantic program, maps abstract relations to granularity-aware operators, and verifies domain relevance via program executability on the target DKG. This unified probabilistic framework jointly resolves relevance and granularity issues. We construct two benchmarks, DKGF(W-I) and DKGF(Y-I), with 21 evaluation configurations. Extensive experiments validate the task\u0027s importance and our model\u0027s effectiveness, providing the first standardized testbed for DKGF.",
"arxiv_id": "2601.10485",
"authors": [
"Runhao Zhao",
"Weixin Zeng",
"Wentao Zhang",
"Chong Chen",
"Zhengpin Li",
"Xiang Zhao",
"Lei Chen"
],
"categories": [
"cs.AI"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Panning for Gold: Expanding Domain-Specific Knowledge Graphs with General Knowledge",
"url": "https://arxiv.org/abs/2601.10485",
"version": "v2"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "2f6c6ac2-537f-4ada-9772-0e2326479ba9",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}