Yoosof Mashayekhi

Yoosof Mashayekhi

Auto-generated profile, based on publicly available information

Yoosof Mashayekhi

Electronics and Information Systems (ELIS), Ghent University, Gent, Belgium

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 June 2024 in ACM Computing Surveys
Verified
Journal Article
Open access
YMYoosof Mashayekhi
Yoosof Mashayekhi
NLNan Li
Nan Li
BKBo Kang
Bo Kang
JLJefrey Lijffijt
Jefrey Lijffijt
TBTijl De Bie
Tijl De Bie
E-recruitment recommendation systems recommend jobs to job seekers and job seekers to recruiters. The recommendations are generated based on the suitability of job seekers for positions and on job seekers’ and recruiters’ preferences. Therefore, e-recruitment recommendation systems may greatly impact people’s careers. Moreover, by affecting the hiring processes of the companies, e-recruitment recommendation systems play an important role in shaping the competitive edge of companies. Hence, it seems prudent to consider what (unique) challenges there are for recommendation systems in e-recruitment. Existing surveys on this topic discuss past studies from the algorithmic perspective, e.g., by categorizing them into collaborative filtering, content-based, and hybrid methods. This survey, instead, takes a complementary, challenge-based approach. We believe this is more practical for developers facing a concrete e-recruitment design task with a specific set of challenges, and also for researchers that look for impactful research projects in this domain. In this survey, we first identify the main challenges in the e-recruitment recommendation research. Next, we discuss how those challenges have been studied in the literature. Finally, we provide future research directions that we consider most promising in the e-recruitment recommendation domain.

14 September 2023
Verified
Conference Paper
Open access
YMYoosof Mashayekhi
Yoosof Mashayekhi
BKBo Kang
Bo Kang
JLJefrey Lijffijt
Jefrey Lijffijt
TBTijl De Bie
Tijl De Bie
Recommender systems may suffer from congestion, meaning that there is an unequal distribution of the items in how often they are recommended. Some items may be recommended much more than others. Recommenders are increasingly used in domains where items have limited availability, such as the job market, where congestion is especially problematic: Recommending a vacancy—for which typically only one person will be hired—to a large number of job seekers may lead to frustration for job seekers, as they may be applying for jobs where they are not hired. This may also leave vacancies unfilled and result in job market inefficiency. We propose a novel approach to job recommendation called ReCon, accounting for the congestion problem. Our approach is to use an optimal transport component to ensure a more equal spread of vacancies over job seekers, combined with a job recommendation model in a multi-objective optimization problem. We evaluated our approach on two real-world job market datasets. The evaluation results show that ReCon has good performance on both congestion-related (e.g., Congestion) and desirability (e.g., NDCG) measures.

17 April 2024 in IEEE Access
Verified
Journal Article
Open access
YMYoosof Mashayekhi
Yoosof Mashayekhi
BKBo Kang
Bo Kang
JLJefrey Lijffijt
Jefrey Lijffijt
TBTijl De Bie
Tijl De Bie
Recommender systems often face congestion , characterized by an uneven distribution in the frequency of item recommendations. The presence of congestion in recommendations is especially problematic in domains where users or items have limited availability. For example, recommending one vacancy to many job seekers results in frustration of job seekers and job market inefficiency. We propose a novel in-processing approach to job recommendation called ReCon , accounting for the congestion problem. Our approach is to use an optimal transport component to ensure a more equal spread of vacancies over job seekers, combined with a job recommendation model in a multi-objective optimization problem. Moreover, we propose a scalable solution so that ReCon is applicable to large-scale datasets. We evaluated our approach on several real-world job market datasets. The evaluation results show that ReCon has good performance on both congestion-related (e.g., Congestion, Coverage, and Gini Index) and desirability (e.g., NDCG, Recall, and Hit Rate) measures. In most cases, ReCon is Pareto optimal for some selections of hyper-parameters in comparison to the baselines.

17 August 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Open access
YMYoosof Mashayekhi
Yoosof Mashayekhi
BKBo Kang
Bo Kang
JLJefrey Lijffijt
Jefrey Lijffijt
TBTijl De Bie
Tijl De Bie
Real-world data can often be represented as a heterogeneous network relating nodes of different types. E.g., a job market can be represented as a job seeker-skill-vacancy network. It can be relevant to consider the imbalance between nodes of different types, in terms of whether they are similarly connected in the network. For example, it is desirable that job seekers and vacancies are mixed well. If they are not, then there is imbalance. We propose to quantify the imbalance between two sets of nodes in a network as the Earth Mover's Distance between the sets. Given this quantification, we introduce GREASE (Graph imbalance REduction by Adding Sets of Edges), a method that selects a fixed number of unconnected node-pairs, which—if links were added between them—aims to maximally reduce the imbalance. In the job market network, GREASE can be used to select skills that job seekers do not yet have, but could strive to acquire, to reduce the imbalance between job seekers and vacancies. GREASE may also be used in other applications, such as reducing controversy between opposing sides on a polarizing topic. We evaluated GREASE on several datasets and find that GREASE outperforms baselines in reducing network imbalance.

28 January 2026
Verified
Book Chapter
Closed access
RRRaphaël Romero
Raphaël Romero
YMYoosof Mashayekhi
Yoosof Mashayekhi
FLFuyin Lai
Fuyin Lai
MRMaaike Van Roy
Maaike Van Roy
TBTijl De Bie
Tijl De Bie
JDJesse Davis
Jesse Davis