<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Mind the Task Gap: Unsupervised Skill-Task Link Prediction for Workforce Upskilling⋆</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yee Sen TAN</string-name>
          <email>ystan98@hotmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Daryl LOW</string-name>
          <email>daryl_low@ssg.gov.sg</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Eugene Chua</string-name>
          <email>eugene_chua@ssg.gov.sg</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alejandro SEIF</string-name>
          <email>alejandro_seif@tech.gov.sg</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Leo LI</string-name>
          <email>Leo_LI@tech.gov.sg</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lois JI</string-name>
          <email>Lois_JI@tech.gov.sg</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Artificial Intelligence Practice, Government Technology Agency</institution>
          ,
          <addr-line>S117438</addr-line>
          ,
          <country country="SG">Singapore</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Skills Development Group, SkillsFuture Singapore</institution>
          ,
          <addr-line>S408533</addr-line>
          ,
          <country country="SG">Singapore</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Rapid advances in emerging technology continue to reshape how tasks appear, disappear and mutate inside modern jobs, while formal job-skill taxonomies refresh only intermittently. To capture this dynamism, we introduce a semantically enriched knowledge graph for Singapore's labor ecosystem that unifies 1869 job roles, 27159 tasks, 3100 skills, 28313 accredited courses and their sector context. The principal data gap is the lack of explicit Skill-Task links, so we cast their recovery as an unsupervised graph-completion problem. Using 50,000 GPT-4o pseudo-labelled pairs, a Variational Graph Autoencoder with GCN encoders attains a macro-F1 of 0.6039, substantially ahead of the semantic-similarity baseline method, demonstrating efective cold-edge discovery. To validate the pseudo labels, we randomly sampled 500 pairs and found over 90% were consistent with our internal taxonomy, although they are not a substitute for full human-verified ground truth. The enriched knowledge graph ofers a more complete view of the labor market, supporting workforce planning and policy. It underpins tools like a Task-Skill radar for policymakers and a bridge-skill career-path recommender for workers, providing stakeholders with clear, data-driven insights for decision-making.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Knowledge Graph</kwd>
        <kwd>Labor Market</kwd>
        <kwd>Link Prediction</kwd>
        <kwd>Graph Neural Networks</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The job market is rapidly evolving, with shifting roles and
