Yang Wang
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
Yang Wang has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Guanci Yang
Key Laboratory of Advanced Manufacturing Technology of the Ministry of Education, Guizhou University, Guiyang, China
6 shared publications - Shaobo Li
School of Mechanical Engineering Guizhou Institute of Technology Guiyang China
3 shared publications Chenglong Zhang
2 shared publications- Chenglong Zhang
The Chinese University of Hong Kong
2 shared publications - Jing Yang
State Key Laboratory of Public Big Data, Guizhou University, Guiyang, China
2 shared publications - Ling He
Key Laboratory of Advanced Manufacturing Technology of the Ministry of Education, Guizhou University, Guiyang, China
2 shared publications
Latest Publications
- Open Access
- 28 June 2026
- Published by Springer Nature in Discover Artificial Intelligence
- Vol. 6 (1)
Named entity recognition based on fusion of global and local semantic features for Chinese electronic medical records
- 28 June 2026
- Published by Springer Nature in Discover Artificial Intelligence
- Vol. 6 (1)
Open AccessNamed entity recognition based on fusion of global and local semantic features for Chinese electronic medical records
- 8 July 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 296
Sparse low-rank retargeted stochastic configuration networks for multiclass classification
- 8 July 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 296
Sparse low-rank retargeted stochastic configuration networks for multiclass classification
- Open Access
- 12 August 2024
- Published by Springer Nature in Research Square
A breadth-first search algorithm for frequent itemsets based on vertical data layout
Frequent itemset mining, a pivotal technique in the field of data mining, is aimed at identifying items that frequently co-occur in transaction databases, thereby enabling the extraction of valuable patterns and associations within large datasets. Algorithms utilizing vertical data layout typically employ depth-first search for extracting frequent itemsets. However, leveraging anti-monotonicity property to constrain the search space poses challenges. Additionally, memory consumption can be substantial, particularly when using a low minimum support threshold. In this paper, we propose integrating hashmap and list data structures to store frequent itemsets and represent the search space more efficiently. Furthermore, we introduce a breadth-first search-based approach for generating candidate itemsets while simultaneously pruning them based on anti-monotonicity principles. Support counting is performed using bitwise operators within the concept and technique of vertical database representation. Building upon two formats of vertical databases (Tidset and Diffset), we present two novel algorithms: Tidset-BFS and Diffset-BFS respectively. To evaluate their performance, extensive experiments are conducted, comparing them with a prominent negFIN algorithm across various real-world and synthetic datasets. The experimental results demonstrate that our proposed algorithms exhibit significantly improved efficiency across most datasets.
- 12 August 2024
- Published by Springer Nature in Research Square
Open AccessA breadth-first search algorithm for frequent itemsets based on vertical data layout
Frequent itemset mining, a pivotal technique in the field of data mining, is aimed at identifying items that frequently co-occur in transaction databases, thereby enabling the extraction of valuable patterns and associations within large datasets. Algorithms utilizing vertical data layout typically employ depth-first search for extracting frequent itemsets. However, leveraging anti-monotonicity property to constrain the search space poses challenges. Additionally, memory consumption can be substantial, particularly when using a low minimum support threshold. In this paper, we propose integrating hashmap and list data structures to store frequent itemsets and represent the search space more efficiently. Furthermore, we introduce a breadth-first search-based approach for generating candidate itemsets while simultaneously pruning them based on anti-monotonicity principles. Support counting is performed using bitwise operators within the concept and technique of vertical database representation. Building upon two formats of vertical databases (Tidset and Diffset), we present two novel algorithms: Tidset-BFS and Diffset-BFS respectively. To evaluate their performance, extensive experiments are conducted, comparing them with a prominent negFIN algorithm across various real-world and synthetic datasets. The experimental results demonstrate that our proposed algorithms exhibit significantly improved efficiency across most datasets.
- 4 July 2024
- Published by Elsevier in Information Sciences
- Vol. 680
Greedy deep stochastic configuration networks ensemble with boosting negative correlation learning
- 4 July 2024
- Published by Elsevier in Information Sciences
- Vol. 680
Greedy deep stochastic configuration networks ensemble with boosting negative correlation learning
- 5 June 2024
- Published by Elsevier in Information Sciences
- Vol. 677
Stochastic configuration networks with group lasso regularization
- 5 June 2024
- Published by Elsevier in Information Sciences
- Vol. 677
Stochastic configuration networks with group lasso regularization
- 11 March 2023
- Published by Elsevier in Knowledge-Based Systems
- Vol. 269
Greedy stochastic configuration networks for ill-posed problems
- 11 March 2023
- Published by Elsevier in Knowledge-Based Systems
- Vol. 269
Greedy stochastic configuration networks for ill-posed problems
- Open Access
- 17 September 2022
- Published by MDPI AG in Micromachines
- Vol. 13 (9) , 1538
Tactile Perception Object Recognition Based on an Improved Support Vector Machine
Tactile perception is an irreplaceable source of information for humans to explore the surrounding environment and has advantages over sight and hearing in processing the material properties and detailed shapes of objects. However, with the increasing uncertainty and complexity of tactile perception features, it is often difficult to collect highly available pure tactile datasets for research in the field of tactile perception. Here, we have proposed a method for object recognition on a purely tactile dataset and provide the original tactile dataset. First, we improved the differential evolution (DE) algorithm and then used the DE algorithm to optimize the important parameter of the Gaussian kernel function of the support vector machine (SVM) to improve the accuracy of pure tactile target recognition. The experimental comparison results show that our method has a better target recognition effect than the classical machine learning algorithm. We hope to further improve the generalizability of this method and provide an important reference for research in the field of tactile perception and recognition.
- 17 September 2022
- Published by MDPI AG in Micromachines
- Vol. 13 (9) , 1538
Open AccessTactile Perception Object Recognition Based on an Improved Support Vector Machine
Tactile perception is an irreplaceable source of information for humans to explore the surrounding environment and has advantages over sight and hearing in processing the material properties and detailed shapes of objects. However, with the increasing uncertainty and complexity of tactile perception features, it is often difficult to collect highly available pure tactile datasets for research in the field of tactile perception. Here, we have proposed a method for object recognition on a purely tactile dataset and provide the original tactile dataset. First, we improved the differential evolution (DE) algorithm and then used the DE algorithm to optimize the important parameter of the Gaussian kernel function of the support vector machine (SVM) to improve the accuracy of pure tactile target recognition. The experimental comparison results show that our method has a better target recognition effect than the classical machine learning algorithm. We hope to further improve the generalizability of this method and provide an important reference for research in the field of tactile perception and recognition.
- Open Access
Target Classification Method of Tactile Perception Data with Deep Learning
In order to improve the accuracy of manipulator operation, it is necessary to install a tactile sensor on the manipulator to obtain tactile information and accurately classify a target. However, with the increase in the uncertainty and complexity of tactile sensing data characteristics, and the continuous development of tactile sensors, typical machine-learning algorithms often cannot solve the problem of target classification of pure tactile data. Here, we propose a new model by combining a convolutional neural network and a residual network, named ResNet10-v1. We optimized the convolutional kernel, hyperparameters, and loss function of the model, and further improved the accuracy of target classification through the K-means clustering method. We verified the feasibility and effectiveness of the proposed method through a large number of experiments. We expect to further improve the generalization ability of this method and provide an important reference for the research in the field of tactile perception classification.
Open AccessTarget Classification Method of Tactile Perception Data with Deep Learning
In order to improve the accuracy of manipulator operation, it is necessary to install a tactile sensor on the manipulator to obtain tactile information and accurately classify a target. However, with the increase in the uncertainty and complexity of tactile sensing data characteristics, and the continuous development of tactile sensors, typical machine-learning algorithms often cannot solve the problem of target classification of pure tactile data. Here, we propose a new model by combining a convolutional neural network and a residual network, named ResNet10-v1. We optimized the convolutional kernel, hyperparameters, and loss function of the model, and further improved the accuracy of target classification through the K-means clustering method. We verified the feasibility and effectiveness of the proposed method through a large number of experiments. We expect to further improve the generalization ability of this method and provide an important reference for the research in the field of tactile perception classification.
- 1 August 2017
- Published by SAGE Publications in Multiagent and Grid Systems
- Vol. 13 (3) , 311-329
Distributed and parallel construction method for equi-width histogram in cloud database
Data distribution summary has been commonly used in databases to support query optimization, and histograms are of particular interest. A significant issue in histogram estimation is the large amount of data transmission. This paper presents a distributed and parallel construction method for equi-width histogram in cloud database (called DPHCD). Unlike previous methods, the DPHCD does not require the transfer of any table detail during histogram construction. Only small information about buckets and a few necessary data need to be transmitted over the network. The data transmission of DPHCD is unrelated with table size. DPHCD divides the histogram task into small tasks that could be simultaneously executed in a distributed cluster. It uses an innovative tablet-level sampling method to reduce the computing overhead in each cluster node. DPHCD is implemented in the Xugu cloud database management system. Experimental results demonstrate that DPHCD can achieve small data transmission and speed up histogram construction.
- 1 August 2017
- Published by SAGE Publications in Multiagent and Grid Systems
- Vol. 13 (3) , 311-329
Distributed and parallel construction method for equi-width histogram in cloud database
Data distribution summary has been commonly used in databases to support query optimization, and histograms are of particular interest. A significant issue in histogram estimation is the large amount of data transmission. This paper presents a distributed and parallel construction method for equi-width histogram in cloud database (called DPHCD). Unlike previous methods, the DPHCD does not require the transfer of any table detail during histogram construction. Only small information about buckets and a few necessary data need to be transmitted over the network. The data transmission of DPHCD is unrelated with table size. DPHCD divides the histogram task into small tasks that could be simultaneously executed in a distributed cluster. It uses an innovative tablet-level sampling method to reduce the computing overhead in each cluster node. DPHCD is implemented in the Xugu cloud database management system. Experimental results demonstrate that DPHCD can achieve small data transmission and speed up histogram construction.
- 25 November 2016
- Published by Springer Nature in Applied Intelligence
- Vol. 46 (4) , 827-844
Multi-objective evolutionary algorithm based on decision space partition and its application in hybrid power system optimisation
- 25 November 2016
- Published by Springer Nature in Applied Intelligence
- Vol. 46 (4) , 827-844
Multi-objective evolutionary algorithm based on decision space partition and its application in hybrid power system optimisation