Hang Yin

activity

20212026

most citedBenchmarking the Combinatorial Generalizability of Complex Query Answering on Knowledge Graphs

4 citations · 11 across the 12 of their papers we have counts for

collaborators

Showing cs.LGShow all

2 papers · 1 filter

cs.LG2026

$R^{2 k}$ is Theoretically Large Enough for Embedding-based Top- $k$ Retrieval

Zihao Wang, Hang Yin, Lihui Liu +4

This paper studies the Minimal Embeddable Dimension (MED): the least dimension in which there exists a configuration of $m$ object vectors so that every subset of size at most $k$ …

cs.LG2024★ 1 cited

Meta Operator for Complex Query Answering on Knowledge Graphs

Hang Yin, Zihao Wang, Yangqiu Song

Knowledge graphs contain informative factual knowledge but are considered incomplete. To answer complex queries under incomplete knowledge, learning-based Complex Query Answering (…

R2k is Theoretically Large Enough for Embedding-based Top-k Retrieval

Meta Operator for Complex Query Answering on Knowledge Graphs

$R^{2 k}$ is Theoretically Large Enough for Embedding-based Top- $k$ Retrieval