Group Orthogonal Matching Pursuit for Logistic Regression
暂无分享,去创建一个
[1] Stéphane Mallat,et al. Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..
[2] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[3] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[4] S. Karlin,et al. Prediction of complete gene structures in human genomic DNA. , 1997, Journal of molecular biology.
[5] C. Burge. Chapter 8 – Modeling dependencies in pre-mRNA splicing signals , 1998 .
[6] Peter L. Bartlett,et al. Boosting Algorithms as Gradient Descent , 1999, NIPS.
[7] Y. Freund,et al. Discussion of the Paper \additive Logistic Regression: a Statistical View of Boosting" By , 2000 .
[8] S. Salzberg,et al. GeneSplicer: a new computational method for splice site prediction. , 2001, Nucleic acids research.
[9] Trevor Hastie,et al. The Elements of Statistical Learning , 2001 .
[10] J. Reid. Experimental Design and Data Analysis for Biologists , 2003 .
[11] Christopher B. Burge,et al. Maximum entropy modeling of short sequence motifs with applications to RNA splicing signals , 2003, RECOMB '03.
[12] Joel A. Tropp,et al. Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.
[13] Pascal Vincent,et al. Kernel Matching Pursuit , 2002, Machine Learning.
[14] H. Zou,et al. Regularization and variable selection via the elastic net , 2005 .
[15] M. Yuan,et al. Model selection and estimation in regression with grouped variables , 2006 .
[16] P. Zhao,et al. Grouped and Hierarchical Model Selection through Composite Absolute Penalties , 2007 .
[17] Francis R. Bach,et al. Consistency of the group Lasso and multiple kernel learning , 2007, J. Mach. Learn. Res..
[18] Volker Roth,et al. The Group-Lasso for generalized linear models: uniqueness of solutions and efficient algorithms , 2008, ICML '08.
[19] P. Bühlmann,et al. The group lasso for logistic regression , 2008 .
[20] Guilherme V. Rocha,et al. Asymptotic distribution and sparsistency for `1 penalized parametric M-estimators, with applications to linear SVM and logistic regression , 2009, 0908.1940.
[21] Tong Zhang,et al. On the Consistency of Feature Selection using Greedy Least Squares Regression , 2009, J. Mach. Learn. Res..
[22] Sundeep Rangan,et al. Orthogonal Matching Pursuit From Noisy Random Measurements: A New Analysis , 2009, NIPS.
[23] Robert Tibshirani,et al. The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd Edition , 2001, Springer Series in Statistics.
[24] Junzhou Huang,et al. Learning with structured sparsity , 2009, ICML '09.
[25] S. Shalev-Shwartz. Trading Accuracy for Sparsity , 2009 .
[26] Naoki Abe,et al. Grouped Orthogonal Matching Pursuit for Variable Selection and Prediction , 2009, NIPS.
[27] Ambuj Tewari,et al. Learning Exponential Families in High-Dimensions: Strong Convexity and Sparsity , 2009, AISTATS.
[28] Tong Zhang,et al. Sparse Recovery With Orthogonal Matching Pursuit Under RIP , 2010, IEEE Transactions on Information Theory.