Occupation similarity through bipartite graphs
Similarity between occupations is a crucial piece of information when making career decisions. However, the notion of a single and unified occupation similarity measure is more of a limitation than an asset. The goal of the study is to assess multiple explainable occupation similarity measures that can provide different insights into inter-occupation relations. Several such measures are derived using the framework of bipartite graphs. Their viability is assessed on more than 450,000 job transitions occurring in Slovenia in the period between 2012 and 2021. The results support the hypothesis that several similarity measures are plausible and that they present different feasible career paths. The complete implementation and part of the datasets are available at https://repo.ijs.si/pboskoski/bipartite_job_similarity_code.
Code (1)
Similar Papers 제목 키워드 기반
Efficient and Effective Similarity Search over Bipartite Graphs
Similarity search over a bipartite graph aims to retrieve from the graph the nodes that are similar to each other, which finds applications in various fields such as online advertising, recommender systems etc. Existing …
Recommendation SystemsA Two Step Approach to Weighted Bipartite Link Recommendations
Many real world person-person or person-product relationships can be modeled graphically. More specifically, bipartite graphs can be especially useful when modeling scenarios that involve two disjoint groups. As a result…
Vocal Bursts Valence PredictionReflexive Regular Equivalence for Bipartite Data
Bipartite data is common in data engineering and brings unique challenges, particularly when it comes to clustering tasks that impose on strong structural assumptions. This work presents an unsupervised method for assess…
ClusteringCascade-BGNN: Toward Efficient Self-supervised Representation Learning on Large-scale Bipartite Graphs
Bipartite graphs have been used to represent data relationships in many data-mining applications such as in E-commerce recommendation systems. Since learning in graph space is more complicated than in Euclidian space, re…
Graph Neural NetworkRecommendation SystemsRepresentation LearningCo-Embedding: Discovering Communities on Bipartite Graphs through Projection
Many datasets take the form of a bipartite graph where two types of nodes are connected by relationships, like the movies watched by a user or the tags associated with a file. The partitioning of the bipartite graph coul…
Information RetrievalRecommendation SystemsRetrieval