A knowledge graph-integrated recommendation method for college student career planning

Abstract Facing the complex and diverse interests of college students, current career planning recommendation methods often suffer from low accuracy. To tackle this, we propose a novel knowledge graph-integrated recommendation model. Our approach begins by constructing a comprehensive career planning knowledge graph. We then project sparse user and item vectors into a dense latent space. Leveraging triplet information from the graph, we form project neighborhoods and employ a Graph Convolutional Network to adaptively aggregate neighbor vectors, deriving enriched representations for students and careers. A key innovation is the fusion of these graph-based representations with those from a generalized matrix factorization component. The concatenated vectors are fed into a fully connected layer to output the final recommendation score. Extensive comparative experiments on three real-world career planning datasets demonstrate the superiority of our model, showing significant improvements in recommendation accuracy of at least 2.04%, 2.26%, and 1.34%, respectively, over state-of-the-art methods.

Authors

Institutions

Publication Details

Journal
Discover Artificial Intelligence
Published
2026-03-29
DOI
https://doi.org/10.1007/s44163-026-00996-9
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A knowledge graph-integrated recommendation method for college student career planning

Hui Gao, Xiaojun Xu
Discover Artificial Intelligence
Advanced Graph Neural Networks
article

A knowledge graph-integrated recommendation method for college student career planning

Hui Gao, Xiaojun Xu
article en

Abstract

Abstract Facing the complex and diverse interests of college students, current career planning recommendation methods often suffer from low accuracy. To tackle this, we propose a novel knowledge graph-integrated recommendation model. Our approach begins by constructing a comprehensive career planning knowledge graph. We then project sparse user and item vectors into a dense latent space. Leveraging triplet information from the graph, we form project neighborhoods and employ a Graph Convolutional Network to adaptively aggregate neighbor vectors, deriving enriched representations for students and careers. A key innovation is the fusion of these graph-based representations with those from a generalized matrix factorization component. The concatenated vectors are fed into a fully connected layer to output the final recommendation score. Extensive comparative experiments on three real-world career planning datasets demonstrate the superiority of our model, showing significant improvements in recommendation accuracy of at least 2.04%, 2.26%, and 1.34%, respectively, over state-of-the-art methods.

Discover Artificial Intelligence
Yunnan Vocational College of Mechanical and Electrical Technology (CN), Yunnan Forestry Vocational and Technical College (CN), Yunnan University of Finance And Economics (CN)
Industry, innovation and infrastructure
Openalex Percentile: Top 2%
Advanced Graph Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.