Pengfeng Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Pengfeng Li has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Feng Zhang
College of Mechanical Engineering and Automation
1 shared publication - Jin Hu
College of Information Engineering, Northwest AF University, Yangling, China
1 shared publication - JunYue Zhuang
Zhejiang University
1 shared publication - Mingmin Huang
College of Physics, Sichuan University 1 , Chengdu 610065
1 shared publication - Yixiong Chen
School of Metallurgy and Environment, Central South University, Changsha 410083, China; Key Laboratory of Metallurgical Separation Science and Engineering, China Nonferrous Metals Industry, Changsha 410083, China
1 shared publication - Zeng-Guang Hou
University of Chinese Academy of Sciences
1 shared publication
Latest Publications
- Open Access
- 7 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 74-78
A Prediction Algorithm for User Satisfaction Rating Based on Random Forest Optimized by Simulated Annealing
This article proposes a machine learning prediction algorithm that removes subjective feature sequence dimension selection. Under the conditions of imbalanced data distribution, multiple classification categories, and strong subjectivity in user ratings in the user satisfaction scoring dataset provided by Beijing Mobile, a rigorous and reliable optimization algorithm for predicting user satisfaction scoring is developed by integrating Simulated Annealing (SA), Random Forest (RF), and Stacking under known conditions. Based on the characteristic of too many feature sequences in the dataset, we use the Simulated Annealing to search for the feature sequence that could maximize the macro-F1 score of the Random Forest model and construct the prediction dataset with the best performance for the Random Forest model. We also use multiple rounds of grid search to select the optimal Random Forest model parameters. Stacking is used to predict specific scores in each data set. Finally, the constructed scoring prediction model significantly improves prediction accuracy. This algorithm improves the accuracy of scoring prediction from the original 0.55 to approximately 0.7. However, its limitation lies in the fact that it performs better and achieves higher accuracy only in a large sample dataset.
- 7 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 74-78
Open AccessA Prediction Algorithm for User Satisfaction Rating Based on Random Forest Optimized by Simulated Annealing
This article proposes a machine learning prediction algorithm that removes subjective feature sequence dimension selection. Under the conditions of imbalanced data distribution, multiple classification categories, and strong subjectivity in user ratings in the user satisfaction scoring dataset provided by Beijing Mobile, a rigorous and reliable optimization algorithm for predicting user satisfaction scoring is developed by integrating Simulated Annealing (SA), Random Forest (RF), and Stacking under known conditions. Based on the characteristic of too many feature sequences in the dataset, we use the Simulated Annealing to search for the feature sequence that could maximize the macro-F1 score of the Random Forest model and construct the prediction dataset with the best performance for the Random Forest model. We also use multiple rounds of grid search to select the optimal Random Forest model parameters. Stacking is used to predict specific scores in each data set. Finally, the constructed scoring prediction model significantly improves prediction accuracy. This algorithm improves the accuracy of scoring prediction from the original 0.55 to approximately 0.7. However, its limitation lies in the fact that it performs better and achieves higher accuracy only in a large sample dataset.
- 1 August 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2012 (1094687X) , 6032-6035
Training strategies for a lower limb rehabilitation robot based on impedance control
This paper proposes three training strategies based on impedance control, including passive training, damping-active training and spring-active training, for a 3-DOF lower limb rehabilitation robot designed for patients with paraplegia or hemiplegia. Controllers with similar structure are developed for these training strategies, consisting of dual closed loops, the outer impedance control loop and the inner position/velocity control loop, known as position-based impedance control method. Simulation results verify that position-based impedance control approach is feasible to accomplish the training strategies.
- 1 August 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2012 (1094687X) , 6032-6035
Training strategies for a lower limb rehabilitation robot based on impedance control
This paper proposes three training strategies based on impedance control, including passive training, damping-active training and spring-active training, for a 3-DOF lower limb rehabilitation robot designed for patients with paraplegia or hemiplegia. Controllers with similar structure are developed for these training strategies, consisting of dual closed loops, the outer impedance control loop and the inner position/velocity control loop, known as position-based impedance control method. Simulation results verify that position-based impedance control approach is feasible to accomplish the training strategies.