Evgeny Kharlamov, Shuxin Li, Kalpa Gunaratna, Zixian Huang, Gong Cheng
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
A prominent application of knowledge graph (KG) is document enrichment. Existing methods identify mentions of entities in a background KG and enrich documents with entity types and direct relations. We compute an entity relation subgraph (ERG) that can more expressively represent indirect relations among a set of mentioned entities. To find compact, representative, and relevant ERGs for effective enrichment, we propose an efficient best-first search algorithm to solve a new combinatorial optimization problem that achieves a tradeoff between representativeness and compactness, and then we exploit ontological knowledge to rank ERGs by entity-based document-KG and intra-KG relevance. Extensive experiments and user studies show the promising performance of our approach.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2005.00153")
get_code_for_paper("2005.00153")
have("2005.00153")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2005.00153.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2005.00153)
Connect an agent — have() is free.