Hsiang-Ling Hsu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hsiang-Ling Hsu has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Ray-Bing Chen
Institute of Statistics and Data Science National Tsing Hua University Hsinchu 30013 Taiwan nthu.edu.tw
2 shared publications - Yuan-Chin Ivan Chang
Institute of Statistical Science, Academia Sinica, Taipei 115, Taiwan
2 shared publications - Ching-Kang Ing
National Tsing Hua University
1 shared publication Shu-Hui Yu
National University of Kaohsiung
1 shared publicationTze Leung Lai
Stanford University
1 shared publication
Latest Publications
- 27 August 2018
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 129, 119-134
Greedy active learning algorithm for logistic regression models
- 27 August 2018
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 129, 119-134
Greedy active learning algorithm for logistic regression models
- 28 March 2018
- Published by Springer Nature
- p. 67-81
Multistage Manufacturing Processes: Innovations in Statistical Modeling and Inference
- 28 March 2018
- Published by Springer Nature
- p. 67-81
Multistage Manufacturing Processes: Innovations in Statistical Modeling and Inference
- Open Access
Greedy Active Learning Algorithm for Logistic Regression Models
We study a logistic model-based active learning procedure for binary classification problems, in which we adopt a batch subject selection strategy with a modified sequential experimental design method. Moreover, accompanying the proposed subject selection scheme, we simultaneously conduct a greedy variable selection procedure such that we can update the classification model with all labeled training subjects. The proposed algorithm repeatedly performs both subject and variable selection steps until a prefixed stopping criterion is reached. Our numerical results show that the proposed procedure has competitive performance, with smaller training size and a more compact model, comparing with that of the classifier trained with all variables and a full data set. We also apply the proposed procedure to a well-known wave data set (Breiman et al., 1984) to confirm the performance of our method.
Open AccessGreedy Active Learning Algorithm for Logistic Regression Models
We study a logistic model-based active learning procedure for binary classification problems, in which we adopt a batch subject selection strategy with a modified sequential experimental design method. Moreover, accompanying the proposed subject selection scheme, we simultaneously conduct a greedy variable selection procedure such that we can update the classification model with all labeled training subjects. The proposed algorithm repeatedly performs both subject and variable selection steps until a prefixed stopping criterion is reached. Our numerical results show that the proposed procedure has competitive performance, with smaller training size and a more compact model, comparing with that of the classifier trained with all variables and a full data set. We also apply the proposed procedure to a well-known wave data set (Breiman et al., 1984) to confirm the performance of our method.