Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 105 for “"Group Lasso"”.

  1. Complex-Valued Group Lasso For Tensor Autoregressive Models

    I will introduce a group lasso algorithm for complex variables and demonstrate its application to a novel time series model called tensor autoregression (T-AR). T-AR utilizes the t-product tensor operation on 3-dimensional tensors and models time series exhibiting seasonality and geometric trend. …

    cornell Repository record for Complex-Valued Group Lasso For Tensor Autoregressive Models (opens in a new tab)

  2. Generalized linear regression model with LASSO, group LASSO, and sparse group LASSO regularization methods for finding bacteria associated with colorectal cancer using microbiome data

    … we attempt to solve these problems by using the LASSO, group LASSO, and sparse group LASSO regularization on the multinomial and binomial regression models. Raw read microbiome sequencing data of the study of Nakatsu et al. (2015) is obtained from the Sequence Read Archive, of NCBI. The software …

    guelph Repository record for Generalized linear regression model with LASSO, group LASSO, and sparse group LASSO regularization methods for finding bacteria associated with colorectal cancer using microbiome data (opens in a new tab)

  3. Basis Function Selection in Density Ratio Models with Group Lasso

    … estimation method that applies the well known group lasso penalty to the Dual Empirical Likelihood (DEL) function. The simulation study conducted shows that the proposed estimators are able to correctly select the basis function in certain scenarios. The application of AIC and BIC to select the …

    carleton Repository record for Basis Function Selection in Density Ratio Models with Group Lasso (opens in a new tab)

  4. Sparse Group Lasso for Variable Selection in Finite Gaussian Mixture Regression Models

    … selection is important at two levels: (1) the group level by removing completely irrelevant covariates across all subpopulations and (2) the individual level by removing irrelevant covariates within each subpopulation. Existing variable selection methods applied to MR focus on the individual …

    guelph Repository record for Sparse Group Lasso for Variable Selection in Finite Gaussian Mixture Regression Models (opens in a new tab)

  5. Component-Weighted Sparse Group LASSO for Variable Selection in Finite Mixture Regression Models

    … selection is important at two levels: (1) at the group level by removing completely irrelevant covariates across all subpopulations and (2) at the individual level by removing irrelevant covariates within each subpopulation. However, existing variable selection methods for FMR focus solely on …

    guelph Repository record for Component-Weighted Sparse Group LASSO for Variable Selection in Finite Mixture Regression Models (opens in a new tab)

  6. EFFICIENT HESSIAN BASED ALGORITHMS FOR SOLVING SPARSE GROUP LASSO AND MULTIPLE GRAPHICAL LASSO PROBLEMS

    … large-scale statistical problems: the sparse group Lasso and multiple graphical Lasso problems. The first part of the thesis has proposed an augmented Lagrangian method for large-scale non-overlapping sparse group Lasso problems with each subproblem being solved by a superlinearly convergent …

    nus Repository record for EFFICIENT HESSIAN BASED ALGORITHMS FOR SOLVING SPARSE GROUP LASSO AND MULTIPLE GRAPHICAL LASSO PROBLEMS (opens in a new tab) Download file for EFFICIENT HESSIAN BASED ALGORITHMS FOR SOLVING SPARSE GROUP LASSO AND MULTIPLE GRAPHICAL LASSO PROBLEMS (opens in a new tab)

  7. STATISTICAL METHODS FOR VARIABLE SELECTION IN THE CONTEXT OF HIGH-DIMENSIONAL DATA: LASSO AND EXTENSIONS

    … "large p, small n" problem. In particular, The Lasso (least absolute selection and shrinkage operator) proposed by Tibshirani has become an effective method to deal with this type of problem. the Lasso works well for the covariates which can be treated individually. When the covariates are …

    mcmaster Repository record for STATISTICAL METHODS FOR VARIABLE SELECTION IN THE CONTEXT OF HIGH-DIMENSIONAL DATA: LASSO AND EXTENSIONS (opens in a new tab)

  8. Fully Bayesian T-probit Regression with Heavy-tailed Priors for Selection in High-Dimensional Features with Grouping Structure

    … levels of genes have structure; for example, a group of co-regulated genes that have similar biological functions tend to have similar mRNA expression levels. Many statistical methods have been proposed to take the grouping structure into consideration in feature selection and regression, …

    sask Repository record for Fully Bayesian T-probit Regression with Heavy-tailed Priors for Selection in High-Dimensional Features with Grouping Structure (opens in a new tab)

  9. Machine Learning Techniques for Detecting Hierarchical Interactions in Insurance Claims Models

    … and include techniques such as Ridge regression, lasso, group-lasso and Elastic Net. The proposed approach is a hierarchical group-lasso-type model that can efficiently handle variable selection and interaction detection between variables while enforcing strong hierarchy. This is achieved by …

    concordia Download PDF for Machine Learning Techniques for Detecting Hierarchical Interactions in Insurance Claims Models (opens in a new tab)

  10. Convergence analysis of the approximate proximal splitting method for non-smooth convex optimization

    … such as compressive sensing and sparse group LASSO. In this thesis, we introduce a general class of approximate proximal splitting (APS) methods for solving such minimization problems. Methods in the APS class include many well-known algorithms such as the proximal splitting method …

    umn Repository record for Convergence analysis of the approximate proximal splitting method for non-smooth convex optimization (opens in a new tab)

  11. Sparse group sufficient dimension reduction and covariance cumulative slicing estimation

    … parts: In Part One, for regression problems with grouped covariates, we adopt the idea of sparse group lasso (Friedman et al., 2010) to the framework of the sufficient dimension reduction. We propose a method called the sparse group sufficient dimension reduction (sgSDR) to conduct group and …

    must-thes Repository record for Sparse group sufficient dimension reduction and covariance cumulative slicing estimation (opens in a new tab)

  12. Statistical methods in genome sequence analysis.

    … of the problem allows one to use the lasso to build complex dependency structures into the motif probability model in a fashion that is not overparameterized. We illustrate the performance of the approach with a set of simulations and show that it can dramatically outperform existing …

    umn Repository record for Statistical methods in genome sequence analysis. (opens in a new tab)

  13. Statistical machine learning theory and methods for high-dimensional low sample size (HDLSS) problems

    … to do variable selection and estimation: a group lasso step as an initial estimator, then followed by a adaptive group lasso step to obtain final variables and estimations. We show that under certain conditions, the two-step approach consistently selects the truly nonzero variables and …

    msu Repository record for Statistical machine learning theory and methods for high-dimensional low sample size (HDLSS) problems (opens in a new tab)

  14. Reweighting methods in high dimensional regression

    … on the application of covariate reweighting with Lasso-style methods for regression in high dimensions, particularly where <em>p</em> ≥ </p>n. We apply a particular focus to the case of sparse regression under a-priori grouping structures. <p>In such problems, even in the linear case, accurate …

    oxford Repository record for Reweighting methods in high dimensional regression (opens in a new tab)

  15. Statistical methods in disease risk analysis, disease testing and nutrition epidemiology

    … 4). In the first project, we propose to use group lasso algorithm for logistic regression to construct a risk scoring system for predicting disease in swine. We choose the penalty parameter for the group lasso through leave-one-out cross validation and use the area under the receiver …

    iastate Repository record for Statistical methods in disease risk analysis, disease testing and nutrition epidemiology (opens in a new tab)

  16. VARIABLE SELECTION FOR LONGITUDINAL AND SURVIVAL DATA

    … with the high-dimensional survival data with group predictors. Most of the existing penalized methods for Cox’s model are the group lasso methods that show deficiencies, including the over-shrinkage problem. In addition, the contemporary algorithms either exhibit the loss of efficiency or …

    tamu Repository record for VARIABLE SELECTION FOR LONGITUDINAL AND SURVIVAL DATA (opens in a new tab)

  17. Prediction Oriented Marker Selection (PROMISE) for High Dimensional Regression with Application to Personalized Medicine

    … on penalized regression methods such as the lasso and the elastic net have yielded promising results. However, selecting the right amount of penalization is critical to maintain the desired properties for both variable selection and prediction accuracy. To select the regularization parameter, …

    rice Repository record for Prediction Oriented Marker Selection (PROMISE) for High Dimensional Regression with Application to Personalized Medicine (opens in a new tab)

  18. Robust methods for analyzing multivariate responses with application to time-course data

    … number of methods have been developed including Lasso. The group Lasso is an extension of the Lasso with the goal of selecting important groups of variables rather than individual variables. In the third part of the dissertation, we propose two robust group Lasso algorithms for the multivariate …

    uiuc Repository record for Robust methods for analyzing multivariate responses with application to time-course data (opens in a new tab)

  19. Varying Coefficients in Logistic Regression with Applications to Marketing Research

    … procedure for model selection that uses a group LASSO penalty to decide which are informative and which variables need varying coefficients in the model.

    uiuc Repository record for Varying Coefficients in Logistic Regression with Applications to Marketing Research (opens in a new tab)

  20. Variable selection via Lasso with high-dimensional proteomic data

    … In this thesis, we review the theory of the Lasso procedure which provides a parameter estimator while simultaneously achieving dimension reduction due to a property of the L1 norm. Lasso with elastic net penalty and sparse group lasso are also reviewed. Our data is high-dimensional proteomic …

    wustl Repository record for Variable selection via Lasso with high-dimensional proteomic data (opens in a new tab)

Page 1 of 6