Zhenhua Shi

dblp:160/0789 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
3since 2021 · last 2024
—ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, 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
Kernel, tree and ensemble methods · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Kernel, tree and ensemble methods
ensemble learning
0.712023
BoostTree and BoostForest for Ensemble Learning · IEEE Trans. Pattern Anal. Mach. Intell. 2023
Machine learning › Kernel, tree and ensemble methods
gradient boosting
0.712023
BoostTree and BoostForest for Ensemble Learning · IEEE Trans. Pattern Anal. Mach. Intell. 2023
Machine learning › Kernel, tree and ensemble methods
decision tree
0.212023
BoostTree and BoostForest for Ensemble Learning · IEEE Trans. Pattern Anal. Mach. Intell. 2023

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

random cut-points · 0.7gradient boosting · 0.7bootstrapping · 0.7
YearPublicationVenuePosition
2024 Deep spatiotemporal fusion network for vision-based robotic inspection of structures
Tarutal Ghosh Mondal, Zhenhua Shi, Genda Chen
Eng. Appl. Artif. Intell.2
2023 BoostTree and BoostForest for Ensemble Learning
abstract
Bootstrap aggregating (Bagging) and boosting are two popular ensemble learning approaches, which combine multiple base learners to generate a composite model for more accurate and more reliable performance. They have been widely used in biology, engineering, healthcare, etc. This article proposes BoostForest, which is an ensemble learning approach using BoostTree as base learners and can be used for both classification and regression. BoostTree constructs a tree model by gradient boosting. It increases the randomness (diversity) by drawing the cut-points randomly at node splitting. BoostForest further increases the randomness by bootstrapping the training data in constructing different BoostTrees. BoostForest generally outperformed four classical ensemble learning approaches (Random Forest, Extra-Trees, XGBoost and LightGBM) on 35 classification and regression datasets. Remarkably, BoostForest tunes its parameters by simply sampling them randomly from a parameter pool, which can be easily specified, and its ensemble learning framework can also be used to combine many other base learners.
Changming Zhao, Dongrui Wu, Jian Huang 0001, Ye Yuan 0002, Hai-Tao Zhang, Ruimin Peng, Zhenhua Shi
IEEE Trans. Pattern Anal. Mach. Intell.7
2021 FCM-RDpA: TSK fuzzy regression model construction using fuzzy C-means clustering, regularization, Droprule, and Powerball Adabelief
Zhenhua Shi, Dongrui Wu, Chenfeng Guo, Changming Zhao, Yuqi Cui, Fei-Yue Wang 0001
Inf. Sci.1
2020 Supervised Discriminative Sparse PCA with Adaptive Neighbors for Dimensionality Reduction
abstract
Dimensionality reduction is an important operation in information visualization, feature extraction, clustering, regression, and classification, especially for processing noisy high dimensional data. However, most existing approaches preserve either the global or the local structure of the data, but not both. Approaches that preserve only the global data structure, such as principal component analysis (PCA), are usually sensitive to outliers. Approaches that preserve only the local data structure, such as locality preserving projections, are usually unsupervised (and hence cannot use label information) and uses a fixed similarity graph. We propose a novel linear dimensionality reduction approach, supervised discriminative sparse PCA with adaptive neighbors (SDSPCAAN), to integrate neighborhood-free supervised discriminative sparse PCA and projected clustering with adaptive neighbors. As a result, both global and local data structures, as well as the label information, are used for better dimensionality reduction. Classification experiments on nine high-dimensional datasets validated the effectiveness and robustness of our proposed SDSPCAAN.
Zhenhua Shi, Dongrui Wu, Jian Huang 0001, Yu-Kai Wang, Chin-Teng Lin
IJCNN1
2015 Measurements of the Cross-Loop Antenna Patterns in High-Frequency Surface Wave Radars
abstract
In this letter, measurements of the cross-loop antenna patterns in the Ocean State Measuring and Analyzing Radar type S (OSMAR-S) for monitoring ocean environments are discussed. First, the patterns of the cross-loop antenna are measured by using a moving transponder. The results are not so good, as expected, due to the unstable transmitting signals and impacts of the environments. Then, an improved measurement method of the cross-loop antenna patterns is presented. The transmitting antenna is fixed, and the cross-loop antenna is fixed on a turntable and rotated with it to receive signals coming from different directions. In addition, the cross-loop antenna is connected to capacitors to resonate at the operating frequency. Then, the receiving signals of the operating frequency are strengthened, and the effects of environment are reduced. The near-field and far-field experiments are performed, and the measured patterns are of “8” shapes. Impacts of metal obstacles are also discussed, which provide a basis for evaluating antenna erection of the OSMAR-S. The ocean currents calculated from the patterns measured by the method in this letter are compared with that measured by an acoustic Doppler current profiler. They are in a good agreement, which proves the validation of the measurement method.
Xinzhi Shi, Xinjun Xu, Zhenhua Shi, Zhihan Tang
IEEE Geosci. Remote. Sens. Lett.3