ClueReader: Heterogeneous Graph Attention Network for Multi-hop Machine Reading Comprehension
Multi-hop machine reading comprehension is a challenging task in natural language processing as it requires more reasoning ability across multiple documents. Spectral models based on graph convolutional networks have shown good inferring abilities and lead to competitive results. However, the analysis and reasoning of some are inconsistent with those of humans. Inspired by the concept of grandmother cells in cognitive neuroscience, we propose a heterogeneous graph attention network model named ClueReader to imitate the grandmother cell concept. The model is designed to assemble the semantic features in multi-level representations and automatically concentrate or alleviate information for reasoning through the attention mechanism. The name ClueReader is a metaphor for the pattern of the model: it regards the subjects of queries as the starting points of clues, takes the reasoning entities as bridge points, considers the latent candidate entities as grandmother cells, and the clues end up in candidate entities. The proposed model enables the visualization of the reasoning graph, making it possible to analyze the importance of edges connecting entities and the selectivity in the mention and candidate nodes, which is easier to comprehend empirically. Evaluations on the open-domain multi-hop reading dataset WikiHop and drug-drug interaction dataset MedHop proved the validity of ClueReader and showed the feasibility of its application of the model in the molecular biology domain.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph AttentionMachine Reading ComprehensionReading ComprehensionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Multi-Hyperbolic Space-based Heterogeneous Graph Attention Network
To leverage the complex structures within heterogeneous graphs, recent studies on heterogeneous graph embedding use a hyperbolic space, characterized by a constant negative curvature and exponentially increasing space, w…
Graph AttentionGraph EmbeddingQuestion Directed Graph Attention Network for Numerical Reasoning over Text
Numerical reasoning over texts, such as addition, subtraction, sorting and counting, is a challenging machine reading comprehension task, since it requires both natural language understanding and arithmetic computation. …
Graph AttentionMachine Reading ComprehensionNatural Language UnderstandingQuestion Answering+1SGAT: Simplicial Graph Attention Network
Heterogeneous graphs have multiple node and edge types and are semantically richer than homogeneous graphs. To learn such complex semantics, many graph neural network approaches for heterogeneous graphs use metapaths to …
Graph AttentionGraph LearningGraph Neural NetworkNode ClassificationAPT-MMF: An advanced persistent threat actor attribution method based on multimodal and multilevel feature fusion
Threat actor attribution is a crucial defense strategy for combating advanced persistent threats (APTs). Cyber threat intelligence (CTI), which involves analyzing multisource heterogeneous data from APTs, plays an import…
AttributeGraph AttentionHetReGAT-FC: heterogeneous residual graph attention network via feature completion
Heterogeneous graph embedding is receiving increasing attention from researchers due to the ubiquity of heterogeneous graphs (HGs). How to effectively handle the problem of missing features in HGs has become a hot resear…
Graph AttentionGraph Embedding