Mahdi Dehghan

dblp:50/7992 · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
3since 2021 · last 2026
0000-0001-8843-4652ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 6 · 4 first-author · 3 since 2021Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2026 Who Benefits from RAG? The Role of Exposure, Utility and Attribution Bias
Mahdi Dehghan, Graham McDonald
ECIR (1)1
2022 Experiments on Generalizability of User-Oriented Fairness in Recommender Systems
abstract
Recent work in recommender systems mainly focuses on fairness in recommendations as an important aspect of measuring recommendations quality. A fairness-aware recommender system aims to treat different user groups similarly. Relevant work on user-oriented fairness highlights the discriminant behavior of fairness-unaware recommendation algorithms towards a certain user group, defined based on users' activity level. Typical solutions include proposing a user-centered fairness re-ranking framework applied on top of a base ranking model to mitigate its unfair behavior towards a certain user group i.e., disadvantaged group. In this paper, we re-produce a user-oriented fairness study and provide extensive experiments to analyze the dependency of their proposed method on various fairness and recommendation aspects, including the recommendation domain, nature of the base ranking model, and user grouping method. Moreover, we evaluate the final recommendations provided by the re-ranking framework from both user- (e.g., NDCG, user-fairness) and item-side (e.g., novelty, item-fairness) metrics. We discover interesting trends and trade-offs between the model's performance in terms of different evaluation metrics. For instance, we see that the definition of the advantaged/disadvantaged user groups plays a crucial role in the effectiveness of the fairness algorithm and how it improves the performance of specific base ranking models. Finally, we highlight some important open challenges and future directions in this field. We release the data, evaluation pipeline, and the trained models publicly on https://github.com/rahmanidashti/FairRecSys.
Hossein A. Rahmani, Mohammadmehdi Naghiaei, Mahdi Dehghan, Mohammad Aliannejadi
SIGIR3
2021 Persian SemCor: A Bag of Word Sense Annotated Corpus for the Persian Language
abstract
Supervised approaches usually achieve the best performance in the Word Sense Disambiguation problem.However, the unavailability of large sense annotated corpora for many low-resource languages make these approaches inapplicable for them in practice.In this paper, we mitigate this issue for the Persian language by proposing a fully automatic approach for obtaining Persian Sem-Cor (PerSemCor), as a Persian Bag-of-Word (BoW) sense-annotated corpus.We evaluated PerSemCor both intrinsically and extrinsically and showed that it can be effectively used as training sets for Persian supervised WSD systems.To encourage future research on Persian Word Sense Disambiguation, we release the PerSemCor in nlp.sbu.ac.ir .
Hossein Rouhizadeh, Mehrnoush Shamsfard, Mahdi Dehghan, Masoud Rouhizadeh
GWC3
2020 An improvement in the quality of expert finding in community question answering networks
Mahdi Dehghan, Ahmad Ali Abin, Mahmood Neshati
Decis. Support Syst.1
2020 Mining shape of expertise: A novel approach based on convolutional neural network
Mahdi Dehghan, Hossein A. Rahmani, Ahmad Ali Abin, Viet-Vu Vu
Inf. Process. Manag.1
2019 Temporal expert profiling: With an application to T-shaped expert finding
Mahdi Dehghan, Maryam Biabani, Ahmad Ali Abin
Inf. Process. Manag.1
2019 Translations Diversification for Expert Finding: A Novel Clustering-based Approach
abstract
Expert finding is the task of retrieving and ranking knowledgeable people in the subject of user’s query. It is a well-studied problem that has attracted the attention of many researchers. The most important challenge in expert finding is to determine the similarity between query words and documents authored by candidate experts. One of the most important challenges in Information Retrieval (IR) community is the issue of vocabulary gap between queries and documents. In this study, a translation model based on words clustering in two query and co-occurrence spaces is proposed to overcome this problem. First, the words that are semantically close, are clustered in a query space and then each cluster in this space are clustered again in a co-occurrence space. Representatives of each cluster in the co-occurrence space are considered as a diverse subset of the parent cluster. By this method, the query translations are expected to be diversified in the query space. Next, a probabilistic model, that is based on the belonging degree of word to cluster and similarity of cluster to query in the query space, is used to consider the problem of vocabulary gap. Finally, the corresponding translations to each query are used in conjunction with a combination model for expert finding. Experiments on Stack Overflow dataset show the effectiveness of the proposed method for expert finding.
Mahdi Dehghan, Ahmad Ali Abin
ACM Trans. Knowl. Discov. Data1