Rui Tang
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
Research Subjects
Rui Tang has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Simon Fong
University of Macau, Macao, China
3 shared publications - Liuyang Yang
Yunnan Cancer Hospital, The Third Affiliated Hospital of Kunming Medical University, Kunming, China
2 shared publications - Wei Li
Kunming Medical University, Kunming, China
2 shared publications - Yu Chen
School of Management and Economics, Kunming University of Science and Technology, Kunming, China
2 shared publications - Athanasios Vasilakos
University of Agder (UiA)
1 shared publication - Dennis Wong
Macao Polytechnic University
1 shared publication
Latest Publications
- Open Access
- 14 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 64-70
Graph Energy Variety Network-based Out-of-distribution Detection
- 14 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 64-70
Open AccessGraph Energy Variety Network-based Out-of-distribution Detection
- Open Access
- 17 April 2023
- Published by AME Publishing Company in Quantitative Imaging in Medicine and Surgery
- Vol. 13 (7) , 4205-4221
A lightweight neural network for lung nodule detection based on improved ghost module
Original Article A lightweight neural network for lung nodule detection based on improved ghost module Liuyang Yang, Hongyu Cai, Xinyu Luo, Jianping Wu, Rui Tang, Yu Chen, Wei Li
- 17 April 2023
- Published by AME Publishing Company in Quantitative Imaging in Medicine and Surgery
- Vol. 13 (7) , 4205-4221
Open AccessA lightweight neural network for lung nodule detection based on improved ghost module
Original Article A lightweight neural network for lung nodule detection based on improved ghost module Liuyang Yang, Hongyu Cai, Xinyu Luo, Jianping Wu, Rui Tang, Yu Chen, Wei Li
- 1 November 2021
- Published by Elsevier in Expert Systems with Applications
- Vol. 183, 115434
Dynamic group optimization algorithm with a mean–variance search framework
- 1 November 2021
- Published by Elsevier in Expert Systems with Applications
- Vol. 183, 115434
Dynamic group optimization algorithm with a mean–variance search framework
- 1 September 2021
- Published by Elsevier in Computer Methods and Programs in Biomedicine
- Vol. 208, 106258
Multi-classification of arrhythmias using a HCRNet on imbalanced ECG datasets
- 1 September 2021
- Published by Elsevier in Computer Methods and Programs in Biomedicine
- Vol. 208, 106258
Multi-classification of arrhythmias using a HCRNet on imbalanced ECG datasets
- 20 February 2020
- Published by Springer Nature in Neural Computing and Applications
- Vol. 32 (19) , 15469-15488
Multi-view convolutional neural network with leader and long-tail particle swarm optimizer for enhancing heart disease and breast cancer detection
- 20 February 2020
- Published by Springer Nature in Neural Computing and Applications
- Vol. 32 (19) , 15469-15488
Multi-view convolutional neural network with leader and long-tail particle swarm optimizer for enhancing heart disease and breast cancer detection
- Open Access
- 28 November 2013
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2013, 1-18
Selecting Optimal Feature Set in High-Dimensional Data by Swarm Search
Selecting the right set of features from data of high dimensionality for inducing an accurate classification model is a tough computational challenge. It is almost a NP-hard problem as the combinations of features escalate exponentially as the number of features increases. Unfortunately in data mining, as well as other engineering applications and bioinformatics, some data are described by a long array of features. Many feature subset selection algorithms have been proposed in the past, but not all of them are effective. Since it takes seemingly forever to use brute force in exhaustively trying every possible combination of features, stochastic optimization may be a solution. In this paper, we propose a new feature selection scheme called Swarm Search to find an optimal feature set by using metaheuristics. The advantage of Swarm Search is its flexibility in integrating any classifier into its fitness function and plugging in any metaheuristic algorithm to facilitate heuristic search. Simulation experiments are carried out by testing the Swarm Search over some high-dimensional datasets, with different classification algorithms and various metaheuristic algorithms. The comparative experiment results show that Swarm Search is able to attain relatively low error rates in classification without shrinking the size of the feature subset to its minimum.
- 28 November 2013
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2013, 1-18
Open AccessSelecting Optimal Feature Set in High-Dimensional Data by Swarm Search
Selecting the right set of features from data of high dimensionality for inducing an accurate classification model is a tough computational challenge. It is almost a NP-hard problem as the combinations of features escalate exponentially as the number of features increases. Unfortunately in data mining, as well as other engineering applications and bioinformatics, some data are described by a long array of features. Many feature subset selection algorithms have been proposed in the past, but not all of them are effective. Since it takes seemingly forever to use brute force in exhaustively trying every possible combination of features, stochastic optimization may be a solution. In this paper, we propose a new feature selection scheme called Swarm Search to find an optimal feature set by using metaheuristics. The advantage of Swarm Search is its flexibility in integrating any classifier into its fitness function and plugging in any metaheuristic algorithm to facilitate heuristic search. Simulation experiments are carried out by testing the Swarm Search over some high-dimensional datasets, with different classification algorithms and various metaheuristic algorithms. The comparative experiment results show that Swarm Search is able to attain relatively low error rates in classification without shrinking the size of the feature subset to its minimum.