growing demand for diverse skills. Technological advances
accelerated by COVID-19—have intensified this trend [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ],
giving rise to new skills such as prompt engineering, now
essential in many careers with the advent of LLMs like
ChatGPT and Gemini [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. With the rapid pace at which
job requirements are changing, there is a need for a unified
representation of the current job-skills market.
      </p>
      <p>
        At the same time, SkillsFuture Singapore (SSG)’s
Singapore Skills Framework[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] lists more than twenty-seven
thousand recognised tasks but contains no explicit mapping from
those tasks to the skills that actually enable them, limiting
its ability to model how skills are applied in real job
functions. This gap directly prevents AI-readiness studies and
conventional manpower planning alike from translating
job-level insight into concrete training action.
      </p>
      <p>
        As the job-skills market changes and with individuals
seeking to upskill or reskill, the huge amount of
information from various resources can still leave them uncertain
about which skills are truly essential for specific
occupations. In response, researchers have suggested building a
knowledge graph (KG) that connects information such as
skills, job titles, and online courses [
        <xref ref-type="bibr" rid="ref1 ref5">1, 5</xref>
        ]. This would create
a structured representation of the relationships between
competencies, roles, and learning resources, ofering a
comprehensive view of the skill ecosystem in the labor market.
      </p>
      <p>While most existing works focus on linking skills to jobs,
they often overlook the crucial role of tasks, which define
what a job actually entails. There is a lack of structured
connections between skills, jobs, and tasks, which limits
our understanding of how skills are applied in real job
functions. As such, this research addresses the lack of existing
links between skills, jobs, and tasks connections that are
largely missing. To bridge this gap, we employ graph-based
methodologies to better represent and infer these hidden
relationships to enable a more complete and data-driven
understanding of the labor market.</p>
      <p>Our key contributions to this research are as follows:
• We aggregate multiple labor market data sources
into a large-scale, semantically enriched knowledge
graph, integrating job roles, tasks, skills, courses,
and sectors to create a unified representation of
Singapore’s labor market.
• We address the problem of inferring missing
connections between tasks and skills by formulating it as
a graph completion task, leveraging unsupervised
link prediction techniques to enhance the knowledge
graph and demonstrating superior performance over
baseline approaches.
• We introduce the first labor market knowledge graph
that explicitly incorporates task information
interconnected with both job roles and skills, providing
a more comprehensive representation of workforce
dynamics, allowing stronger analysis of the labor
market
• Establishing skill-to-task connections in our
knowledge graph enables policy teams to use graph-based
tools to uncover hidden skill gaps and target
funding more efectively through data-driven audits of
emerging competency needs across industries.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related works</title>
      <sec id="sec-2-1">
        <title>2.1. Knowledge Graphs</title>
        <p>
          A knowledge graph (KG) is a structured representation of
real-world entities and their relationships, ofering a
valuable external data source that enhances the model learning
process [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. With the vast amounts of data available, KGs
are gaining popularity due to their ability to provide
semantic and conceptual representations, which makes them
fundamental for structuring knowledge [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], being applied
across various fields, from finance to sentiment analysis and
to labor market studies[
          <xref ref-type="bibr" rid="ref5 ref8">5, 8</xref>
          ].
        </p>
        <p>
          Recent research has specifically highlighted the use of
KGs to map connections between skills, job roles, and
learning resources, providing a comprehensive view of the
jobskills ecosystem in the labor market [
          <xref ref-type="bibr" rid="ref1 ref5">1, 5</xref>
          ]. One of the key
advantages of graph based approaches is their ability to
connect and represent data from diverse domains cohesively.
Studies have also shown that incorporating additional
information, such as multimodal data or data from various
sources, can enhance contextual understanding and lead
to more robust data representations [
          <xref ref-type="bibr" rid="ref10 ref11 ref12 ref9">9, 10, 11, 12</xref>
          ]. In the
case of knowledge graphs, integrating various modalities or
data from diferent sources improves the quality and
informativeness of the knowledge representation. For job-skills
knowledge graphs, this can include incorporating
sectorspecific information, key tasks from job postings, and other
relevant data.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Knowledge Graphs for Labor Market</title>
      </sec>
      <sec id="sec-2-3">
        <title>Representation</title>
        <p>
          Researchers have proposed Job-Skills Knowledge Graph
(JSKG) for organizations to answer labor market related
questions and analysis [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. In their work, they used job data
on a yearly basis, aggregating job posting data annually and
calculating the median values of the salary. Apart from jobs
data, including industry or sector data in analysis is crucial,
as it not only highlights how sectoral changes impact the
labor market and broader economy, but also ensures vital
information is not lost by focusing solely on jobs data [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ].
Without sector data, it will also be impossible to analyze the
evolution of job across the industries overtime, impacting
the ability to predict skill demand and workforce trends
efectively.
        </p>
        <p>One notable gap in the existing literature is that most
research has predominantly focused on the relationship
between jobs and skills, typically do not include a critical
intermediate layer: tasks. Tasks serve as the functional link
between job roles and the specific skills required to perform
them. By omitting tasks, analyses risk oversimplifying the
structure of work, as they fail to account for how skills are
operationalized within specific job functions.</p>
        <p>
          Furthermore, incorporating tasks into labor market
models provides a more nuanced framework for analyzing
changes in employment and earnings, as these are shaped
by the interaction of worker skills, job tasks, and evolving
technologies, thereby enabling better alignment between
workforce capabilities and industry demands [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>2.3. Link Prediction in Knowledge Graphs for Job-Skills Representation</title>
        <p>
          Most labor-market graphs link jobs directly to skills, leaving
tasks as unstructured notes or buried within job
descriptions [
          <xref ref-type="bibr" rid="ref15 ref16">15, 16</xref>
          ]. By modelling tasks as first-class nodes and
inferring Skill–Task edges, our study addresses this critical
blind spot—particularly urgent in an era where AI is rapidly
shifting the skill demands of many occupations.
        </p>
        <p>Despite the growing use of skills taxonomies in labor
market analysis, existing frameworks rarely establish explicit,
structured connections between tasks and skills, which
are typically left as unstructured text or embedded within
job descriptions. To address this structural gap, we frame
Skill–Task linkage as a graph-based link prediction problem,
which introduces unique challenges for evaluation due to
the lack of labeled ground truth.</p>
        <p>
          Evaluating link prediction in knowledge graphs typically
relies on well-established supervised metrics such as
Precision@k, Recall@k, Mean Reciprocal Rank (MRR), and
Mean Average Precision (MAP), particularly when a labeled
ground truth is available[
          <xref ref-type="bibr" rid="ref17 ref18">17, 18</xref>
          ]. However, when annotated
links are sparse or nonexistent, evaluation becomes more
challenging. In such cases, researchers often turn to proxy
methods, including semantic similarity via cosine distance in
embedding space[
          <xref ref-type="bibr" rid="ref19">19</xref>
          ], or graph embedding distance metrics,
where node proximity is derived from structural encodings
such as TransE, Node2Vec, or GraphSAGE[
          <xref ref-type="bibr" rid="ref20 ref21">20, 21</xref>
          ]. These
approaches allow for inference of link plausibility based
on learned representations, even in the absence of labeled
links. Earlier works also proposed graph-based autoencoder
architectures such as Graph Autoencoders (GAE) and
Variational Graph Autoencoders (VGAE) for unsupervised link
prediction tasks[
          <xref ref-type="bibr" rid="ref22">22</xref>
          ] and training with reconstruction loss.
Additionally, human-in-the-loop evaluations, such as expert
assessments or structured prompts using large language
models (LLMs), have gained traction as reliable
complements, particularly in applied settings like labor market
modeling [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ].
        </p>
        <p>In our context, we propose an evaluation strategy using
LLM-generated pseudo labels to assess Skill–Task pairings,
with cosine similarity between pairs serving as a baseline
to benchmark graph-based link predictions.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Data Sources</title>
      <p>In this paper, we utilize data from various sources, including
SkillsFuture Singapore (SSG) and job aggregator platforms.
Additionally, we have developed preprocessing tools to
extract and connect crucial information across diferent labor
market datasets.</p>
      <sec id="sec-3-1">
        <title>3.1. SkillsFuture’s Singapore Skills</title>
      </sec>
      <sec id="sec-3-2">
        <title>Framework (SFw)</title>
        <p>
          The SkillsFuture’s Singapore Skills Framework [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] serves
as a comprehensive knowledge base that provides essential
labor market information, including job roles in diferent
sectors, lists of skills (along with relevant applications and
tools), and mappings that link job roles to critical work
functions and tasks. In our research, the majority of our
data is sourced from this framework, specifically from the
Job Role, Skills, and Task datasets. Altogether, we collected
1,869 unique job roles, 27,159 tasks, and 3,100 skills. Each job
role, task, and skill is accompanied by a textual description,
which forms the primary basis for our data features.
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>3.2. Course Data</title>
        <p>For Course data, the data source is readily available on
SkillsFuture Singapore web portal, where each course comes
with a course description, with other essential information
such as the course fees and duration of the course. The
courses were already pre-tagged internally during creation
of the coureses by the course providers and verified by the
inhouse experts themselves. During the time of this research,
the data set comprises a total of 28,313 courses.</p>
      </sec>
      <sec id="sec-3-4">
        <title>Data to Singapore Skills Framework</title>
        <sec id="sec-3-4-1">
          <title>September).</title>
          <p>(SFw)</p>
        </sec>
      </sec>
      <sec id="sec-3-5">
        <title>3.3. Job Postings Data</title>
        <p>Job postings data will be the main source of data to represent
the labor market in Singapore. Job postings, often found in
Job Portals like MyCareersFuture, JobStreet, LinkedIn,
provides views on the labor market, though, it is only a proxy as
it does not truly represent the entire labor market economy.
Leveraging data acquired from a job aggregation service, we
obtained over 20M job postings from the years 2019 to 2025.
Each of these job posting obtained is also accompanied with
the company name, job title, textual description, and salary
information. Using the respective company names, we will
map them to their corresponding industries based on an
company-to-sector mapping, done by our in-house manual
labelers well versed with the domain.</p>
      </sec>
      <sec id="sec-3-6">
        <title>3.4. Additional Tools to link Job Market</title>
        <p>Although we obtained data from various source such as
job roles data, skills data, and job postings data, deriving
accurate and meaningful insights from these sources
individually posed several challenges. In particular, job postings
often consist of a job title accompanied by an unstructured
text description, with no explicit mention of the required
skills or the SFw job role.</p>
        <p>For example, a posting titled "Data Analyst" may describe
responsibilities such as "Perform analysis using Tableau and
provide recommendations based on data insights", yet it
may omit explicit mention of the skill "Data Visualization",
which is defined in the SFw.</p>
        <p>In another instance, a job posting with the same title
might mention tasks such as "fine-tuning large language
models, applying deep learning, and developing ensemble
methods", which actually align better with the SFw defined
role of "Data Scientist".</p>
        <p>
          To preprocess the data and extract insights aligned with
our research objectives, we employed the skills extraction
methodology from [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ]. This algorithm processes textual
job descriptions and maps the identified skills to those
recognized in the SkillsFuture taxonomy, producing a structured
list of skills standardized to the SF framework.
        </p>
        <p>In addition, we used an internal tool, a job role
classiifcation tool with, which classifies job postings to their
corresponding SFw recognized job roles instead of skills.
These tools enabled robust alignment between job postings
and data sources from the SFw, providing a coherent and
enriched data set for our knowledge graph creation and
subsequent analysis.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Our Methodology</title>
      <sec id="sec-4-1">
        <title>4.1. Knowledge Graph Construction</title>
        <p>
          Using the data and information available, we construct a
structured knowledge graph to represent relationships
between key labor market entities, including Skills, Tasks,
Courses, Job Roles, and Sectors. Each entity is
modeled as a node with various relevant attributes (e.g., name,
description, or salary information, while edges
encode typed relationships with weights to represent their
strength or relevance. Note that for each of these nodes, the
textual description are represented as embeddings,
computing using the all-base-mpnet-v2 model [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ]. Note that in our
4.1.1. Deriving relationship between Skills and Job
        </p>
        <p>
          Roles
In deriving the relationship between skills and job roles, we
follow the methodology proposed in [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], which combines
expert-defined knowledge (done by SkillsFuture Singapore’s
labor economist) from the Singapore Skills Framework (SFw)
with job posting data to estimate the importance of each
skill for a given job. To maintain relevance and reduce noise,
we retain only the top 10 highest-ranked skills per job role,
as unfiltered job postings may list over 100 skills. Note that
these 10 skills could be further tuned and optimized for.
While the original approach aggregates and computes edge
scores at the Singapore Standard Occupational Classification
(SSOC) level [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], we adapt it by aggregating at the more
granular level of Job Role instead, keeping all other aspects
unchanged. The formulas used are shown below where 
indicates skill,   indicates Job Role,  indicates year and
∆  indicates the size in years of the window to analyze:
LM(,  , ) = 
︃(
max
∑︁
=max− Δ
(1 + max − )− 12 )︃
(,  , )
 (,  ) =
 SFW
        </p>
        <p>1
+
SFW(,  )
LM(,  , )
(1)</p>
        <p>Once  (,  ) is calculated for each skill–JobRole pair,
we rank the results based on their corresponding 
values, keeping only the top 10 scores. This informs the most
important required skills for each Job Role.
4.1.2. Deriving relationship between Course-Skill,</p>
        <p>JobRole-Task, edges towards Sector
The derivation of course-skill and jobrole-task relationships
are straightforward, as the Singapore Skills Framework
already encapsulates this information. This framework is
collaboratively developed by a diverse group of
stakeholders, including employers, industry associations, educational
institutions, unions, and government agencies, specifically
for the Singapore workforce.</p>
        <p>
          For the edges pointing to Sector, the information is also
self-contained, as the job dataset we receive already includes
sector annotations for each job posting, provided by human
annotators. Therefore, to derive the relationship between
each JobRole and Sector, we compute both the count and
proportion of each job role within each sector. These metrics
capture the relative prevalence of a role in a sector, enabling
the edge weights between JobRole and Sector to reflect both
absolute frequency and sector-specific importance.
4.1.3. Deriving SIMILAR TO relationships
The derivation of all the SIMILAR_TO relationships is also
straightforward. Since these edges represent similarity
between nodes of the same type and each node includes a
textual description, we use the all-mpnet-base-v2 model
[
          <xref ref-type="bibr" rid="ref25">25</xref>
          ] to compute embeddings. Cosine similarity between
these embeddings is then used to quantify how similar the
skills are. We opt for cosine similarity over Jaccard because
the latter is limited to exact token overlaps. For example,
while "Deep Learning" and "Machine Learning" are
conceptually related, Jaccard similarity may fail to capture this
connection.
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Knowledge Graph Completion</title>
        <p>After constructing the knowledge graph, we infer missing
Skill–Task links to enrich the graph and support workforce
analytics, recommendations, and labor market predictions.
We leverage unsupervised techniques, particularly Graph
Autoencoders (GAE) and Variational Graph Autoencoders
(VGAE), which have proven efective in learning
meaningful latent representations without requiring labeled edges.
These models encode nodes into a continuous latent space
by capturing both node features and graph topology, and
then decode these embeddings to reconstruct the original
graph structure, optimizing a reconstruction loss that
encourages the accurate prediction of edges.</p>
        <p>We will integrate three diferent encoder architectures, to
investigate their respective impacts on embedding quality
and link prediction performance. Specifically, the following:
• GraphSAGE aggregates neighborhood information
through sampling strategies, extended with
attention mechanisms to dynamically weigh neighbor
importance.
• Graph Attention Networks (GAT) employ
selfattention to assign learnable weights to neighbors,
enhancing the model’s ability to focus on relevant
graph regions.
• Graph Convolutional Networks (GCN) utilize
spectral convolutions to propagate and aggregate
node features over graph structures.</p>
        <p>To address the lack of labeled edges in job-skills graphs,
we generate pseudo labels using GPT-4o, which classifies
whether a given skill is relevant to a specific task, as
illustrated below.</p>
        <sec id="sec-4-2-1">
          <title>LLM Skill–Task Classification Prompt</title>
        </sec>
        <sec id="sec-4-2-2">
          <title>Given the following Skill and Task, determine</title>
          <p>whether the skill is relevant to the task and whether
it can help accomplish it.</p>
          <p>• Respond with Yes or No for relevance.
• Provide a brief explanation (1–2 sentences)
supporting your answer.</p>
        </sec>
        <sec id="sec-4-2-3">
          <title>Skill: [Insert skill here] Task: [Insert task here]</title>
          <p>This enables a quantitative assessment of link plausibility
between Skill and Task nodes using standard classification
metrics (Accuracy, Precision, Recall, Macro F1 score). Given
the large number of Skill→Task pairs (&gt;80M), generating
pseudo labels for the entire set would be prohibitively
expensive. Therefore, we randomly sampled 50,000 pairs for
pseudo-labeling and evaluation. We note that these pseudo
labels are used solely for relative method comparison and
do not represent absolute correctness, since a diferent LLM
could provide entirely diferent result. However, in a smaller
validation sample of 500 pairs, we found that over 90% of the
pseudo labels aligned with our expectations after reviewing,
suggesting that the labels are reasonably reliable.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Experiment Setup and Evaluation</title>
      <p>
        Our experiment will involve comparing the performance of
GAE and VGAE, as well as the diferent encoders
(GraphSage, GraphSage with attention, Graph Attention Networks,
and Graph Convolutionary Networks). Additionally, as a
baseline, we incorporate a semantic similarity method based
on the all-mpnet-base-v2 [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ], computing cosine
similarity between Skill and Task embeddings. This baseline
facilitates direct comparison against graph-based approaches.
      </p>
      <p>For all experiments, the dataset edges were split
into training and test sets using a 20% test ratio with
train_test_split_edges. The model was trained on
a single T4 GPU with 768-dimensional embeddings using
the AdamW optimizer (learning rate 0.001, weight decay
1 × 10− 4) and using reconstruction loss to measure how
well the model reconstructs and predict from the learned
representation. Edge dropout ( = 0.3) was applied for
regularization, and training employed early stopping with
a patience of 20 epochs and a maximum of 2000 epochs.</p>
      <p>
        For evaluation, we use the same standard metrics across
all experiments, namely, Accuracy, Precision, Recall, and
Macro F1 score on the same fixed dataset of 50,000 samples
which is pseudo-labelled by GPT-4o. To address class
imbalance, we also tune each model to maximize the Macro
F1 score, thereby promoting balanced performance across
classes. Note that we did not consider the Area Under the
Curve (AUC) scores due to its limitations in link prediction
and inapplicability for imbalanced tasks [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]. Furthermore,
AUC focuses solely on ranking and averages performance
across all thresholds, ignoring probability calibration,
practical decision boundaries, and unequal costs of false positives
and false negatives. Given the highly imbalanced nature of
link prediction and the need for accurate, actionable
probability estimates, we instead rely on the proposed metrics to
better capture real world performance and decision making
relevance. The full results of these experiments, based on
the most optimal thresholds, are summarized in Table 1.
      </p>
      <p>The results indicate that the baseline method, which
computes cosine similarity between each Skill and Task pair,
achieves very high precision. However, this comes at the
cost of extremely low recall, resulting in a low overall Macro
F1 score of 0.0331. While this baseline method excels in
identifying only highly confident positive matches (hence the
extremely high precision), it fails to capture a large
proportion of true positives, as indicated by the very low recall.
This indicates that the baseline is overly conservative in
predicting positive matches, resulting in a poor F1 score despite
high accuracy (0.6687). The outcome illustrates the typical
pitfall of high precision but negligible recall, which is
particularly undesirable in imbalanced classification problems
where missing positives is costly.</p>
      <p>For graph-based approaches, all experiments showed that
it substantially outperform the baseline in terms of Macro F1
score, demonstrating their efectiveness for link prediction
given its ability to understand and connect the relationships
between skills and tasks, probably due to the middle node,
the job role node, which connects skills and tasks in the
middle. Notably, architectures incorporating VGAE
consistently outperform their deterministic GAE counterparts. For
example, GCN-VGAE achieves an F1 score of 0.6039
compared to 0.4497 for GCN-GAE; GAT-VGAE scores 0.5883 vs.
0.5634 for GAT-GAE; and GraphSAGE + Attention-VGAE
reaches 0.5861 compared to 0.5187 for the corresponding
GAE model. This consistent improvement suggests that
VGAE’s probabilistic framework capturing uncertainty in
latent representations provides better regularization and
generalization, especially in the presence of class imbalance.</p>
      <p>Overall, GCN-VGAE delivered the strongest overall
performance, with the highest accuracy (0.7345), precision
(0.6102), and F1 (0.6039), while GAT-VGAE and GraphSAGE
+ Attention-VGAE also performed well, though gains from
attention mechanisms were modest.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Downstream Real-World</title>
    </sec>
    <sec id="sec-7">
      <title>Applications of the Enriched</title>
    </sec>
    <sec id="sec-8">
      <title>Graph</title>
      <p>Establishing links between tasks and skills within our
knowledge graph potentially enables a range of downstream
applications for labor market stakeholders and policy analysts at
SSG. Such graph-enabled tools may facilitate the translation
of structural insights into actionable strategies for
workforce planning, career guidance, and training optimization.</p>
      <p>The knowledge graph enables several applications: a
Task–Skill Radar highlights tasks with weak skill coverage
and relevant subsidized courses; a Bridge-Skill Career Paths
recommender identifies high-confidence skill sequences for
career transitions, including AI-specific skills; a
CoursePortfolio Optimiser flags courses misaligned with current
task clusters; and a Task Centrality Monitor alerts agencies
when critical tasks lack suficient skill coverage. These tools
support targeted reskilling, portfolio alignment, and policy
interventions, complementing national initiatives like
SkillsFuture subsidies and Career Conversion Programmes, while
allowing granular monitoring of emerging trends such as
AI-driven task shifts.</p>
      <p>In sum, the enriched knowledge graph represents not
only a technical advancement in labor market modeling but
also a practical foundation for informed decision-making
across the workforce ecosystem.</p>
    </sec>
    <sec id="sec-9">
      <title>7. Conclusion</title>
      <p>In this study, we proposed a graphical method to
represent Singapore’s labor market, and showed how a graphical
method can be used for enriching a labor market knowledge
graph, specifically, by using an unsupervised link prediction
method. By leveraging a well defined schema grounded in
real world workforce data, we constructed a rich
knowledge graph and applied both GAE and VGAE across several
encoder architectures (GCN, GAT, GraphSAGE).</p>
      <p>Our link prediction experiments showed that graph-based
models outperformed the baseline in Macro F1 score,
highlighting their strength under class imbalance. The
GCNVGAE architecture achieved the best overall results.
Including the job role node as an intermediary improved relational
learning, helping models better link skills to tasks. These
ifndings demonstrate the value of graph-based approaches
for labor market intelligence and set the foundation for
further analysis to support data-driven policy decisions.</p>
      <sec id="sec-9-1">
        <title>7.1. Limitations and Future Works</title>
        <p>The evaluation was performed on a sample of 50,000
Skill→Task pairs, which constitutes less than 5% of the
entire dataset encompassing all Skill-Task combinations.
Future work could increase the number of samples and
employ stratified sampling to balance representation across
sectors, or analyze specific sectors individually to better
reflect sector-specific patterns.</p>
        <p>Another key limitation of our study is that evaluation
relies on GPT-4o-generated pseudo labels rather than
humanannotated ground truth. Consequently, our results reflect
relative method performance under proxy labels and do not
provide an absolute measure of correctness.Moving forward,
we aim to incorporate human-annotated ground truth labels
between skill and task nodes, enabling the exploration of
supervised learning approaches that may yield improved
performance. Additionally, increasing the sample size in
future evaluations will help ensure greater robustness and
better generalization of the findings.</p>
        <p>Lastly, future work could improve the baseline’s low
recall by treating the number of retained skills per job as a
hyperparameter to tune. Additionally, its performance may
depend on the choice of LLM for generating pseudo-ground
truth, suggesting that experimenting with diferent
models or hybrid labeling approaches could capture more true
positives without sacrificing precision.</p>
      </sec>
    </sec>
    <sec id="sec-10">
      <title>8. Acknowledgments</title>
      <p>The authors acknowledge the support of SkillsFuture
Singapore and Government Technology Agency of Singapore for
their support in this research.</p>
    </sec>
    <sec id="sec-11">
      <title>Declaration on Generative AI</title>
      <p>During the preparation of this work, the author(s) used
GPT-4o for evaluation purposes as highlighted above. The
author(s) also used ChatGPT Free Tier for grammar and
spelling checks for this paper, which the author(s) further
reviewed, and take full responsibility for the publication’s
content.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Fettach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bahaj</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ghogho</surname>
          </string-name>
          ,
          <string-name>
            <surname>Jobedkg:</surname>
          </string-name>
          <article-title>An uncertain knowledge graph-based approach for recommending online courses and predicting in-demand skills based on career choices</article-title>
          ,
          <source>Engineering Applications of Artificial Intelligence</source>
          <volume>131</volume>
          (
          <year>2024</year>
          )
          <fpage>107779</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>L.</given-names>
            <surname>Borghans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. Ter</given-names>
            <surname>Weel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. A.</given-names>
            <surname>Weinberg</surname>
          </string-name>
          ,
          <article-title>People skills and the labor-market outcomes of underrepresented groups</article-title>
          ,
          <source>Ilr Review</source>
          <volume>67</volume>
          (
          <year>2014</year>
          )
          <fpage>287</fpage>
          -
          <lpage>334</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>P.</given-names>
            <surname>Bansal</surname>
          </string-name>
          ,
          <article-title>Prompt engineering importance and applicability with generative ai</article-title>
          ,
          <source>Journal of Computer and Communications</source>
          <volume>12</volume>
          (
          <year>2024</year>
          )
          <fpage>14</fpage>
          -
          <lpage>23</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>SkillsFuture</given-names>
            <surname>Singapore</surname>
          </string-name>
          ,
          <article-title>Skills framework</article-title>
          , n.d. URL: https://www.skillsfuture.gov.sg/skills-framework, accessed:
          <fpage>22</fpage>
          -Jul-
          <year>2025</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A.</given-names>
            <surname>Seif</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Toh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <article-title>A dynamic jobs-skills knowledge graph (</article-title>
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ji</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Pan</surname>
          </string-name>
          , E. Cambria,
          <string-name>
            <given-names>P.</given-names>
            <surname>Marttinen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. Y.</given-names>
            <surname>Philip</surname>
          </string-name>
          ,
          <article-title>A survey on knowledge graphs: Representation, acquisition, and applications</article-title>
          ,
          <source>IEEE transactions on neural networks and learning systems 33</source>
          (
          <year>2021</year>
          )
          <fpage>494</fpage>
          -
          <lpage>514</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>X.</given-names>
            <surname>Zou</surname>
          </string-name>
          ,
          <article-title>A survey on application of knowledge graph</article-title>
          ,
          <source>in: Journal of Physics: Conference Series</source>
          , volume
          <volume>1487</volume>
          ,
          <string-name>
            <given-names>IOP</given-names>
            <surname>Publishing</surname>
          </string-name>
          ,
          <year>2020</year>
          , p.
          <fpage>012016</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Hu</surname>
          </string-name>
          , G. Yan,
          <string-name>
            <given-names>Y. S.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Pen</surname>
          </string-name>
          ,
          <article-title>Stock price prediction using graph attention networks with sentiment analysis</article-title>
          ,
          <source>in: Pacific-Asia Conference on Knowledge Discovery and Data Mining</source>
          , Springer,
          <year>2025</year>
          , pp.
          <fpage>399</fpage>
          -
          <lpage>408</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <article-title>Multimodal reasoning with multimodal knowledge graph</article-title>
          ,
          <source>arXiv preprint arXiv:2406</source>
          .
          <year>02030</year>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Y. S.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Teo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Ghe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Fong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Video sentiment analysis for child safety</article-title>
          ,
          <source>in: 2023 International Conference on Data Mining</source>
          , ICDM: Shanghai, December, IEEE,
          <year>2023</year>
          , pp.
          <fpage>783</fpage>
          -
          <lpage>790</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Y. S.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          , E. Cambria,
          <article-title>Explainable multimodal sentiment analysis of social media visual content for child safety</article-title>
          ,
          <source>IEEE Intelligent Systems</source>
          <volume>40</volume>
          (
          <year>2025</year>
          )
          <fpage>64</fpage>
          -
          <lpage>72</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Enhancing multimodal knowledge graph representation learning through triple contrastive learning</article-title>
          ,
          <source>in: Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence</source>
          ,
          <year>2024</year>
          , pp.
          <fpage>5963</fpage>
          -
          <lpage>5971</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>A.</given-names>
            <surname>Pacana</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Siwiec</surname>
          </string-name>
          ,
          <article-title>An analysis of the changes of employment in industry</article-title>
          ,
          <source>Humanities and Social Sciences</source>
          <volume>26</volume>
          (
          <year>2019</year>
          )
          <fpage>121</fpage>
          -
          <lpage>130</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>D.</given-names>
            <surname>Acemoglu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Autor</surname>
          </string-name>
          ,
          <article-title>Chapter 12-skills, tasks and technologies: Implications for employment and earnings (d. card &amp; o</article-title>
          . ashenfelter, eds.), Elsevier. https://doi. org/10.1016/S0169-
          <volume>7218</volume>
          (
          <issue>11</issue>
          ) (
          <year>2011</year>
          )
          <fpage>02410</fpage>
          -
          <lpage>5</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>E.</given-names>
            <surname>Atalay</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Phongthiengtham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sotelo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Tannenbaum</surname>
          </string-name>
          ,
          <article-title>The evolution of work in the united states</article-title>
          ,
          <source>American Economic Journal: Applied Economics</source>
          <volume>12</volume>
          (
          <year>2020</year>
          )
          <fpage>1</fpage>
          -
          <lpage>34</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>M.</given-names>
            <surname>Sigelman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Taska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. O</given-names>
            <surname>'Kane</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Nitschke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Strack</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Baier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Breitling</surname>
          </string-name>
          , Á. Kotsis,
          <article-title>Shifting skills, moving targets, and remaking the workforce, Burning Glass Institute</article-title>
          . https://static1. squarespace.
          <source>com/static/6</source>
          <volume>1</volume>
          (
          <issue>2022</issue>
          )
          <article-title>7</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>A.</given-names>
            <surname>Bordes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Usunier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Garcia-Duran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Weston</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Yakhnenko</surname>
          </string-name>
          ,
          <article-title>Translating embeddings for modeling multi-relational data</article-title>
          ,
          <source>in: Advances in neural information processing systems</source>
          , volume
          <volume>26</volume>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>M.</given-names>
            <surname>Nickel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Murphy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Tresp</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Gabrilovich</surname>
          </string-name>
          ,
          <article-title>A review of relational machine learning for knowledge graphs</article-title>
          ,
          <source>Proceedings of the IEEE</source>
          <volume>104</volume>
          (
          <year>2016</year>
          )
          <fpage>11</fpage>
          -
          <lpage>33</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>N.</given-names>
            <surname>Reimers</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gurevych</surname>
          </string-name>
          ,
          <article-title>Sentence-bert: Sentence embeddings using siamese bert-networks</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing (EMNLP)</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>3982</fpage>
          -
          <lpage>3992</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>A.</given-names>
            <surname>Grover</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Leskovec</surname>
          </string-name>
          , node2vec:
          <article-title>Scalable feature learning for networks</article-title>
          ,
          <source>in: Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>855</fpage>
          -
          <lpage>864</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Mao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <article-title>Knowledge graph embedding: A survey of approaches and applications</article-title>
          ,
          <source>IEEE Transactions on Knowledge and Data Engineering</source>
          <volume>29</volume>
          (
          <year>2017</year>
          )
          <fpage>2724</fpage>
          -
          <lpage>2743</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>T. N.</given-names>
            <surname>Kipf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Welling</surname>
          </string-name>
          , Variational graph autoencoders,
          <source>arXiv preprint arXiv:1611.07308</source>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>R.</given-names>
            <surname>Bommasani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. A.</given-names>
            <surname>Hudson</surname>
          </string-name>
          , E. Adeli,
          <string-name>
            <given-names>R.</given-names>
            <surname>Altman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Arora</surname>
          </string-name>
          , M. von
          <string-name>
            <surname>Arx</surname>
          </string-name>
          , et al.,
          <article-title>On the opportunities and risks of foundation models</article-title>
          ,
          <source>arXiv preprint arXiv:2108.07258</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>Y. S.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Low</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Toh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Enhancing skills extraction for domain-specific taxonomy mapping</article-title>
          ,
          <source>in: Pacific-Asia Conference on Knowledge Discovery and Data Mining</source>
          , Springer,
          <year>2025</year>
          , pp.
          <fpage>324</fpage>
          -
          <lpage>335</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>N.</given-names>
            <surname>Reimers</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gurevych</surname>
          </string-name>
          ,
          <article-title>Sentence-bert: Sentence embeddings using siamese bert-networks</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics</source>
          ,
          <year>2019</year>
          . URL: https://arxiv.org/abs/
          <year>1908</year>
          .10084.
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Shomer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Mao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zeng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <article-title>Evaluating graph neural networks for link prediction: Current pitfalls and new benchmarking</article-title>
          ,
          <source>Advances in Neural Information Processing Systems</source>
          <volume>36</volume>
          (
          <year>2023</year>
          )
          <fpage>3853</fpage>
          -
          <lpage>3866</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>W.</given-names>
            <surname>Hamilton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ying</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Leskovec</surname>
          </string-name>
          ,
          <article-title>Inductive representation learning on large graphs</article-title>
          ,
          <source>Advances in neural information processing systems</source>
          <volume>30</volume>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>P.</given-names>
            <surname>Veličković</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Cucurull</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Casanova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Romero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Lio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          ,
          <article-title>Graph attention networks</article-title>
          ,
          <source>arXiv preprint arXiv:1710.10903</source>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>T. N.</given-names>
            <surname>Kipf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Welling</surname>
          </string-name>
          ,
          <article-title>Semi-supervised classification with graph convolutional networks</article-title>
          ,
          <source>arXiv preprint arXiv:1609.02907</source>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>