118 related articles for article (PubMed ID: 23917694)
1. Fully corrective boosting with arbitrary loss and regularization.
Shen C; Li H; van den Hengel A
Neural Netw; 2013 Dec; 48():44-58. PubMed ID: 23917694
[TBL] [Abstract][Full Text] [Related]
2. Training Lp norm multiple kernel learning in the primal.
Liang Z; Xia S; Zhou Y; Zhang L
Neural Netw; 2013 Oct; 46():172-82. PubMed ID: 23770740
[TBL] [Abstract][Full Text] [Related]
3. Fast and robust object detection using asymmetric totally corrective boosting.
Wang P; Shen C; Barnes N; Zheng H
IEEE Trans Neural Netw Learn Syst; 2012 Jan; 23(1):33-46. PubMed ID: 24808454
[TBL] [Abstract][Full Text] [Related]
4. Arbitrary norm support vector machines.
Huang K; Zheng D; King I; Lyu MR
Neural Comput; 2009 Feb; 21(2):560-82. PubMed ID: 19431269
[TBL] [Abstract][Full Text] [Related]
5. On the dual formulation of boosting algorithms.
Shen C; Li H
IEEE Trans Pattern Anal Mach Intell; 2010 Dec; 32(12):2216-31. PubMed ID: 20975119
[TBL] [Abstract][Full Text] [Related]
6. Semi-supervised learning via regularized boosting working on multiple semi-supervised assumptions.
Chen K; Wang S
IEEE Trans Pattern Anal Mach Intell; 2011 Jan; 33(1):129-43. PubMed ID: 20421671
[TBL] [Abstract][Full Text] [Related]
7. Ensemble-based discriminant learning with boosting for face recognition.
Lu J; Plataniotis KN; Venetsanopoulos AN; Li SZ
IEEE Trans Neural Netw; 2006 Jan; 17(1):166-78. PubMed ID: 16526485
[TBL] [Abstract][Full Text] [Related]
8. Theoretical and Empirical Analysis of a Spatial EA Parallel Boosting Algorithm.
Kamath U; Domeniconi C; De Jong K
Evol Comput; 2018; 26(1):43-66. PubMed ID: 27982696
[TBL] [Abstract][Full Text] [Related]
9. Boosting through optimization of margin distributions.
Shen C; Li H
IEEE Trans Neural Netw; 2010 Apr; 21(4):659-66. PubMed ID: 20172821
[TBL] [Abstract][Full Text] [Related]
10. Multiple kernel learning in the primal for multimodal Alzheimer's disease classification.
Liu F; Zhou L; Shen C; Yin J
IEEE J Biomed Health Inform; 2014 May; 18(3):984-90. PubMed ID: 24132030
[TBL] [Abstract][Full Text] [Related]
11. Boosting random subspace method.
García-Pedrajas N; Ortiz-Boyer D
Neural Netw; 2008 Nov; 21(9):1344-62. PubMed ID: 18272334
[TBL] [Abstract][Full Text] [Related]
12. Multiple-view geometry under the Linfinity-norm.
Kahl F; Hartley R
IEEE Trans Pattern Anal Mach Intell; 2008 Sep; 30(9):1603-17. PubMed ID: 18617718
[TBL] [Abstract][Full Text] [Related]
13. Boosting method for local learning in statistical pattern recognition.
Kawakita M; Eguchi S
Neural Comput; 2008 Nov; 20(11):2792-838. PubMed ID: 18533822
[TBL] [Abstract][Full Text] [Related]
14. Robust support vector regression in the primal.
Zhao Y; Sun J
Neural Netw; 2008 Dec; 21(10):1548-55. PubMed ID: 18829255
[TBL] [Abstract][Full Text] [Related]
15. TSVR: an efficient Twin Support Vector Machine for regression.
Peng X
Neural Netw; 2010 Apr; 23(3):365-72. PubMed ID: 19616409
[TBL] [Abstract][Full Text] [Related]
16. A boosting framework for visuality-preserving distance metric learning and its application to medical image retrieval.
Yang L; Jin R; Mummert L; Sukthankar R; Goode A; Zheng B; Hoi SC; Satyanarayanan M
IEEE Trans Pattern Anal Mach Intell; 2010 Jan; 32(1):30-44. PubMed ID: 19926897
[TBL] [Abstract][Full Text] [Related]
17. Ideal regularization for learning kernels from labels.
Pan B; Lai J; Shen L
Neural Netw; 2014 Aug; 56():22-34. PubMed ID: 24824969
[TBL] [Abstract][Full Text] [Related]
18. Sparse multiple kernel learning for signal processing applications.
Subrahmanya N; Shin YC
IEEE Trans Pattern Anal Mach Intell; 2010 May; 32(5):788-98. PubMed ID: 20299705
[TBL] [Abstract][Full Text] [Related]
19. Cost-sensitive boosting.
Masnadi-Shirazi H; Vasconcelos N
IEEE Trans Pattern Anal Mach Intell; 2011 Feb; 33(2):294-309. PubMed ID: 21193808
[TBL] [Abstract][Full Text] [Related]
20. Hessian Schatten-norm regularization for linear inverse problems.
Lefkimmiatis S; Ward JP; Unser M
IEEE Trans Image Process; 2013 May; 22(5):1873-88. PubMed ID: 23303692
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
