GitHub project recommendation based on knowledge graph and developer similarity

Abstract Finding and recommending projects that match developer’s interests is always an urgent problem in open-source community. There are some problems in the existing project recommendation methods, such as insufficient use of information, ignoring the relationship between projects, one-sided consideration, and so on. To solve the above problems, we propose a project recommendation model based on project knowledge graph and developer similarity, called knowledge graphs and developer interest similarity (KGDS). KGDS mines developer interest from project similarity and developer similarity. For project similarity, we first construct the project knowledge graph. Then, content features and potential features are extracted from the project Readme document and knowledge graph, respectively, and the two features are merged to enrich the developer embedding and project embedding, which solves the problem of insufficient utilization of information. For developer similarity, we first construct a developer-project matrix, then obtain the historical developers related to candidate project, and then calculate the similarity between the historical developers and the target developer, which solves the problem of one-sided consideration. Finally, we combine the two part information to recommend projects that meet the interests of developers. We have conducted experiments on the GitHub dataset, and the results show that KGDS outperforms the baseline model.

Authors

Institutions

Publication Details

Journal
The Computer Journal
Published
2025-03-08
DOI
https://doi.org/10.1093/comjnl/bxaf026
Citations
1
Primary Topic
Software Engineering Research
Type
article
Field-Weighted Citation Impact
3.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

GitHub project recommendation based on knowledge graph and developer similarity

Hou‐Ming Wu, Song Yu, Zhifang Liao, Wenlong Liu
1 citations
The Computer Journal
Software Engineering Research
3.25
article

GitHub project recommendation based on knowledge graph and developer similarity

Hou‐Ming Wu, Song Yu, Zhifang Liao, Wenlong Liu
article en
1 citations

Abstract

Abstract Finding and recommending projects that match developer’s interests is always an urgent problem in open-source community. There are some problems in the existing project recommendation methods, such as insufficient use of information, ignoring the relationship between projects, one-sided consideration, and so on. To solve the above problems, we propose a project recommendation model based on project knowledge graph and developer similarity, called knowledge graphs and developer interest similarity (KGDS). KGDS mines developer interest from project similarity and developer similarity. For project similarity, we first construct the project knowledge graph. Then, content features and potential features are extracted from the project Readme document and knowledge graph, respectively, and the two features are merged to enrich the developer embedding and project embedding, which solves the problem of insufficient utilization of information. For developer similarity, we first construct a developer-project matrix, then obtain the historical developers related to candidate project, and then calculate the similarity between the historical developers and the target developer, which solves the problem of one-sided consideration. Finally, we combine the two part information to recommend projects that meet the interests of developers. We have conducted experiments on the GitHub dataset, and the results show that KGDS outperforms the baseline model.

The Computer JournalVol. 68(9)
Central South University (CN)
Openalex Percentile: Top 10%
Software Engineering Research
3.25
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.