Hongbing 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
Research Subjects
Hongbing Wang has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
- Qi Yu
Rochester Institute of Technology, Rochester, NY, USA
5 shared publications - Lei Wang
Department of Management Science and Engineering, Data Science and Systems Science (DTripleS) Lab, Nanjing Forestry University, Nanjing, China
2 shared publications Yong Tao
Southeast Univ, Sch Comp Sci & Engn, SIPAILOU 2, Nanjing 210096, Jiangsu, Peoples R China
2 shared publications- Zibin Zheng
Sun Yat-Sen University, Guangzhou, China
2 shared publications Anzhi Wang
School of Big Data and Computer Science, Guizhou Normal University, Guiyang, China
1 shared publicationChen Xin
Southeast Univ, Sch Comp Sci & Engn, SIPAILOU 2, Nanjing 210096, Jiangsu, Peoples R China
1 shared publication
Latest Publications
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 28, 14065-14078
ResiMark: A Spatial-Temporal Enhanced Video Watermarking Network Balancing Robustness and Imperceptibility
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 28, 14065-14078
ResiMark: A Spatial-Temporal Enhanced Video Watermarking Network Balancing Robustness and Imperceptibility
- 26 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (13) , 24159-24173
Wi-SFDAGR: WiFi-Based Cross-Domain Gesture Recognition via Source-Free Domain Adaptation
WiFi channel state information (CSI)-based gesture recognition offers unique advantages, including cost-effectiveness and enhanced privacy protection, and has garnered significant attention in recent years. However, existing WiFi-based gesture recognition solutions exhibit poor generalization ability when deployed in new environment, orientation, or location. Although some methods combine labeled source domain and unlabeled target domain to learn domain-independent features, factors, such as data privacy protection, hinder access to source data during practical environment adaptation. Consequently, we consider realistic scenario where source data is unavailable during adaptation of unlabeled test data, and instead, a trained source domain model is used. In this article, we propose Wi-SFDAGR, a WiFi-based source-free domain adaptation gesture recognition framework. Specifically, we treat cross-domain as an unsupervised clustering problem, aiming to ensure that features within local neighborhoods exhibit similar prediction results while those farther apart display different prediction outcomes in the feature space. We theoretically analyze the effect of enhanced prediction consistency between neighbor points extracted from gestures on generalization error. Furthermore, we employ an attraction-dispersion network to strengthen prediction consistency among closely located features in the feature space while reducing it for distantly located features. To mitigate noise introduced during nearest neighbor sample selection in the feature space (where predictions may not align with the input sample’s prediction), we progressively improve nearby sample feature aggregation by estimating uncertainty to reweight local neighborhood predictions. Finally, extensive experiments are conducted on the Widar 3.0 and XRF55 datasets and the results show our proposed framework outperforms most cross-domain methods.
- 26 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (13) , 24159-24173
Wi-SFDAGR: WiFi-Based Cross-Domain Gesture Recognition via Source-Free Domain Adaptation
WiFi channel state information (CSI)-based gesture recognition offers unique advantages, including cost-effectiveness and enhanced privacy protection, and has garnered significant attention in recent years. However, existing WiFi-based gesture recognition solutions exhibit poor generalization ability when deployed in new environment, orientation, or location. Although some methods combine labeled source domain and unlabeled target domain to learn domain-independent features, factors, such as data privacy protection, hinder access to source data during practical environment adaptation. Consequently, we consider realistic scenario where source data is unavailable during adaptation of unlabeled test data, and instead, a trained source domain model is used. In this article, we propose Wi-SFDAGR, a WiFi-based source-free domain adaptation gesture recognition framework. Specifically, we treat cross-domain as an unsupervised clustering problem, aiming to ensure that features within local neighborhoods exhibit similar prediction results while those farther apart display different prediction outcomes in the feature space. We theoretically analyze the effect of enhanced prediction consistency between neighbor points extracted from gestures on generalization error. Furthermore, we employ an attraction-dispersion network to strengthen prediction consistency among closely located features in the feature space while reducing it for distantly located features. To mitigate noise introduced during nearest neighbor sample selection in the feature space (where predictions may not align with the input sample’s prediction), we progressively improve nearby sample feature aggregation by estimating uncertainty to reweight local neighborhood predictions. Finally, extensive experiments are conducted on the Widar 3.0 and XRF55 datasets and the results show our proposed framework outperforms most cross-domain methods.
- 17 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 35 (11) , 16368-16382
CTFNet: Long-Sequence Time-Series Forecasting Based on Convolution and Time–Frequency Analysis
Although current time-series forecasting methods have significantly improved the state-of-the-art (SOTA) results for long-sequence time-series forecasting (LSTF), they still have difficulty in capturing and extracting the features and dependencies of long-term sequences and suffer from information utilization bottlenecks and high-computational complexity. To address these issues, a lightweight single-hidden layer feedforward neural network (SLFN) combining convolution mapping and time–frequency decomposition called CTFNet is proposed with three distinctive characteristics. First, time-domain (TD) feature mining—in this article, a method for extracting the long-term correlation of horizontal TD features based on matrix factorization is proposed, which can effectively capture the interdependence among different sample points of a long time series. Second, multitask frequency-domain (FD) feature mining—this can effectively extract different frequency feature information of time-series data from the FD and minimize the loss of data features. Integrating multiscale dilated convolutions, simultaneously focusing on both global and local context feature dependencies at the sequence level, and mining the long-term dependencies of the multiscale frequency information and the spatial dependencies among the different scale frequency information, break the bottleneck of data utilization, and ensure the integrity of feature extraction. Third, highly efficient—the CTFNet model has a short training time and fast inference speed. Our empirical studies with nine benchmark datasets show that compared with state-of-the-art methods, CTFNet can reduce prediction error by 64.7% and 53.7% for multivariate and univariate time series, respectively.
- 17 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 35 (11) , 16368-16382
CTFNet: Long-Sequence Time-Series Forecasting Based on Convolution and Time–Frequency Analysis
Although current time-series forecasting methods have significantly improved the state-of-the-art (SOTA) results for long-sequence time-series forecasting (LSTF), they still have difficulty in capturing and extracting the features and dependencies of long-term sequences and suffer from information utilization bottlenecks and high-computational complexity. To address these issues, a lightweight single-hidden layer feedforward neural network (SLFN) combining convolution mapping and time–frequency decomposition called CTFNet is proposed with three distinctive characteristics. First, time-domain (TD) feature mining—in this article, a method for extracting the long-term correlation of horizontal TD features based on matrix factorization is proposed, which can effectively capture the interdependence among different sample points of a long time series. Second, multitask frequency-domain (FD) feature mining—this can effectively extract different frequency feature information of time-series data from the FD and minimize the loss of data features. Integrating multiscale dilated convolutions, simultaneously focusing on both global and local context feature dependencies at the sequence level, and mining the long-term dependencies of the multiscale frequency information and the spatial dependencies among the different scale frequency information, break the bottleneck of data utilization, and ensure the integrity of feature extraction. Third, highly efficient—the CTFNet model has a short training time and fast inference speed. Our empirical studies with nine benchmark datasets show that compared with state-of-the-art methods, CTFNet can reduce prediction error by 64.7% and 53.7% for multivariate and univariate time series, respectively.
- 1 January 2019
- Published by Elsevier in Knowledge-Based Systems
- Vol. 164, 292-308
Personalized service selection using Conditional Preference Networks
- 1 January 2019
- Published by Elsevier in Knowledge-Based Systems
- Vol. 164, 292-308
Personalized service selection using Conditional Preference Networks
- 18 October 2017
- Published by Springer Nature
- p. 383-391
Large-Scale and Adaptive Service Composition Using Deep Reinforcement Learning
- 18 October 2017
- Published by Springer Nature
- p. 383-391
Large-Scale and Adaptive Service Composition Using Deep Reinforcement Learning
- 29 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 12 (3) , 398-411
Learning the Evolution Regularities for BigService-Oriented Online Reliability Prediction
Service computing is an emerging technology in System of Systems Engineering (SoS Engineering or SoSE), which regards a System as a Service, and aims at constructing a robust and value-added complex system by outsourcing external component systems through service composition. The burgeoning Big Service computing just covers the significant challenges in constructing and maintaining a stable service-oriented SoS. A service-oriented SoS runs under a volatile and uncertain environment. As a step toward big service, service fault tolerance (FT) can guarantee the run-time quality of a service-oriented SoS. To successfully deploy FT in an SoS, online reliability time series prediction, which aims at predicting the reliability in near future for a service-oriented SoS arises as a grand challenge in SoS research. In particular, we need to tackle a number of big data related issues given the large and fast increasing size of the historical data that will be used for prediction purpose. The decision-making of prediction solution space be more complex. To provide highly accurate prediction results, we tackle the prediction challenges by identifying the evolution regularities of component systems’ running states via different machine learning models. We present in this paper the motifs-based Dynamic Bayesian Networks (or m DBNs) to perform one-step-ahead online reliability time series prediction. We also propose a multi-steps trajectory DBNs (or multi DBNs) to further improve the accuracy of future reliability prediction. Finally, a Convolutional Neural Networks (CNN)-based prediction approach is developed to deal with the big data challenges. Extensive experiments conducted on real-world Web services demonstrate that our models outperform other well-known approaches consistently.
- 29 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 12 (3) , 398-411
Learning the Evolution Regularities for BigService-Oriented Online Reliability Prediction
Service computing is an emerging technology in System of Systems Engineering (SoS Engineering or SoSE), which regards a System as a Service, and aims at constructing a robust and value-added complex system by outsourcing external component systems through service composition. The burgeoning Big Service computing just covers the significant challenges in constructing and maintaining a stable service-oriented SoS. A service-oriented SoS runs under a volatile and uncertain environment. As a step toward big service, service fault tolerance (FT) can guarantee the run-time quality of a service-oriented SoS. To successfully deploy FT in an SoS, online reliability time series prediction, which aims at predicting the reliability in near future for a service-oriented SoS arises as a grand challenge in SoS research. In particular, we need to tackle a number of big data related issues given the large and fast increasing size of the historical data that will be used for prediction purpose. The decision-making of prediction solution space be more complex. To provide highly accurate prediction results, we tackle the prediction challenges by identifying the evolution regularities of component systems’ running states via different machine learning models. We present in this paper the motifs-based Dynamic Bayesian Networks (or m DBNs) to perform one-step-ahead online reliability time series prediction. We also propose a multi-steps trajectory DBNs (or multi DBNs) to further improve the accuracy of future reliability prediction. Finally, a Convolutional Neural Networks (CNN)-based prediction approach is developed to deal with the big data challenges. Extensive experiments conducted on real-world Web services demonstrate that our models outperform other well-known approaches consistently.
- 20 September 2016
- Published by Springer Nature
- p. 677-684
Integrating POMDP and SARSA($\lambda $) for Service Composition with Incomplete Information- 20 September 2016
- Published by Springer Nature
- p. 677-684
Integrating POMDP and SARSA($\lambda $) for Service Composition with Incomplete Information- 2 September 2016
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 51 (2) , 561-594
Measuring similarity of users with qualitative preferences for service selection
- 2 September 2016
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 51 (2) , 561-594
Measuring similarity of users with qualitative preferences for service selection
- 25 November 2015
- Published by Springer Nature
- p. 203-217
Integrating Gaussian Process with Reinforcement Learning for Adaptive Service Composition
- 25 November 2015
- Published by Springer Nature
- p. 203-217
Integrating Gaussian Process with Reinforcement Learning for Adaptive Service Composition
- 1 June 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 582-589
A Novel Online Reliability Prediction Approach for Service-Oriented Systems
Service composition is an emerging technology in System of Systems Engineering (SoS Engineering or SoSE), which aims to construct a robust and value-added complex system by outsourcing external component systems. A serviceoriented SoS runs under a dynamic and uncertain environment. To assure the overall Quality of Service (QoS), online reliability time series prediction, which aims to predict the reliability in near future for service-oriented SoS arises as a grand challenge in SoS research. In this paper, we tackle the prediction challenge by exploiting two Markov independence assumptions resulted from the special system dynamics of a SoS environment. A novel motifs-based Dynamic Bayesian Networks model is proposed that supports the independence assumptions. Experimental results conducted on real Web services demonstrate the effectiveness of our approach.
- 1 June 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 582-589
A Novel Online Reliability Prediction Approach for Service-Oriented Systems
Service composition is an emerging technology in System of Systems Engineering (SoS Engineering or SoSE), which aims to construct a robust and value-added complex system by outsourcing external component systems. A serviceoriented SoS runs under a dynamic and uncertain environment. To assure the overall Quality of Service (QoS), online reliability time series prediction, which aims to predict the reliability in near future for service-oriented SoS arises as a grand challenge in SoS research. In this paper, we tackle the prediction challenge by exploiting two Markov independence assumptions resulted from the special system dynamics of a SoS environment. A novel motifs-based Dynamic Bayesian Networks model is proposed that supports the independence assumptions. Experimental results conducted on real Web services demonstrate the effectiveness of our approach.