Chen Wang

Chen Wang

Auto-generated profile, based on publicly available information

Chen Wang

CSIRO The University of New South Wales Australia

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
1 June 2015 in Journal of Biomedical Informatics
Verified
Journal Article
Closed access
SKSarvnaz Karimi
Sarvnaz Karimi
AMAlejandro Metke-Jimenez
Alejandro Metke-Jimenez
MKMadonna Kemp
Madonna Kemp
CWChen Wang
Chen Wang

19 January 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
SLSin Kit Lo
Sin Kit Lo
YLYue Liu
Yue Liu
QLQinghua Lu
Qinghua Lu
CWChen Wang
Chen Wang
XXXiwei XU
Xiwei XU
LZLiming Zhu
Liming Zhu
Federated learning is an emerging privacy-preserving AI technique where clients (i.e., organizations or devices) train models locally and formulate a global model based on the local model updates without transferring local data externally. However, federated learning systems struggle to achieve trustworthiness and embody responsible AI principles. In particular, federated learning systems face accountability and fairness challenges due to multistakeholder involvement and heterogeneity in client data distribution. To enhance the accountability and fairness of federated learning systems, we present a blockchain-based trustworthy federated learning architecture. We first design a smart contract-based data-model provenance registry to enable accountability. Additionally, we propose a weighted fair data sampler algorithm to enhance fairness in training data. We evaluate the proposed approach using a COVID-19 X-ray detection use case. The evaluation results show that the approach is feasible to enable accountability and improve fairness. The proposed algorithm can achieve better performance than the default federated learning setting in terms of the model’s generalization and accuracy.

11 May 2015 in ACM Computing Surveys
Verified
Journal Article
Open access
SKSarvnaz Karimi
Sarvnaz Karimi
CWChen Wang
Chen Wang
AMAlejandro Metke-Jimenez
Alejandro Metke-Jimenez
RGRaj Gaire
Raj Gaire
CPCecile Paris
Cecile Paris
We review data mining and related computer science techniques that have been studied in the area of drug safety to identify signals of adverse drug reactions from different data sources, such as spontaneous reporting databases, electronic health records, and medical literature. Development of such techniques has become more crucial for public heath, especially with the growth of data repositories that include either reports of adverse drug reactions, which require fast processing for discovering signals of adverse reactions, or data sources that may contain such signals but require data or text mining techniques to discover them. In order to highlight the importance of contributions made by computer scientists in this area so far, we categorize and review the existing approaches, and most importantly, we identify areas where more research should be undertaken.

7 May 2022 in Journal of Systems and Software
Verified
Journal Article
Closed access
SLSin Kit Lo
Sin Kit Lo
QLQinghua Lu
Qinghua Lu
LZLiming Zhu
Liming Zhu
HPHye-young Paik
Hye-young Paik
XXXiwei XU
Xiwei XU
CWChen Wang
Chen Wang

8 June 2011
Verified
Conference Paper
Open access
PDF file
JCJunliang Chen
Junliang Chen
CWChen Wang
Chen Wang
BZBing Bing Zhou
Bing Bing Zhou
LSLei Sun
Lei Sun
YLYoung Choon Lee
Young Choon Lee
Albert ZomayaAlbert Zomaya
Albert Zomaya
The recent cloud computing paradigm represents a trend of moving business applications to platforms run by parties located in different administrative domains. A cloud platform is often highly scalable and cost-effective through its pay-as-you-go pricing model. However, being shared by a large number of users, the running of applications in the platform faces higher performance uncertainty compared to a dedicated platform. Existing Service Level Agreements (SLAs) cannot sufficiently address the performance variation issue. In this paper, we use utility theory leveraged from economics and develop a new utility model for measuring customer satisfaction in the cloud. Based on the utility model, we design a mechanism to support utility-based SLAs in order to balance the performance of applications and the cost of running them. We consider an infrastructure-as-a-service type cloud platform (e.g., Amazon EC2), where a business service provider leases virtual machine (VM) instances with spot prices from the cloud and gains revenue by serving its customers. Particularly, we investigate the interaction of service profit and customer satisfaction. In addition, we present two scheduling algorithms that can effectively bid for different types of VM instances to make tradeoffs between profit and customer satisfaction. We conduct extensive simulations based on the performance data of different types of Amazon EC2 instances and their price history. Our experimental results demonstrate that the algorithms perform well across the metrics of profit, customer satisfaction and instance utilization.

1 March 2015 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
KYKejiang Ye
Kejiang Ye
ZWZhaohui Wu
Zhaohui Wu
CWChen Wang
Chen Wang
BZBing Bing Zhou
Bing Bing Zhou
WSWeisheng Si
Weisheng Si
Albert ZomayaAlbert Zomaya
Albert Zomaya
Improving energy efficiency of data centers has become increasingly important nowadays due to the significant amounts of power needed to operate these centers. An important method for achieving energy efficiency is server consolidation supported by virtualization. However, server consolidation may incur significant degradation to workload performance due to virtual machine (VM) co-location and migration. How to reduce such performance degradation becomes a critical issue to address. In this paper, we propose a profiling-based server consolidation framework which minimizes the number of physical machines (PMs) used in data centers while maintaining satisfactory performance of various workloads. Inside this framework, we first profile the performance losses of various workloads under two situations: running in co-location and experiencing migrations. We then design two modules: (1) consolidation planning module which, given a set of workloads, minimizes the number of PMs by an integer programming model, and (2) migration planning module which, given a source VM placement scenario and a target VM placement scenario, minimizes the number of VM migrations by a polynomial time algorithm. Also, based on the workload performance profiles, both modules can guarantee the performance losses of various workloads below configurable thresholds. Our experiments for workload profiling are conducted with real data center workloads and our experiments on our two modules validate the integer programming model and the polynomial time algorithm.