Chia-Hua Ho

National Taiwan University, T’ai-pei, Taipei, Taiwan

Are you Chia-Hua Ho?

Claim your profile

Publications (3)4.95 Total impact

  • Chia-Hua Ho · Chih-Jen Lin
    [Show abstract] [Hide abstract]
    ABSTRACT: Support vector regression (SVR) and support vector classification (SVC) are popular learning techniques, but their use with kernels is often time consuming. Recently, linear SVC without kernels has been shown to give competitive accuracy for some applications, but enjoys much faster training/ testing. However, few studies have focused on linear SVR. In this paper, we extend state-of-theart training methods for linear SVC to linear SVR. We show that the extension is straightforward for some methods, but is not trivial for some others. Our experiments demonstrate that for some problems, the proposed linear-SVR training methods can very efficiently produce models that are as good as kernel SVR.
    Journal of Machine Learning Research 11/2012; 13(1):3323-3348. · 2.47 Impact Factor
  • Source
    Guo-Xun Yuan · Chia-Hua Ho · Chih-Jen Lin
    [Show abstract] [Hide abstract]
    ABSTRACT: GLMNET proposed by Friedman et al. is an algorithm for generalized linear models with elastic net. It has been widely applied to solve L1-regularized logistic regression. However, recent experiments indicated that the existing GLMNET implementation may not be stable for large-scale problems. In this paper, we propose an improved GLMNET to address some theoretical and implementation issues. In particular, as a Newton-type method, GLMNET achieves fast local convergence, but may fail to quickly obtain a useful solution. By a careful design to adjust the effort for each iteration, our method is efficient regardless of loosely or strictly solving the optimization problem. Experiments demonstrate that the improved GLMNET is more efficient than a state-of-the-art coordinate descent method.
    Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA, August 21-24, 2011; 01/2011
  • Source
    Ming-Hen Tsai · Chia-Hua Ho · Chih-Jen Lin
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we decompose the problem of active learning into two parts, learning with few examples and learning by querying labels of samples. The first part is achieved mainly by SVM classifiers. We also consider variants based on transductive learning. In the second part, based on SVM decision values, we propose a framework to flexibly select points for query. Our experiments are conducted on the data sets of Causality Active Learning Challenge. With measurements of Area Under Curve (AUC) and Area under the Learning Curve (ALC), we find suitable methods for different data sets.
    Neural Networks (IJCNN), The 2010 International Joint Conference on; 08/2010

Publication Stats

33 Citations
4.95 Total Impact Points


  • 2011–2012
    • National Taiwan University
      • Department of Computer Science and Information Engineering
      T’ai-pei, Taipei, Taiwan