Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Naidan Mei

dblp:357/6915 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%
Software engineering, system software, and programming languages
1 paper
Software maintenance and evolution · 100%
Artificial intelligence
1 paper
Graph learning · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems
collaborative filtering
0.912025
Implicit Supervision-Assisted Graph Collaborative Filtering for Third-Party Library Recommendation · IEEE Trans. Serv. Comput. 2025
Recommender systems › collaborative filtering
graph collaborative filtering
0.912025
Implicit Supervision-Assisted Graph Collaborative Filtering for Third-Party Library Recommendation · IEEE Trans. Serv. Comput. 2025
Software maintenance and evolution
software ecosystems
0.912025
Implicit Supervision-Assisted Graph Collaborative Filtering for Third-Party Library Recommendation · IEEE Trans. Serv. Comput. 2025
Software maintenance and evolution › software ecosystems
third-party library recommendation
0.912025
Implicit Supervision-Assisted Graph Collaborative Filtering for Third-Party Library Recommendation · IEEE Trans. Serv. Comput. 2025
Machine learning › Graph learning
graph neural network
0.312025
Implicit Supervision-Assisted Graph Collaborative Filtering for Third-Party Library Recommendation · IEEE Trans. Serv. Comput. 2025

Methods — techniques the papers use, named apart from their topics

popularity debiasing · 2.6implicit supervision · 2.6
YearPublicationVenuePosition
2025 Implicit Supervision-Assisted Graph Collaborative Filtering for Third-Party Library Recommendation
abstract
Third-party libraries (TPLs) play a crucial role in software development. Utilizing TPL recommender systems can aid software developers in promptly finding useful TPLs. A number of TPL recommendation approaches have been proposed and among them graph neural network (GNN)-based recommendation is attracting the most attention. However, GNN-based approaches generate node representations through multiple convolutional aggregations, which is prone to introducing noise, resulting in the over-smoothing issue. In addition, due to the high sparsity of labelled data, node representations may be biased in real-world scenarios. To address these issues, this paper presents a TPL recommendation method named Implicit Supervision-assisted Graph Collaborative Filtering (ISGCF). Specifically, it takes the App-TPL interaction relationships as input and employs a popularity-debiased method to generate denoised App and TPL graphs. This reduces the noise introduced during graph convolution and alleviates the over-smoothing issue. It also employs a novel implicitly-supervised loss function to exploit the labelled data to learn enhanced node representations. Extensive experiments on a large-scale real-world dataset demonstrate that ISGCF achieves a significant performance advantage over other state-of-the-art TPL recommendation methods in Recall, NDCG and MAP. The experiments also validate the superiority of ISGCF in mitigating the over-smoothing problem.
Lianrong Chen, Mingdong Tang, Naidan Mei, Fenfang Xie, Guo Zhong, Qiang He 0001
IEEE Trans. Serv. Comput.3
2023 High-Order Collaborative Filtering for Third-Party Library Recommendation
abstract
Developers of mobile applications (apps) can enhance their work efficiency by reusing suitable third-party libraries (TPLs). TPLs recommendation methods have been proposed to assist app developers in quickly finding useful TPLs, but the existing methods, such as those based on graph neural networks (GNN), have limitations in extracting high-order neighborhood information that can enhance the representation ability of nodes. To address this issue, we propose a novel hypergraph neural network method based on collaborative filtering, called High-order Collaborative Filtering (HCF). We first build two hypergraphs by fully exploiting the TPLs usage records in apps and then extracting the high-order neighborhood information from the hypergraphs. The neighborhood information extracted contains less noise compared to classic GNNs, thereby alleviating the problem of over-smoothing in GNN node representations. This advantage enables HCF to recommend more accurate and diverse TPLs for apps development. Extensive experiments on a real-world dataset demonstrate that HCF significantly outperforms the state-of-the-art methods in terms of recommendation accuracy and diversity.
Lianrong Chen, Naidan Mei, Yingying He, Wanping Liu, Guo Zhong, Mingdong Tang
ICWS2