Multiple-Instance Logistic Regression with LASSO Penalty
暂无分享,去创建一个
Ray-Bing Chen | Shuen-Lin Jeng | Chun-Hao Yang | Chi-Chun Hsia | Ping-Yang Chen | Kuang-Hung Cheng | Sheng Mao Chang
[1] Thomas G. Dietterich,et al. Solving the Multiple Instance Problem with Axis-Parallel Rectangles , 1997, Artif. Intell..
[2] James R. Foulds,et al. A review of multi-instance learning assumptions , 2010, The Knowledge Engineering Review.
[3] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[4] Oded Maron,et al. Learning from Ambiguity , 1998 .
[5] M. H. Quenouille. NOTES ON BIAS IN ESTIMATION , 1956 .
[6] R. Tibshirani,et al. On the “degrees of freedom” of the lasso , 2007, 0712.0881.
[7] Trevor Hastie,et al. Regularization Paths for Generalized Linear Models via Coordinate Descent. , 2010, Journal of statistical software.
[8] D. Rubin,et al. Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .
[9] D. Firth. Bias reduction of maximum likelihood estimates , 1993 .
[10] Xin Xu,et al. Logistic Regression and Boosting for Labeled Bags of Instances , 2004, PAKDD.
[11] Wenjiang J. Fu. Penalized Regressions: The Bridge versus the Lasso , 1998 .