Wei Huang
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
Wei Huang has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
Jinsong Wang
School of Computer Science and Engineering, Tianjin University of Technology, Tianjin 300384, China
6 shared publications- Zhilei Xu
Beijing Inst Technol, Sch Cyberspace Sci & Technol, Beijing 100081, Peoples R China
6 shared publications - Liehuang Zhu
Beijing Institute of Technology
5 shared publications - Sung-Kwun Oh
School of Automation and Electrical Engineering, Linyi University, Linyi, China
4 shared publications - Shaohua Wan
University of Electronic Science and Technology of China
3 shared publications - Witold Pedrycz
University of Alberta
3 shared publications
Latest Publications
- 13 March 2026
- Published by Elsevier in Neural Networks
- Vol. 200, 108807
A delay-Adaptive neural network for querying TOP-k critical vertices on time-Dependent shortest paths
- 13 March 2026
- Published by Elsevier in Neural Networks
- Vol. 200, 108807
A delay-Adaptive neural network for querying TOP-k critical vertices on time-Dependent shortest paths
- Open Access
ShadowBlock: Efficient Dynamic Anonymous Blocklisting and Its Cross-chain Application
Online harassment, incitement to violence, racist behavior, and other harmful content on social media can damage social harmony and even break the law. Traditional blocklisting technologies can block malicious users, but this comes at the expense of identity privacy. The anonymous blocklisting has emerged as an effective mechanism to restrict the abuse of freedom of speech while protecting user identity privacy. However, the state-of-the-art anonymous blocklisting schemes suffer from either poor dynamism or low efficiency. In this paper, we propose $\mathsf{ShadowBlock}$, an efficient dynamic anonymous blocklisting scheme. Specifically, we utilize the pseudorandom function and cryptographic accumulator to construct the public blocklisting, enabling users to prove they are not on the blocklisting in an anonymous manner. To improve verification efficiency, we design an aggregation zero-knowledge proof mechanism that converts multiple verification operations into a single one. In addition, we leverage the accumulator's property to achieve efficient updates of the blocklisting, i.e., the original proof can be reused with minimal updates rather than regenerating the entire proof. Experiments show that $\mathsf{ShadowBlock}$ has better dynamics and efficiency than the existing schemes. Finally, the discussion on applications indicates that $\mathsf{ShadowBlock}$ also holds significant value and has broad prospects in emerging fields such as cross-chain identity management.Open AccessShadowBlock: Efficient Dynamic Anonymous Blocklisting and Its Cross-chain Application
Online harassment, incitement to violence, racist behavior, and other harmful content on social media can damage social harmony and even break the law. Traditional blocklisting technologies can block malicious users, but this comes at the expense of identity privacy. The anonymous blocklisting has emerged as an effective mechanism to restrict the abuse of freedom of speech while protecting user identity privacy. However, the state-of-the-art anonymous blocklisting schemes suffer from either poor dynamism or low efficiency. In this paper, we propose $\mathsf{ShadowBlock}$, an efficient dynamic anonymous blocklisting scheme. Specifically, we utilize the pseudorandom function and cryptographic accumulator to construct the public blocklisting, enabling users to prove they are not on the blocklisting in an anonymous manner. To improve verification efficiency, we design an aggregation zero-knowledge proof mechanism that converts multiple verification operations into a single one. In addition, we leverage the accumulator's property to achieve efficient updates of the blocklisting, i.e., the original proof can be reused with minimal updates rather than regenerating the entire proof. Experiments show that $\mathsf{ShadowBlock}$ has better dynamics and efficiency than the existing schemes. Finally, the discussion on applications indicates that $\mathsf{ShadowBlock}$ also holds significant value and has broad prospects in emerging fields such as cross-chain identity management. - 15 December 2025
- Published by Springer Nature in Applied Intelligence
- Vol. 55 (18) , 1146
Fuzzy reinforced hyperbox neural network: analysis and design
- 15 December 2025
- Published by Springer Nature in Applied Intelligence
- Vol. 55 (18) , 1146
Fuzzy reinforced hyperbox neural network: analysis and design
- Open Access
- 23 January 2025
- Published by MDPI AG in Electronics
- Vol. 14 (3) , 465
Design of Self-Optimizing Polynomial Neural Networks with Temporal Feature Enhancement for Time Series Classification
Time series classification is a significant and complex issue in data mining, it is prevalent across various fields and holds substantial research value. However, enhancing the classification rate of time series data remains a formidable challenge. Traditional time series classification methods often face difficulties related to insufficient feature extraction or excessive model complexity. In this study, we propose a self-optimizing polynomial neural network with a temporal feature enhancement, which is referred to as OPNN-T. Existing classifiers based on polynomial neural networks (PNNs) struggle to achieve high-quality performances when dealing with time series data, primarily due to their inability to extract temporal information effectively. The goal of the proposed classifier is to enhance the nonlinear modeling capability for time series data, thereby improving the classification rate in practical applications. The key features of the proposed OPNN-T include the following: (1) A temporal feature module is employed to capture the dependencies in time series data, providing adaptability and flexibility in handling complex temporal patterns. (2) A polynomial neural network (PNN) is constructed using sub-datasets combined with three types of polynomial neurons, which enhances its nonlinear modeling capabilities across diverse scenarios. (3) A self-optimization mechanism is integrated into iteratively optimized sub-datasets, features, and polynomial types, resulting in significant improvements in the classification rate. The experimental results demonstrate that the proposed method achieves superior performances across multiple standard time series datasets, exhibiting higher classification accuracy and greater robustness than the existing classification models. Our research offers an effective solution for time series classification, and highlights the potential of polynomial neural networks in this field.
- 23 January 2025
- Published by MDPI AG in Electronics
- Vol. 14 (3) , 465
Open AccessDesign of Self-Optimizing Polynomial Neural Networks with Temporal Feature Enhancement for Time Series Classification
Time series classification is a significant and complex issue in data mining, it is prevalent across various fields and holds substantial research value. However, enhancing the classification rate of time series data remains a formidable challenge. Traditional time series classification methods often face difficulties related to insufficient feature extraction or excessive model complexity. In this study, we propose a self-optimizing polynomial neural network with a temporal feature enhancement, which is referred to as OPNN-T. Existing classifiers based on polynomial neural networks (PNNs) struggle to achieve high-quality performances when dealing with time series data, primarily due to their inability to extract temporal information effectively. The goal of the proposed classifier is to enhance the nonlinear modeling capability for time series data, thereby improving the classification rate in practical applications. The key features of the proposed OPNN-T include the following: (1) A temporal feature module is employed to capture the dependencies in time series data, providing adaptability and flexibility in handling complex temporal patterns. (2) A polynomial neural network (PNN) is constructed using sub-datasets combined with three types of polynomial neurons, which enhances its nonlinear modeling capabilities across diverse scenarios. (3) A self-optimization mechanism is integrated into iteratively optimized sub-datasets, features, and polynomial types, resulting in significant improvements in the classification rate. The experimental results demonstrate that the proposed method achieves superior performances across multiple standard time series datasets, exhibiting higher classification accuracy and greater robustness than the existing classification models. Our research offers an effective solution for time series classification, and highlights the potential of polynomial neural networks in this field.
- 23 August 2024
- Published by Elsevier in Knowledge-Based Systems
- Vol. 303
An adaptive time-varying neural network for solving K optimal time-varying destroy locations query problem
- 23 August 2024
- Published by Elsevier in Knowledge-Based Systems
- Vol. 303
An adaptive time-varying neural network for solving K optimal time-varying destroy locations query problem
- 14 August 2024
- Published by Springer Nature
- p. 99-110
Augmented Fuzzy Min-Max Neural Network Driven to Preprocessing Techniques and Space Search Optimization Algorithm
- 14 August 2024
- Published by Springer Nature
- p. 99-110
Augmented Fuzzy Min-Max Neural Network Driven to Preprocessing Techniques and Space Search Optimization Algorithm
- 21 March 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 249
Latent space search approach for domain adaptation
- 21 March 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 249
Latent space search approach for domain adaptation
- 6 January 2024
- Published by Springer Nature in Applied Intelligence
- Vol. 54 (2) , 1426-1444
Design of fuzzy hyperbox classifiers based on a two-stage genetic algorithm and simultaneous strategy
- 6 January 2024
- Published by Springer Nature in Applied Intelligence
- Vol. 54 (2) , 1426-1444
Design of fuzzy hyperbox classifiers based on a two-stage genetic algorithm and simultaneous strategy
- 11 November 2023
- Published by World Scientific Pub Co Pte Ltd in Journal of Circuits, Systems and Computers
- Vol. 33 (07)
Cascade AdaBoost Neural Network Classifier: Analysis and Design
In this paper, we propose a cascade AdaBoost neural network (CANN) based on concepts and construct of AdaBoost neurons and cascade structure. Compared with AdaBoost, CANN can represent complex relationships between features. In CANN, representation learning is performed through AdaBoost, and the method of random selection features is utilized to encourage the diversity of AdaBoost neurons. Through the cascade structure, CANN has the context structure for complex feature representation. At the same time, in order to avoid the problem of feature disappearance, shortcut connection is used to add the previous information to the later nodes. Furthermore, particle swarm optimization (PSO) algorithm is utilized to optimize the structure of CANN, it can obtain the number of iterations to achieve better performance. Two types of CANN are proposed based — binary-classification CANN (BCANN) or multi-classification CANN (MCANN). The performance of CANN is evaluated with two kinds of data sets: machine learning data sets and atrial fibrillation data set. A comparative analysis illustrates that the proposed CANN leads to better performance than the models reported in the literature.
- 11 November 2023
- Published by World Scientific Pub Co Pte Ltd in Journal of Circuits, Systems and Computers
- Vol. 33 (07)
Cascade AdaBoost Neural Network Classifier: Analysis and Design
In this paper, we propose a cascade AdaBoost neural network (CANN) based on concepts and construct of AdaBoost neurons and cascade structure. Compared with AdaBoost, CANN can represent complex relationships between features. In CANN, representation learning is performed through AdaBoost, and the method of random selection features is utilized to encourage the diversity of AdaBoost neurons. Through the cascade structure, CANN has the context structure for complex feature representation. At the same time, in order to avoid the problem of feature disappearance, shortcut connection is used to add the previous information to the later nodes. Furthermore, particle swarm optimization (PSO) algorithm is utilized to optimize the structure of CANN, it can obtain the number of iterations to achieve better performance. Two types of CANN are proposed based — binary-classification CANN (BCANN) or multi-classification CANN (MCANN). The performance of CANN is evaluated with two kinds of data sets: machine learning data sets and atrial fibrillation data set. A comparative analysis illustrates that the proposed CANN leads to better performance than the models reported in the literature.