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

Yongjun Hu

dblp:201/3143 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0002-9395-7535ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 since 2021Computer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 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.

Computer networks
1 paper
Edge and fog computing · 50% Content delivery and video streaming · 50%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

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

TopicWeightPapersLastEvidence papers
Content delivery and video streaming
content placement
0.412019
Localized Small Cell Caching: A Machine Learning Approach Based on Rating Data · IEEE Trans. Commun. 2019
Content delivery and video streaming › caching › distributed caching
device-to-device caching
0.412019
Localized Small Cell Caching: A Machine Learning Approach Based on Rating Data · IEEE Trans. Commun. 2019
Edge and fog computing › edge caching
small-cell caching
0.412019
Localized Small Cell Caching: A Machine Learning Approach Based on Rating Data · IEEE Trans. Commun. 2019
Edge and fog computing › edge caching
wireless edge caching
0.412019
Localized Small Cell Caching: A Machine Learning Approach Based on Rating Data · IEEE Trans. Commun. 2019
Recommender systems › collaborative filtering
rating prediction
0.112019
Localized Small Cell Caching: A Machine Learning Approach Based on Rating Data · IEEE Trans. Commun. 2019

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

reinforcement learning · 0.8matrix factorization · 0.8bayesian learning · 0.8
YearPublicationVenuePosition
2023 Construction of Multi-Label Personality Trait Recognition Model in Chinese Text Based on Emotional Features
abstract
The key to improve the service effect of virtual digital human is the personality trait recognition technology of users. However, the complexity of Chinese and the sparsity of short texts limit the accuracy of personality trait recognition. Therefore, we applied emotional features to the research of personality trait recognition and constructed a deep learning model for Chinese corpus personality trait recognition to improve the accuracy of personality trait recognition. The model ([Formula: see text] extracted semantic features and embedded emotional features through RoBERTa-wwm-ext Chinese pre-training model, BiLSTM neural network, and attention mechanism. Some experiments were carried out using two Chinese datasets with different scenes. The comparative experiments and ablation experiments showed that the overall effect of the personality trait recognition model ([Formula: see text] is the best, and the Macro-F1 value reaches 75.3%, which is significantly better than the existing models. The results showed that emotional features can significantly improve the accuracy of multi-label personality trait classification in both Chinese daily life scenarios and online scenarios. The proposed model can integrate emotional features and Chinese semantic features to improve the accuracy of personality traits recognition. These findings support the development of personality trait recognition and the application of virtual digital human.
Liuqian Zhu, Yongjun Hu, Yutong Zou
Int. J. Pattern Recognit. Artif. Intell.4
2019 Localized Small Cell Caching: A Machine Learning Approach Based on Rating Data
abstract
Caching the most popular contents at the wireless network edge such as small-cell base stations (SBSs) is a smart way of reducing duplicated content transmissions and offloading the mobile data traffic in the network backhaul. Currently, most small-cell caching strategies are conceived, designed, and optimized based on the global content request probability (GCRP), with very limited consideration of the individual content request probability (ICRP) reflecting personal preferences. To enable more efficient wireless caching, in this paper, we propose a novel localized deterministic caching framework, drawing upon the recent advances in recommendation systems based on machine learning techniques. By introducing the concept of the rating matrix, we first propose a new Bayesian learning method to predict personal preferences and estimate the ICRP. This crucial information is then incorporated into our caching strategy for maximizing the system throughput, or equivalently, minimizing the download latency, where a deterministic caching algorithm based on reinforcement learning is proposed to optimize the content placement. To this end, we extend the framework to enable device-to-device (D2D) connections to further reduce the download delay, and also design a feedback mechanism to improve the accuracy in the ICRP estimation. Our simulation results verified that with the estimated ICRP and the proposed caching strategy, the proposed framework can significantly outperform the existing methods in terms of hit rate and system throughput.
Peng Cheng 0002, Chuan Ma 0001, Ming Ding 0001, Yongjun Hu, Zihuai Lin, Yonghui Li 0001, Branka Vucetic
IEEE Trans. Commun.4
2018 Mobile Bayesian Spectrum Learning for Heterogeneous Networks
abstract
Spectrum sensing in heterogeneous networks is very challenging as it usually requires a large number of static secondary users (SUs) to capture the global spectrum states. In this paper, we tackle the spectrum sensing in heterogeneous networks from a new perspective. We exploit the mobility of multiple SUs to simultaneously collect spatial-temporal spectrum sensing data. Then, we propose a new non-parametric Bayesian learning model, referred to as beta process hidden Markov model to capture the spatio-temporal correlation in the collected spectrum data. Finally, Bayesian inference is carried out to establish the global spectrum picture. Simulation results show that the proposed algorithm can achieve a significant spectrum sensing performance improvement in terms of receiver operating characteristic curve and detection accuracy compared with other existing spectrum sensing algorithm.
Yizhen Xu, Peng Cheng 0002, Zhuo Chen 0001, Yongjun Hu, Yonghui Li 0001, Branka Vucetic
ICASSP4
2017 Multi-channel EEG Classification Based on Fast Convolutional Feature Extraction
Qian Wang 0052, Yongjun Hu, He Henry Chen
ISNN (2)2