Wei Du

Wei Du

Auto-generated profile, based on publicly available information

Wei Du

University of Arkansas Fayetteville Arkansas USA

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 April 2022
Verified
Book Chapter
Closed access
PDF file
MVMinh-Hao Van
Minh-Hao Van
WDWei Du
Wei Du
XWXintao Wu
Xintao Wu
ALAidong Lu
Aidong Lu

26 July 2021 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
WDWei Du
Wei Du
ALANG Li
ANG Li
Qinghua LiQinghua Li
Qinghua Li
PZPan Zhou
Pan Zhou
The volume of data is increasing rapidly currently, which poses a great challenge for resource-constrained clients to process and analyze. A promising approach for solving computation-intensive tasks is to outsource them to the cloud to take advantage of the clouds powerful computing ability. However, it also brings privacy and security issues since the data uploaded to the cloud may contain sensitive and private information which should be protected. In this paper, we address this problem and focus on the privacy-preserving and secure outsourcing of large-scale nonlinear programming problems (NLPs) subject to both linear constraints and nonlinear constraints. Large-scale NLPs play an important role in the eld of data analytics but have not received enough attention. In our outsourcing protocol, we rst apply a secure and efcient transformation scheme at the client side to encrypt its private information. Then, we use the reduced gradient method and generalized gradient method at the server side to solve the transformed large-scale NLPs under linear constraints and nonlinear constraints, respectively. We provide security analysis of the proposed protocol, and evaluate its performance. The experimental results show that we can efciently solve the large-scale NLPs and save huge amount of time for the clients.

17 May 2021 in International Journal of Data Science and Analytics
Verified
Journal Article
Closed access
PDF file
WDWei Du
Wei Du
XWXintao Wu
Xintao Wu

25 May 2023 in arXiv
Verified
Preprint
Open access
PDF file
HMHuy Mai
Huy Mai
WHWen Huang
Wen Huang
WDWei Du
Wei Du
XWXintao Wu
Xintao Wu
The shift between the training and testing distributions is commonly due to sample selection bias, a type of bias caused by non-random sampling of examples to be included in the training set. Although there are many approaches proposed to learn a classifier under sample selection bias, few address the case where a subset of labels in the training set are missing-not-at-random (MNAR) as a result of the selection process. In statistics, Greene's method formulates this type of sample selection with logistic regression as the prediction model. However, we find that simply integrating this method into a robust classification framework is not effective for this bias setting. In this paper, we propose BiasCorr, an algorithm that improves on Greene's method by modifying the original training set in order for a classifier to learn under MNAR sample selection bias. We provide theoretical guarantee for the improvement of BiasCorr over Greene's method by analyzing its bias. Experimental results on real-world datasets demonstrate that BiasCorr produces robust classifiers and can be extended to outperform state-of-the-art classifiers that have been proposed to train under sample selection bias.