Please use this identifier to cite or link to this item:
|Title:||EFFICIENT MACHINE LEARNING METHODS FOR BIG DATA ANALYTICS||Authors:||ZHOU QIANG||Keywords:||Machine Learning, Big Data, Optimization, Sparsity, Screening, Decomposition||Issue Date:||3-Jan-2017||Citation:||ZHOU QIANG (2017-01-03). EFFICIENT MACHINE LEARNING METHODS FOR BIG DATA ANALYTICS. ScholarBank@NUS Repository.||Abstract:||In this thesis, we study methods to accelerate the optimization of existing sparse machine learning models, so that they are applicable to problems with a huge amount of samples or features. In particular, we consider three models that are widely used in real world applications: support vector machines (SVM), tree-structured group sparsity and sparse Gaussian process regression. We first present a strictly safe sample screening method for early discarding of inactive samples prior to solving the SVM, so that the problem size of the SVM can be substantially reduced. Then, we develop a dynamic feature screening method for tree-structured group sparsity regularization, to progressively eliminate inactive features during its optimization procedure. Lastly, we present an approximate decomposition method to accelerate the sparse Gaussian process regression, wherein several much smaller subproblems are solved instead of the original one. In summary, we develop various efficient methods to enable prevalent sparse machine models to be applicable to problems with a huge amount of samples or features.||URI:||http://scholarbank.nus.edu.sg/handle/10635/135283|
|Appears in Collections:||Ph.D Theses (Open)|
Show full item record
Files in This Item:
|PhDThesis_QiangZHOU.pdf||8.18 MB||Adobe PDF|
checked on May 13, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.