Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
41 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
41 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Joint Multi-Facts Reasoning Network For Complex Temporal Question Answering Over Knowledge Graph (2401.02212v1)

Published 4 Jan 2024 in cs.CL and cs.AI

Abstract: Temporal Knowledge Graph (TKG) is an extension of regular knowledge graph by attaching the time scope. Existing temporal knowledge graph question answering (TKGQA) models solely approach simple questions, owing to the prior assumption that each question only contains a single temporal fact with explicit/implicit temporal constraints. Hence, they perform poorly on questions which own multiple temporal facts. In this paper, we propose \textbf{\underline{J}}oint \textbf{\underline{M}}ulti \textbf{\underline{F}}acts \textbf{\underline{R}}easoning \textbf{\underline{N}}etwork (JMFRN), to jointly reasoning multiple temporal facts for accurately answering \emph{complex} temporal questions. Specifically, JMFRN first retrieves question-related temporal facts from TKG for each entity of the given complex question. For joint reasoning, we design two different attention (\ie entity-aware and time-aware) modules, which are suitable for universal settings, to aggregate entities and timestamps information of retrieved facts. Moreover, to filter incorrect type answers, we introduce an additional answer type discrimination task. Extensive experiments demonstrate our proposed method significantly outperforms the state-of-art on the well-known complex temporal question benchmark TimeQuestions.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (33)
  1. Jacob Devlin Ming-Wei Chang Kenton and Lee Kristina Toutanova, “Bert: Pre-training of deep bidirectional transformers for language understanding,” in North American Chapter of the Associationfor Computational Linguistics, 2019, pp. 4171–4186.
  2. “Entities as experts: Sparse memory access with entity supervision,” in Conference on Empirical Methods in Natural Language Processing, 2020, pp. 4937–4951.
  3. “Distantly-supervised named entity recognition with adaptive teacher learning and fine-grained student ensemble,” in AAAI Conference on Artificial Intelligence, 2023, vol. 37, pp. 13501–13509.
  4. “Mirror: A universal framework for various information extraction tasks,” arXiv:2311.05419, 2023.
  5. “Tempoqr: temporal question reasoning over knowledge graphs,” in AAAI Conference on Artificial Intelligence, 2022, pp. 5825–5833.
  6. “Question answering over temporal knowledge graphs,” in Annual Meeting of the Association for Computational Linguistics, 2021, pp. 6663–6676.
  7. “Tensor decompositions for temporal knowledge base completion,” in International Conference on Learning Representations, 2019.
  8. “Temporal knowledge graph question answering via subgraph reasoning,” Knowledge-Based Systems, p. 109134, 2022.
  9. “Complex temporal question answering on knowledge graphs,” in ACM International Conference on Information and Knowledge Management, 2021, pp. 792–802.
  10. “Uniqorn: unified question answering over rdf knowledge graphs and natural language text,” arXiv:2108.08614, 2021.
  11. “Open domain question answering using early fusion of knowledge bases and text,” in Conference on Empirical Methods in Natural Language Processing, 2018, pp. 4231–4242.
  12. “Pullnet: Open domain question answering with iterative retrieval on knowledge bases and text,” in Conference on Empirical Methods in Natural Language Processing, 2019, pp. 2380–2390.
  13. “Improving multi-hop question answering over knowledge graphs using knowledge base embeddings,” in Annual Meeting of the Association for Computational Linguistics, 2020, pp. 4498–4507.
  14. “Ranking and selecting multi-hop knowledge paths to better predict human needs,” in North American Chapter of the Associationfor Computational Linguistics, 2019, pp. 3671–3681.
  15. “Tempquestions: A benchmark for temporal question answering,” in International World Wide Web Conference, 2018, pp. 1057–1062.
  16. “A dataset for answering time-sensitive questions,” in Conference on Neural Information Processing Systems Datasets and Benchmarks Track, 2021.
  17. “Modeling relational data with graph convolutional networks,” in Extended Semantic Web Conference. Springer, 2018, pp. 593–607.
  18. “Forecasttkgquestions: A benchmark for temporal question answering and forecasting over temporal knowledge graphs,” in IEEE International Semantic Web Conference. Springer, 2023, pp. 541–560.
  19. “Improving time sensitivity for question answering over temporal knowledge graphs,” in Annual Meeting of the Association for Computational Linguistics, 2022, pp. 8017–8026.
  20. “Read, retrospect, select: An mrc framework to short text entity linking,” in AAAI Conference on Artificial Intelligence, 2021, pp. 12920–12928.
  21. “Complex embeddings for simple link prediction,” in International Conference on Machine Learning, 2016, pp. 2071–2080.
  22. “Loss re-scaling vqa: revisiting the language prior problem from a class-imbalance view,” IEEE Transactions on Image Processing, vol. 31, pp. 227–238, 2021.
  23. “Semi-supervised hierarchical graph classification,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 2022.
  24. “Delving deep into regularity: A simple but effective method for chinese named entity recognition,” in Findings of North American Chapter of the Associationfor Computational Linguistics, 2022, pp. 1863–1873.
  25. “Distantly-supervised named entity recognition with adaptive teacher learning and fine-grained student ensemble,” arXiv:2212.06522, 2022.
  26. “Dynamic dual graph networks for textbook question answering,” Pattern Recognition, vol. 139, pp. 109441, 2023.
  27. “Answering knowledge-based visual questions via the exploration of question purpose,” Pattern Recognition, p. 109015, 2023.
  28. “Time-aware multiway adaptive fusion network for temporal knowledge graph question answering,” in IEEE International Conference on Acoustics,Speech and Signal Processing, 2023, pp. 1–5.
  29. “Construction of depression knowledge graph based on biomedical literature,” in IEEE International Conference on Bioinformatics and Biomedicine. IEEE, 2021, pp. 1849–1855.
  30. “Two flexible translation-based models for knowledge graph embedding,” Journal of Intelligent & Fuzzy Systems, vol. 44, no. 2, pp. 3093–3105, 2023.
  31. “A performant and incremental algorithm for knowledge graph entity typing,” World Wide Web, pp. 1–18, 2023.
  32. “A survey on knowledge graphs: Representation, acquisition, and applications,” IEEE Transactions on Neural Networks and Learning Systems, vol. 33, no. 2, pp. 494–514, 2021.
  33. “Mvp-tuning: Multi-view knowledge retrieval with prompt tuning for commonsense reasoning,” in Annual Meeting of the Association for Computational Linguistics, 2023, pp. 13417–13432.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Rikui Huang (1 paper)
  2. Wei Wei (424 papers)
  3. Xiaoye Qu (62 papers)
  4. Wenfeng Xie (8 papers)
  5. Xianling Mao (15 papers)
  6. Dangyang Chen (20 papers)
Citations (12)
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets