Hang Yin
Orcid: 0009-0001-5264-1630Affiliations:
- Tsinghua University, Department of Mathematical Sciences, China
According to our database1,
Hang Yin authored at least 15 papers
between 2021 and 2026.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2026
Neural Scalable Symbolic Search Framework for Complex Logical Queries with Multiple Free Variables.
CoRR, May, 2026
CoRR, January, 2026
2025
Efficient and Scalable Neural Symbolic Search for Knowledge Graph Complex Query Answering.
CoRR, May, 2025
IEEE Data Eng. Bull., 2025
EFO<i><sub>k</sub></i>-CQA: Towards Knowledge Graph Complex Query Answering beyond Set Operation.
Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, V.2, 2025
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2025
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2025
2024
Proceedings of the Twelfth International Conference on Learning Representations, 2024
2023
EFO<sub>k</sub>-CQA: Towards Knowledge Graph Complex Query Answering beyond Set Operation.
CoRR, 2023
Wasserstein-Fisher-Rao Embedding: Logical Query Embeddings with Local Comparison and Global Transport.
Proceedings of the Findings of the Association for Computational Linguistics: ACL 2023, 2023
2022
Logical Queries on Knowledge Graphs: Emerging Interface of Incomplete Relational Data.
IEEE Data Eng. Bull., 2022
2021
Benchmarking the Combinatorial Generalizability of Complex Query Answering on Knowledge Graphs.
Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1, 2021