Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/102025
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Computing | en_US |
| dc.creator | Dong, J | en_US |
| dc.creator | Zhang, Q | en_US |
| dc.creator | Huang, X | en_US |
| dc.creator | Duan, K | en_US |
| dc.creator | Tan, Q | en_US |
| dc.creator | Jiang, Z | en_US |
| dc.date.accessioned | 2023-10-09T06:48:47Z | - |
| dc.date.available | 2023-10-09T06:48:47Z | - |
| dc.identifier.citation | p. 2519-2527 | - |
| dc.identifier.isbn | 978-1-4503-9416-1 | en_US |
| dc.identifier.other | p. 2519-2527 | - |
| dc.identifier.uri | http://hdl.handle.net/10397/102025 | - |
| dc.description | WWW '23: The ACM Web Conference 2023, Austin TX, USA, 30 April 2023-4 May 2023 | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Association for Computing Machinery | en_US |
| dc.rights | © Copyright held by the owner/author(s). Publication rights licensed to ACM. 2023. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in http://dx.doi.org/10.1145/3543507.3583376. | en_US |
| dc.subject | Graph neural networks | en_US |
| dc.subject | Knowledge graphs | en_US |
| dc.subject | Multi-hop question answering | en_US |
| dc.title | Hierarchy-aware multi-hop question answering over knowledge graphs | en_US |
| dc.type | Conference Paper | en_US |
| dc.identifier.spage | 2519 | en_US |
| dc.identifier.epage | 2527 | en_US |
| dc.identifier.doi | 10.1145/3543507.3583376 | en_US |
| dcterms.abstract | Knowledge graphs (KGs) have been widely used to enhance complex question answering (QA). To understand complex questions, existing studies employ language models (LMs) to encode contexts. Despite the simplicity, they neglect the latent relational information among question concepts and answers in KGs. While question concepts ubiquitously present hyponymy at the semantic level, e.g., mammals and animals, this feature is identically reflected in the hierarchical relations in KGs, e.g., a_type_of. Therefore, we are motivated to explore comprehensive reasoning by the hierarchical structures in KGs to help understand questions. However, it is non-trivial to reason over tree-like structures compared with chained paths. Moreover, identifying appropriate hierarchies relies on expertise. To this end, we propose HamQA, a novel Hierarchy-aware multi-hop Question Answering framework on knowledge graphs, to effectively align the mutual hierarchical information between question contexts and KGs. The entire learning is conducted in Hyperbolic space, inspired by its advantages of embedding hierarchical structures. Specifically, (i) we design a context-aware graph attentive network to capture context information. (ii) Hierarchical structures are continuously preserved in KGs by minimizing the Hyperbolic geodesic distances. The comprehensive reasoning is conducted to jointly train both components and provide a top-ranked candidate as an optimal answer. We achieve a higher ranking than the state-of-the-art multi-hop baselines on the official OpenBookQA leaderboard with an accuracy of 85%. | en_US |
| dcterms.accessRights | open access | en_US |
| dcterms.bibliographicCitation | The ACM Web Conference 2023 : proceedings of the World Wide Web Conference WWW 2023, p. 2519-2527 | en_US |
| dcterms.issued | 2023-04 | - |
| dc.relation.conference | World Wide Web Conference [WWW] | en_US |
| dc.description.validate | 202310 bcch | en_US |
| dc.description.oa | Accepted Manuscript | en_US |
| dc.identifier.FolderNumber | a2464, a3041 | - |
| dc.identifier.SubFormID | 47740, 49260 | - |
| dc.description.fundingSource | RGC | en_US |
| dc.description.pubStatus | Published | en_US |
| dc.description.oaCategory | Green (AAM) | en_US |
| Appears in Collections: | Conference Paper | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Dong_Hierarchy-Aware_Multi-Hop_Question.pdf | Pre-Published version | 2.02 MB | Adobe PDF | View/Open |
Page views
126
Citations as of Apr 14, 2025
Downloads
300
Citations as of Apr 14, 2025
SCOPUSTM
Citations
6
Citations as of Jun 21, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.



