Hansheng Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hansheng Wang has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Rui Pan
School of Statistics and Mathematics, Central University of Finance and Economics
8 shared publications - Xuening Zhu
Fudan University
4 shared publications - Jing Zhou
Renmin University of China
3 shared publications - Yu Chen
Guanghua School of Management, Peking University, Beijing, China
3 shared publications - Danyang Huang
Center for Applied Statistics and School of Statistics Renmin University of China Beijing China
2 shared publications - Feifei Wang
Renmin University of China
2 shared publications
Latest Publications
- 6 September 2025
- Published by Springer Nature in Scientometrics
- Vol. 130 (9) , 5143-5169
Academic literature recommendation in large-scale citation networks enhanced by large language models
- 6 September 2025
- Published by Springer Nature in Scientometrics
- Vol. 130 (9) , 5143-5169
Academic literature recommendation in large-scale citation networks enhanced by large language models
- Open Access
Academic Literature Recommendation in Large-scale Citation Networks Enhanced by Large Language Models
Literature recommendation is essential for researchers to find relevant articles in an ever-growing academic field. However, traditional methods often struggle due to data limitations and methodological challenges. In this work, we construct a large citation network and propose a hybrid recommendation framework for scientific article recommendation. Specifically, the citation network contains 190,381 articles from 70 journals, covering statistics, econometrics, and computer science, spanning from 1981 to 2022. The recommendation mechanism integrates network-based citation patterns with content-based semantic similarities. To enhance content-based recommendations, we employ text-embedding-3-small model of OpenAI to generate an embedding vector for the abstract of each article. The model has two key advantages: computational efficiency and embedding stability during incremental updates, which is crucial for handling dynamic academic databases. Additionally, the recommendation mechanism is designed to allow users to adjust weights according to their preferences, providing flexibility and personalization. Extensive experiments have been conducted to verify the effectiveness of our approach. In summary, our work not only provides a complete data system for building and analyzing citation networks, but also introduces a practical recommendation method that helps researchers navigate the growing volume of academic literature, making it easier to find the most relevant and influential articles in the era of information overload.
Open AccessAcademic Literature Recommendation in Large-scale Citation Networks Enhanced by Large Language Models
Literature recommendation is essential for researchers to find relevant articles in an ever-growing academic field. However, traditional methods often struggle due to data limitations and methodological challenges. In this work, we construct a large citation network and propose a hybrid recommendation framework for scientific article recommendation. Specifically, the citation network contains 190,381 articles from 70 journals, covering statistics, econometrics, and computer science, spanning from 1981 to 2022. The recommendation mechanism integrates network-based citation patterns with content-based semantic similarities. To enhance content-based recommendations, we employ text-embedding-3-small model of OpenAI to generate an embedding vector for the abstract of each article. The model has two key advantages: computational efficiency and embedding stability during incremental updates, which is crucial for handling dynamic academic databases. Additionally, the recommendation mechanism is designed to allow users to adjust weights according to their preferences, providing flexibility and personalization. Extensive experiments have been conducted to verify the effectiveness of our approach. In summary, our work not only provides a complete data system for building and analyzing citation networks, but also introduces a practical recommendation method that helps researchers navigate the growing volume of academic literature, making it easier to find the most relevant and influential articles in the era of information overload.
- Open Access
Auxiliary Learning and its Statistical Understanding
Modern statistical analysis often encounters high-dimensional problems but with a limited sample size. It poses great challenges to traditional statistical estimation methods. In this work, we adopt auxiliary learning to solve the estimation problem in high-dimensional settings. We start with the linear regression setup. To improve the statistical efficiency of the parameter estimator for the primary task, we consider several auxiliary tasks, which share the same covariates with the primary task. Then a weighted estimator for the primary task is developed, which is a linear combination of the ordinary least squares estimators of both the primary task and auxiliary tasks. The optimal weight is analytically derived and the statistical properties of the corresponding weighted estimator are studied. We then extend the weighted estimator to generalized linear regression models. Extensive numerical experiments are conducted to verify our theoretical results. Last, a deep learning-related real-data example of smart vending machines is presented for illustration purposes.
Open AccessAuxiliary Learning and its Statistical Understanding
Modern statistical analysis often encounters high-dimensional problems but with a limited sample size. It poses great challenges to traditional statistical estimation methods. In this work, we adopt auxiliary learning to solve the estimation problem in high-dimensional settings. We start with the linear regression setup. To improve the statistical efficiency of the parameter estimator for the primary task, we consider several auxiliary tasks, which share the same covariates with the primary task. Then a weighted estimator for the primary task is developed, which is a linear combination of the ordinary least squares estimators of both the primary task and auxiliary tasks. The optimal weight is analytically derived and the statistical properties of the corresponding weighted estimator are studied. We then extend the weighted estimator to generalized linear regression models. Extensive numerical experiments are conducted to verify our theoretical results. Last, a deep learning-related real-data example of smart vending machines is presented for illustration purposes.
- 1 January 2024
- Published by International Press of Boston in Statistics and Its Interface
- Vol. 17 (2) , 145-158
Community detection in temporal citation network via a tensor-based approach
International Press of Boston - publishers of scholarly mathematical and scientific journals and books
- 1 January 2024
- Published by International Press of Boston in Statistics and Its Interface
- Vol. 17 (2) , 145-158
Community detection in temporal citation network via a tensor-based approach
International Press of Boston - publishers of scholarly mathematical and scientific journals and books
- 1 January 2024
- Published by International Press of Boston in Statistics and Its Interface
- Vol. 17 (2) , 159-172
A random projection method for large-scale community detection
International Press of Boston - publishers of scholarly mathematical and scientific journals and books
- 1 January 2024
- Published by International Press of Boston in Statistics and Its Interface
- Vol. 17 (2) , 159-172
A random projection method for large-scale community detection
International Press of Boston - publishers of scholarly mathematical and scientific journals and books
- 27 May 2023
- Published by Springer Nature
- p. 457-468
Compressing the Embedding Matrix by a Dictionary Screening Approach in Text Classification
- 27 May 2023
- Published by Springer Nature
- p. 457-468
Compressing the Embedding Matrix by a Dictionary Screening Approach in Text Classification
- Open Access
Improved Naive Bayes with Mislabeled Data
Labeling mistakes are frequently encountered in real-world applications. If not treated well, the labeling mistakes can deteriorate the classification performances of a model seriously. To address this issue, we propose an improved Naive Bayes method for text classification. It is analytically simple and free of subjective judgements on the correct and incorrect labels. By specifying the generating mechanism of incorrect labels, we optimize the corresponding log-likelihood function iteratively by using an EM algorithm. Our simulation and experiment results show that the improved Naive Bayes method greatly improves the performances of the Naive Bayes method with mislabeled data.
Open AccessImproved Naive Bayes with Mislabeled Data
Labeling mistakes are frequently encountered in real-world applications. If not treated well, the labeling mistakes can deteriorate the classification performances of a model seriously. To address this issue, we propose an improved Naive Bayes method for text classification. It is analytically simple and free of subjective judgements on the correct and incorrect labels. By specifying the generating mechanism of incorrect labels, we optimize the corresponding log-likelihood function iteratively by using an EM algorithm. Our simulation and experiment results show that the improved Naive Bayes method greatly improves the performances of the Naive Bayes method with mislabeled data.
- 8 July 2022
- Published by Springer Nature in Science China Mathematics
- Vol. 65 (11) , 2219-2242
A case study on the shareholder network effect of stock market data: An SARMA approach
- 8 July 2022
- Published by Springer Nature in Science China Mathematics
- Vol. 65 (11) , 2219-2242
A case study on the shareholder network effect of stock market data: An SARMA approach
- 1 September 2021
- Published by Elsevier in Neural Networks
- Vol. 141, 11-29
Automatic, dynamic, and nearly optimal learning rate specification via local quadratic approximation
- 1 September 2021
- Published by Elsevier in Neural Networks
- Vol. 141, 11-29
Automatic, dynamic, and nearly optimal learning rate specification via local quadratic approximation
- 1 January 2021
- Published by International Press of Boston in Statistics and Its Interface
- Vol. 14 (2) , 115-129
Information diffusion with network structures
International Press of Boston - publishers of scholarly mathematical and scientific journals and books
- 1 January 2021
- Published by International Press of Boston in Statistics and Its Interface
- Vol. 14 (2) , 115-129
Information diffusion with network structures
International Press of Boston - publishers of scholarly mathematical and scientific journals and books