Xi Hang Cao

Xi Hang Cao

Auto-generated profile, based on publicly available information

Xi Hang Cao

Center for Data Analytics and Biomedical Informatics (DABI), Temple University, 1925 N 12th Street, SERC 035-02, Philadelphia, PA 19122, USA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
9 September 2016 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
XCXi Hang Cao
Xi Hang Cao
ISIvan Stojkovic
Ivan Stojkovic
ZOZoran Obradovic
Zoran Obradovic
Background: Machine learning models have been adapted in biomedical research and practice for knowledge discovery and decision support. While mainstream biomedical informatics research focuses on developing more accurate models, the importance of data preprocessing draws less attention. We propose the Generalized Logistic (GL) algorithm that scales data uniformly to an appropriate interval by learning a generalized logistic function to fit the empirical cumulative distribution function of the data. The GL algorithm is simple yet effective; it is intrinsically robust to outliers, so it is particularly suitable for diagnostic/classification models in clinical/medical applications where the number of samples is usually small; it scales the data in a nonlinear fashion, which leads to potential improvement in accuracy. Results: To evaluate the effectiveness of the proposed algorithm, we conducted experiments on 16 binary classification tasks with different variable types and cover a wide range of applications. The resultant performance in terms of area under the receiver operation characteristic curve (AUROC) and percentage of correct classification showed that models learned using data scaled by the GL algorithm outperform the ones using data scaled by the Min-max and the Z-score algorithm, which are the most commonly used data scaling algorithms. Conclusion: The proposed GL algorithm is simple and effective. It is robust to outliers, so no additional denoising or outlier detection step is needed in data preprocessing. Empirical results also show models learned from data scaled by the GL algorithm have higher accuracy compared to the commonly used data scaling algorithms.

1 December 2020 in Computer Methods and Programs in Biomedicine
Verified
Journal Article
Closed access
BLBranimir Ljubic
Branimir Ljubic
SRShoumik Roychoudhury
Shoumik Roychoudhury
XCXi Hang Cao
Xi Hang Cao
MPMartin Pavlovski
Martin Pavlovski
SOStefan Obradovic
Stefan Obradovic
ZOZoran Obradovic
Zoran Obradovic

8 April 2016 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
MGMohamed F. Ghalwash
Mohamed F. Ghalwash
XCXi Hang Cao
Xi Hang Cao
ISIvan Stojkovic
Ivan Stojkovic
ZOZoran Obradovic
Zoran Obradovic
Background: Existing feature selection methods typically do not consider prior knowledge in the form of structural relationships among features. In this study, the features are structured based on prior knowledge into groups. The problem addressed in this article is how to select one representative feature from each group such that the selected features are jointly discriminating the classes. The problem is formulated as a binary constrained optimization and the combinatorial optimization is relaxed as a convex-concave problem, which is then transformed into a sequence of convex optimization problems so that the problem can be solved by any standard optimization algorithm. Moreover, a block coordinate gradient descent optimization algorithm is proposed for high dimensional feature selection, which in our experiments was four times faster than using a standard optimization algorithm. Results: In order to test the effectiveness of the proposed formulation, we used microarray analysis as a case study, where genes with similar expressions or similar molecular functions were grouped together. In particular, the proposed block coordinate gradient descent feature selection method is evaluated on five benchmark microarray gene expression datasets and evidence is provided that the proposed method gives more accurate results than the state-of-the-art gene selection methods. Out of 25 experiments, the proposed method achieved the highest average AUC in 13 experiments while the other methods achieved higher average AUC in no more than 6 experiments. Conclusion: A method is developed to select a feature from each group. When the features are grouped based on similarity in gene expression, we showed that the proposed algorithm is more accurate than state-of-the-art gene selection methods that are particularly developed to select highly discriminative and less redundant genes. In addition, the proposed method can exploit any grouping structure among features, while alternative methods are restricted to using similarity based grouping.

1 December 2019 in Journal of Biomedical Informatics
Verified
Journal Article
Closed access
XCXi Hang Cao
Xi Hang Cao
CHChao Han
Chao Han
LGLucas M. Glass
Lucas M. Glass
AKAllen Kindman
Allen Kindman
ZOZoran Obradovic
Zoran Obradovic