Hongbing Liu
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
Hongbing Liu has a total of 49 co-authors. Here are the top co-authors by number of shared publications:
Chang-An Wu
School of Computer and Information Technology, Xinyang Normal University, Xinyang, PR China
11 shared publicationsShengwu Xiong
9 shared publicationsChunhua Liu
School of Computer and Information Technology, Xinyang Normal University, Xinyang 464000, P. R. China
5 shared publicationsQiong Chen
5 shared publicationsFan Zhang
School of Computer and Information Technology, Xinyang Normal University, Xinyang, PR China
3 shared publications- Ran Li
School of Computer and Information Technology, Xinyang Normal University, Xinyang, China
3 shared publications
Latest Publications
- 3 November 2022
- Published by Elsevier in Materials Characterization
- Vol. 194, 112456
The precipitation behavior effect of δ and γ" phases on mechanical properties of laser powder bed fusion Inconel 718 alloy
- 3 November 2022
- Published by Elsevier in Materials Characterization
- Vol. 194, 112456
The precipitation behavior effect of δ and γ" phases on mechanical properties of laser powder bed fusion Inconel 718 alloy
- 22 April 2020
- Published by Taylor & Francis
- p. 21-40
Deep Structure Pattern, Anisotropy and Continental Geodynamics Revealed by Geophysical Profiles and Transects in China
Based on the comprehensive studies on the profiles of deep seismic sounding, body and surface wave data from earthquakes, and the internal deep structure and geophysics fidd of 12 Global Geoscience Transect(GGT), the deep process and earth interior in China and adjacent region are studied, we also unveiled the zoning characteristics and layer-block structure of crust and mantle, lateral inhomogeneity and Anisotropy, special complex structure pattern, orogenic zone and sedimentary basin, continent extension and rift effect, earthquake activity and deep media environments of seismogenesis, detachment and deep and large fruit, property of Moho, interface between lithosphere and asthenosphere, continental geodynamics and formation and development of intraplate and continental margin.
- 22 April 2020
- Published by Taylor & Francis
- p. 21-40
Deep Structure Pattern, Anisotropy and Continental Geodynamics Revealed by Geophysical Profiles and Transects in China
Based on the comprehensive studies on the profiles of deep seismic sounding, body and surface wave data from earthquakes, and the internal deep structure and geophysics fidd of 12 Global Geoscience Transect(GGT), the deep process and earth interior in China and adjacent region are studied, we also unveiled the zoning characteristics and layer-block structure of crust and mantle, lateral inhomogeneity and Anisotropy, special complex structure pattern, orogenic zone and sedimentary basin, continent extension and rift effect, earthquake activity and deep media environments of seismogenesis, detachment and deep and large fruit, property of Moho, interface between lithosphere and asthenosphere, continental geodynamics and formation and development of intraplate and continental margin.
- Open Access
- 1 November 2018
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2018, 1-15
Embedding Undersampling Rotation Forest for Imbalanced Problem
Rotation Forest is an ensemble learning approach achieving better performance comparing to Bagging and Boosting through building accurate and diverse classifiers using rotated feature space. However, like other conventional classifiers, Rotation Forest does not work well on the imbalanced data which are characterized as having much less examples of one class (minority class) than the other (majority class), and the cost of misclassifying minority class examples is often much more expensive than the contrary cases. This paper proposes a novel method called Embedding Undersampling Rotation Forest (EURF) to handle this problem (1) sampling subsets from the majority class and learning a projection matrix from each subset and (2) obtaining training sets by projecting re-undersampling subsets of the original data set to new spaces defined by the matrices and constructing an individual classifier from each training set. For the first method, undersampling is to force the rotation matrix to better capture the features of the minority class without harming the diversity between individual classifiers. With respect to the second method, the undersampling technique aims to improve the performance of individual classifiers on the minority class. The experimental results show that EURF achieves significantly better performance comparing to other state-of-the-art methods.
- 1 November 2018
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2018, 1-15
Open AccessEmbedding Undersampling Rotation Forest for Imbalanced Problem
Rotation Forest is an ensemble learning approach achieving better performance comparing to Bagging and Boosting through building accurate and diverse classifiers using rotated feature space. However, like other conventional classifiers, Rotation Forest does not work well on the imbalanced data which are characterized as having much less examples of one class (minority class) than the other (majority class), and the cost of misclassifying minority class examples is often much more expensive than the contrary cases. This paper proposes a novel method called Embedding Undersampling Rotation Forest (EURF) to handle this problem (1) sampling subsets from the majority class and learning a projection matrix from each subset and (2) obtaining training sets by projecting re-undersampling subsets of the original data set to new spaces defined by the matrices and constructing an individual classifier from each training set. For the first method, undersampling is to force the rotation matrix to better capture the features of the minority class without harming the diversity between individual classifiers. With respect to the second method, the undersampling technique aims to improve the performance of individual classifiers on the minority class. The experimental results show that EURF achieves significantly better performance comparing to other state-of-the-art methods.
- 1 October 2017
- Vol. 14 (5) , 139-156
INTERVAL ANALYSIS-BASED HYPERBOX GRANULAR COMPUTING CLASSIFICATION ALGORITHMS
- 1 October 2017
- Vol. 14 (5) , 139-156
INTERVAL ANALYSIS-BASED HYPERBOX GRANULAR COMPUTING CLASSIFICATION ALGORITHMS
- 13 January 2017
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 32 (1) , 509-519
A comparative analysis of granular computing clustering from the view of set
Granular computing (GrC) is a frame computing paradigm that realizes the transformation between two granule spaces with different granularities. A comparative analysis of granular computing clustering is discussed in the paper. Firstly, a granule is defined as the form of vectors by the center and the granularity, especially, an atomic granule is induced by a point which has the granularity 0. Secondly, the join operator realizes the transformation from the granule space with smaller granularity to the granule space with lager granularity, and is used to form the granular computing clustering (GrCC) algorithms. Thirdly, the granular computing clustering algorithms are evaluated from the view of set, such as Global Consistency Error (GCE), Normalized Variation of Information (NVI), and Rand Index (RI). The superiority and feasibility of GrCC are compared with Kmeans and FCM by experiments on the benchmark data sets.
- 13 January 2017
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 32 (1) , 509-519
A comparative analysis of granular computing clustering from the view of set
Granular computing (GrC) is a frame computing paradigm that realizes the transformation between two granule spaces with different granularities. A comparative analysis of granular computing clustering is discussed in the paper. Firstly, a granule is defined as the form of vectors by the center and the granularity, especially, an atomic granule is induced by a point which has the granularity 0. Secondly, the join operator realizes the transformation from the granule space with smaller granularity to the granule space with lager granularity, and is used to form the granular computing clustering (GrCC) algorithms. Thirdly, the granular computing clustering algorithms are evaluated from the view of set, such as Global Consistency Error (GCE), Normalized Variation of Information (NVI), and Rand Index (RI). The superiority and feasibility of GrCC are compared with Kmeans and FCM by experiments on the benchmark data sets.
- Open Access
- 29 November 2016
- Published by SAGE Publications in Journal of Algorithms & Computational Technology
- Vol. 11 (2) , 110-125
Isolation-based hyperbox granular classification computing
Bottom-up and top-down are two main computing models in granular computing by which the granule set including granules with different granularities. The top-down hyperbox granular computing classification algorithm based on isolation, or IHBGrC for short, is proposed in the framework of top-down computing model. Algorithm IHBGrC defines a novel function to measure the distance between two hyperbox hgranules, which is used to judge the inclusion relation between two hyperbox granules, the meet operation is used to isolate the ith class data from the other class data, and the hyperbox granule is partitioned into some hyperbox granules which include the ith class data. We compare the performance of IHBGrC with support vector machines and HBGrC, for a number of two-class problems and multiclass problems. Our computational experiments showed that IHBGrC can both speed up training and achieve comparable generalization performance.
- 29 November 2016
- Published by SAGE Publications in Journal of Algorithms & Computational Technology
- Vol. 11 (2) , 110-125
Open AccessIsolation-based hyperbox granular classification computing
Bottom-up and top-down are two main computing models in granular computing by which the granule set including granules with different granularities. The top-down hyperbox granular computing classification algorithm based on isolation, or IHBGrC for short, is proposed in the framework of top-down computing model. Algorithm IHBGrC defines a novel function to measure the distance between two hyperbox hgranules, which is used to judge the inclusion relation between two hyperbox granules, the meet operation is used to isolate the ith class data from the other class data, and the hyperbox granule is partitioned into some hyperbox granules which include the ith class data. We compare the performance of IHBGrC with support vector machines and HBGrC, for a number of two-class problems and multiclass problems. Our computational experiments showed that IHBGrC can both speed up training and achieve comparable generalization performance.
- Open Access
- 28 November 2016
- Published by Wiley in Advances in Multimedia
- Vol. 2016, 1-9
Block Compressed Sensing of Images Using Adaptive Granular Reconstruction
In the framework of block Compressed Sensing (CS), the reconstruction algorithm based on the Smoothed Projected Landweber (SPL) iteration can achieve the better rate-distortion performance with a low computational complexity, especially for using the Principle Components Analysis (PCA) to perform the adaptive hard-thresholding shrinkage. However, during learning the PCA matrix, it affects the reconstruction performance of Landweber iteration to neglect the stationary local structural characteristic of image. To solve the above problem, this paper firstly uses the Granular Computing (GrC) to decompose an image into several granules depending on the structural features of patches. Then, we perform the PCA to learn the sparse representation basis corresponding to each granule. Finally, the hard-thresholding shrinkage is employed to remove the noises in patches. The patches in granule have the stationary local structural characteristic, so that our method can effectively improve the performance of hard-thresholding shrinkage. Experimental results indicate that the reconstructed image by the proposed algorithm has better objective quality when compared with several traditional ones. The edge and texture details in the reconstructed image are better preserved, which guarantees the better visual quality. Besides, our method has still a low computational complexity of reconstruction.
- 28 November 2016
- Published by Wiley in Advances in Multimedia
- Vol. 2016, 1-9
Open AccessBlock Compressed Sensing of Images Using Adaptive Granular Reconstruction
In the framework of block Compressed Sensing (CS), the reconstruction algorithm based on the Smoothed Projected Landweber (SPL) iteration can achieve the better rate-distortion performance with a low computational complexity, especially for using the Principle Components Analysis (PCA) to perform the adaptive hard-thresholding shrinkage. However, during learning the PCA matrix, it affects the reconstruction performance of Landweber iteration to neglect the stationary local structural characteristic of image. To solve the above problem, this paper firstly uses the Granular Computing (GrC) to decompose an image into several granules depending on the structural features of patches. Then, we perform the PCA to learn the sparse representation basis corresponding to each granule. Finally, the hard-thresholding shrinkage is employed to remove the noises in patches. The patches in granule have the stationary local structural characteristic, so that our method can effectively improve the performance of hard-thresholding shrinkage. Experimental results indicate that the reconstructed image by the proposed algorithm has better objective quality when compared with several traditional ones. The edge and texture details in the reconstructed image are better preserved, which guarantees the better visual quality. Besides, our method has still a low computational complexity of reconstruction.
- 31 January 2016
- Published by NADIA in International Journal of Control and Automation
- Vol. 9 (1) , 1-10
Hyperbox Granular Computing Based on Distance Measure
- 31 January 2016
- Published by NADIA in International Journal of Control and Automation
- Vol. 9 (1) , 1-10
Hyperbox Granular Computing Based on Distance Measure
- Open Access
- 31 January 2016
- Published by Korean Society for Internet Information (KSII) in KSII Transactions on Internet and Information Systems
- Vol. 10 (1)
Space-Time Quantization and Motion-Aligned Reconstruction for Block-Based Compressive Video Sensing
- 31 January 2016
- Published by Korean Society for Internet Information (KSII) in KSII Transactions on Internet and Information Systems
- Vol. 10 (1)
Open AccessSpace-Time Quantization and Motion-Aligned Reconstruction for Block-Based Compressive Video Sensing
- Open Access
- 10 January 2016
- Published by Sciencedomain International in Journal of Scientific Research and Reports
- Vol. 9 (1) , 1-9
Decision Tree Classifiers Based on Granular Computing
Decision tree classifier; granular computing; hypersphere granule.
- 10 January 2016
- Published by Sciencedomain International in Journal of Scientific Research and Reports
- Vol. 9 (1) , 1-9
Open AccessDecision Tree Classifiers Based on Granular Computing
Decision tree classifier; granular computing; hypersphere granule.