Mahdiyar Ali Akbar Alavi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mahdiyar Ali Akbar Alavi has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Faezeh Ensan
Department of Electrical, Computer, and Biomedical Engineering, Toronto Metropolitan University, Toronto, ON, Canada
3 shared publications - Fattane Zarrinkalam
University of Guelph, Guelph, Canada
3 shared publications - Jack Longwell
Toronto Metropolitan University, Toronto, Ontario, Canada
1 shared publication - Julien Serbanescu
University of Guelph, Guelph, Ontario, Canada
1 shared publication - Parastoo Jafarzadeh
Toronto Metropolitan University, Toronto, Ontario, Canada
1 shared publication
Latest Publications
- Open Access
- 6 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 160-168
FalseCoTQA: Adversarial Multi-Hop QA via Knowledge-Grounded False Chains of Thought
- 6 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 160-168
Open AccessFalseCoTQA: Adversarial Multi-Hop QA via Knowledge-Grounded False Chains of Thought
- Open Access
- 24 January 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 43 (2) , 1-27
A Knowledge Graph Embedding Model for Answering Factoid Entity Questions
Factoid entity questions (FEQ), which seek answers in the form of a single entity from knowledge sources, such as DBpedia and Wikidata, constitute a substantial portion of user queries in search engines. This article introduces the knowledge graph embedding model for FEQ (KGE-FEQ) answering. Leveraging a textual knowledge graph derived from extensive text collections, KGE-FEQ encodes textual relationships between entities. The model employs a two-step process: (1) Triple Retrieval, where relevant triples are retrieved from the textual knowledge graph based on semantic similarities to the question, and (2) Answer Selection, where a knowledge graph embedding approach is utilized for answering the question. This involves positioning the embedding for the answer entity close to the embedding of the question entity, incorporating a vector representing the question and textual relations between entities. Extensive experiments evaluate the performance of the proposed approach, comparing KGE-FEQ to state-of-the-art baselines in FEQ answering and the most advanced open-domain question answering techniques applied to FEQs. The results show that KGE-FEQ outperforms existing methods across different datasets. Ablation studies highlights the effectiveness of KGE-FEQ when both the question and textual relations between entities are considered for answering questions.
- 24 January 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 43 (2) , 1-27
Open AccessA Knowledge Graph Embedding Model for Answering Factoid Entity Questions
Factoid entity questions (FEQ), which seek answers in the form of a single entity from knowledge sources, such as DBpedia and Wikidata, constitute a substantial portion of user queries in search engines. This article introduces the knowledge graph embedding model for FEQ (KGE-FEQ) answering. Leveraging a textual knowledge graph derived from extensive text collections, KGE-FEQ encodes textual relationships between entities. The model employs a two-step process: (1) Triple Retrieval, where relevant triples are retrieved from the textual knowledge graph based on semantic similarities to the question, and (2) Answer Selection, where a knowledge graph embedding approach is utilized for answering the question. This involves positioning the embedding for the answer entity close to the embedding of the question entity, incorporating a vector representing the question and textual relations between entities. Extensive experiments evaluate the performance of the proposed approach, comparing KGE-FEQ to state-of-the-art baselines in FEQ answering and the most advanced open-domain question answering techniques applied to FEQs. The results show that KGE-FEQ outperforms existing methods across different datasets. Ablation studies highlights the effectiveness of KGE-FEQ when both the question and textual relations between entities are considered for answering questions.
- Open Access
- 8 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 269-273
Triple Augmented Generative Language Models for SPARQL Query Generation from Natural Language Questions
Knowledge Graph Question Answering (KGQA) leverages structured Knowledge Graphs (KG) to respond to Natural Language Questions (NLQ). This paper explores integrating Generative Language Models (GLMs) augmented with knowledge graph triple retrievers into the KGQA framework to generate accurate SPARQL queries from NLQs. Specifically, we evaluate the effectiveness of integrating triple retriever models with the SPARQL-generating capabilities of GLMs by investigating: (1) the standalone capabilities of GLMs independent of retriever performance, (2) the impact of incorporating a base retriever (BM25), and (3) a comparative analysis with state-of-the-art KGQA methods. Our experiments demonstrate that by incorporating a triple retrieval module, GLMs can generate accurate SPARQL queries and outperform current end-to-end KGQA methods, particularly when paired with an optimal retriever.
- 8 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 269-273
Open AccessTriple Augmented Generative Language Models for SPARQL Query Generation from Natural Language Questions
Knowledge Graph Question Answering (KGQA) leverages structured Knowledge Graphs (KG) to respond to Natural Language Questions (NLQ). This paper explores integrating Generative Language Models (GLMs) augmented with knowledge graph triple retrievers into the KGQA framework to generate accurate SPARQL queries from NLQs. Specifically, we evaluate the effectiveness of integrating triple retriever models with the SPARQL-generating capabilities of GLMs by investigating: (1) the standalone capabilities of GLMs independent of retriever performance, (2) the impact of incorporating a base retriever (BM25), and (3) a comparative analysis with state-of-the-art KGQA methods. Our experiments demonstrate that by incorporating a triple retrieval module, GLMs can generate accurate SPARQL queries and outperform current end-to-end KGQA methods, particularly when paired with an optimal retriever.