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

Zhefu Wu

dblp:220/2249 · DBLP profile ↗
← Back
10ranked-venue papers
3as first author
5since 2021 · last 2025
0000-0003-1539-3663ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 since 2021Human-computer interaction and ubiquitous computing · 2 · 2 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

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.

Artificial intelligence
1 paper
Graph learning · 100%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph neural network
0.312018
Link Weight Prediction Using Supervised Learning Methods and Its Application to Yelp Layered Network · IEEE Trans. Knowl. Data Eng. 2018
Machine learning › Graph learning
link prediction
0.312018
Link Weight Prediction Using Supervised Learning Methods and Its Application to Yelp Layered Network · IEEE Trans. Knowl. Data Eng. 2018
Recommender systems › point-of-interest recommendation
restaurant recommendation
0.112018
Link Weight Prediction Using Supervised Learning Methods and Its Application to Yelp Layered Network · IEEE Trans. Knowl. Data Eng. 2018

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

supervised learning · 0.7line graph indices · 0.7centrality indices · 0.7
YearPublicationVenuePosition
2025 Interpretable adversarial neural pairwise ranking for academic network embedding
Agyemang Paul, Zhefu Wu, Luping Fang
Knowl. Inf. Syst.2
2022 Robust multi-objective visual bayesian personalized ranking for multimedia recommendation
Agyemang Paul, Zhefu Wu
Appl. Intell.2
2022 Personalized recommendation: From clothing to academic
Agyemang Paul, Zhefu Wu
Multim. Tools Appl.2
2022 Ownership Recommendation via Iterative Adversarial Training
Agyemang Paul, Xunming Zhao, Luping Fang, Zhefu Wu
Neural Process. Lett.4
2021 Device-Free Orientation Detection Based on CSI and Visibility Graph
abstract
Nonintrusive orientation detection is an important yet largely unaddressed area. It can be used in many important applications, e.g., interactive games, medical care, and various industrial scenarios. Moreover, our novel techniques can be readily implemented in other critical areas, such as indoor localization, objective tracking, movement detection, etc. Many factors can limit the performance of detection algorithms in real-word applications, an important one of which is the negligence of subcarrier correlations. Therefore, we propose to build our system based on existing WiFi infrastructure and its channel state information (CSI). To explore the correlations of adjacent subcarriers, we apply the visibility graph (VG)-based network analysis method to process the CSI data. Specifically, in this article we make the following contributions: 1) we design a CSI-based orientation detection system; 2) we model the correlations between subcarriers using complex network and propose a VG-based feature extraction technique; and 3) we demonstrate the performance and effectiveness of our system with commercial products in real-world deployments. The experimental results show that our technique can achieve more than 98% accuracy and at least 26% better than the baseline approaches.
Zhefu Wu, Xingda Pan, Kunpeng Fan, Yun Xiang
IEEE Trans. Syst. Man Cybern. Syst.1
2020 Blind motion deblurring with cycle generative adversarial networks
Junxia Li, Zhefu Wu
Vis. Comput.4
2018 Network-Based Ranking for Open Source Software Developer Prediction
abstract
Open source software (OSS) projects and communities are becoming increasingly popular and influential recently. Communications and collaborations are essential for the success of projects. Usually, the most active and productive programmers are awarded with promotion to developers. To more effectively manage and progress the projects, it is important and beneficial to rank the programmers and thus, predict the developer candidates. In this work, we propose to combine machine learning techniques with existing complex network node ranking algorithms to improve the prediction results. Specifically, we have made the following contributions: (1), we have designed a novel machine learning-based classifier with significantly improved prediction performance; (2), we have constructed and tested various networks built based on the programmer email communication information; and (3), we have used real-world project data to compare different techniques and validate our methods. Experimental results demonstrate that our technique reduces the error rate by 25% compared with the second best. Moreover, we discover that the [Formula: see text] nearest neighbor (KNN)-based machine learning algorithm and non-directional temporal network with a time window of 1–3 months give the best prediction results.
Zhefu Wu, Chenbo Fu, Qi Xuan 0001, Yun Xiang
Int. J. Softw. Eng. Knowl. Eng.1
2018 Modern Food Foraging Patterns: Geography and Cuisine Choices of Restaurant Patrons on Yelp
abstract
Animals search for food based on certain optimal principles and over time form foraging patterns effective for survival in changing environments. Due to the many choices available in modern society, we also face a decision on where to get their food. We call this “modern human food foraging,” since the Internet makes foraging much more convenient than before. People search online for food venues, or restaurants, through websites such as Yelp, and write reviews for the food they tasted, which in turn, facilitate others' searches in the future. These activities make the whole community of restaurant patrons wiser over time. Moreover, the archives of all these choices and evaluations are publicly available, and can help researchers better understand human foraging patterns in modern society. In this paper, we use a Yelp data set to study modern human food foraging patterns, with respect to both geography and cuisine. To understand spatial patterns, we cluster reviewed restaurants geographically and construct a taste similarity network, representing the topology of restaurant cuisine space. We find that people steadily expand their foraging domains from the nearest to them to the distant in geography and from the most familiar to the novel in cuisine. Using longitudinal data of restaurant reviews, we build a geographical foraging network and a taste foraging network for each patron based on which, we propose three kinds of entropies to characterize foraging patterns. We show that the modern foraging patterns of restaurant patrons in both geography and cuisine are of high regularity, indicating that their behaviors are rather predictable. The foraging patterns are also associated with individual social status in the community. Namely, people having a higher variety in the restaurant cuisines they have visited, but fewer actual locations they visited, tend to attract more followers.
Qi Xuan 0001, Mingming Zhou, Chenbo Fu, Yun Xiang, Zhefu Wu, Vladimir Filkov
IEEE Trans. Comput. Soc. Syst.6
2018 Link Weight Prediction Using Supervised Learning Methods and Its Application to Yelp Layered Network
abstract
Real-world networks feature weights of interactions, where link weights often represent some physical attributes. In many situations, to recover the missing data or predict the network evolution, we need to predict link weights in a network. In this paper, we first proposed a series of new centrality indices for links in line graph. Then, utilizing these line graph indices, as well as a number of original graph indices, we designed three supervised learning methods to realize link weight prediction both in the networks of single layer and multiple layers, which perform much better than several recently proposed baseline methods. We found that the resource allocation index (RA) plays a more important role in the weight prediction than other topological properties, and the line graph indices are at least as important as the original graph indices in link weight prediction. In particular, the success application of our methods on Yelp layered network suggests that we can indeed predict the offline co-foraging behaviors of users just based on their online social interactions, which may open a new direction for link weight prediction algorithms, and meanwhile provide insights to design better restaurant recommendation systems.
Chenbo Fu, Minghao Zhao 0002, Jinyin Chen, Zhefu Wu, Yongxiang Xia, Qi Xuan 0001
IEEE Trans. Knowl. Data Eng.6
2018 Passive Indoor Localization Based on CSI and Naive Bayes Classification
abstract
Passive indoor localization is important. Unlike active localization techniques, it does not require for users to carry measuring devices, e.g., smart phones. Thus, it is widely used in applications such as security, smart housing, object tracking, etc. However, in real-world applications, the passive localization accuracy is limited due to the environment noises, multipath effect, etc. To address those problems, in this paper, we propose to use channel state information (CSI) instead. Specifically, we make the following contributions: 1) we design a CSI-based passive indoor localization system; 2) we develop a Naive Bayes classifier enhanced with confidence level information; and 3) we demonstrate the effectiveness of our technique using real-world deployments. The experimental results show that our technique can achieve more than 86% accuracy on average and at least 15% better than the baseline Naive Bayes classifier.
Zhefu Wu, Chenbo Fu, Qi Xuan 0001, Yun Xiang
IEEE Trans. Syst. Man Cybern. Syst.1