These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

229 related articles for article (PubMed ID: 24077658)

  • 1. Learning Incoherent Sparse and Low-Rank Patterns from Multiple Tasks.
    Chen J; Liu J; Ye J
    ACM Trans Knowl Discov Data; 2012 Feb; 5(4):22. PubMed ID: 24077658
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Multi-Stage Multi-Task Feature Learning.
    Gong P; Ye J; Zhang C
    Adv Neural Inf Process Syst; 2013 Oct; 14():2979-3010. PubMed ID: 24431924
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Neural network for a class of sparse optimization with L
    Wei Z; Li Q; Wei J; Bian W
    Neural Netw; 2022 Jul; 151():211-221. PubMed ID: 35439665
    [TBL] [Abstract][Full Text] [Related]  

  • 4. An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion.
    Liu Y; Jiao LC; Shang F; Yin F; Liu F
    Neural Netw; 2013 Dec; 48():8-18. PubMed ID: 23891807
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A convex formulation for learning a shared predictive structure from multiple tasks.
    Chen J; Tang L; Liu J; Ye J
    IEEE Trans Pattern Anal Mach Intell; 2013 May; 35(5):1025-38. PubMed ID: 23520249
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Efficient multi-task learning with adaptive temporal structure for progression prediction.
    Zhou M; Zhang Y; Liu T; Yang Y; Yang P
    Neural Comput Appl; 2023 May; ():1-16. PubMed ID: 37362567
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Modeling Disease Progression via Fused Sparse Group Lasso.
    Zhou J; Liu J; Narayan VA; Ye J
    KDD; 2012; 2012():1095-1103. PubMed ID: 25309808
    [TBL] [Abstract][Full Text] [Related]  

  • 8. An accelerated proximal gradient algorithm for singly linearly constrained quadratic programs with box constraints.
    Han C; Li M; Zhao T; Guo T
    ScientificWorldJournal; 2013; 2013():246596. PubMed ID: 24223028
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Gradient regularization of Newton method with Bregman distances.
    Doikov N; Nesterov Y
    Math Program; 2024; 204(1-2):1-25. PubMed ID: 38371323
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Smoothed low rank and sparse matrix recovery by iteratively reweighted least squares minimization.
    Lu C; Lin Z; Yan S
    IEEE Trans Image Process; 2015 Feb; 24(2):646-54. PubMed ID: 25531948
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Clustered Multi-Task Learning Via Alternating Structure Optimization.
    Zhou J; Chen J; Ye J
    Adv Neural Inf Process Syst; 2011; 2011():702-710. PubMed ID: 25328366
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Generalized Embedding Regression: A Framework for Supervised Feature Extraction.
    Lu J; Lai Z; Wang H; Chen Y; Zhou J; Shen L
    IEEE Trans Neural Netw Learn Syst; 2022 Jan; 33(1):185-199. PubMed ID: 33147149
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Weighted SGD for ℓ
    Yang J; Chow YL; Ré C; Mahoney MW
    Proc Annu ACM SIAM Symp Discret Algorithms; 2016 Jan; 2016():558-569. PubMed ID: 29782626
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data.
    Boţ RI; Csetnek ER; Nimana N
    Optim Lett; 2018; 12(1):17-33. PubMed ID: 31998412
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Learning sparse kernel classifiers for multi-instance classification.
    Fu Z; Lu G; Ting KM; Zhang D
    IEEE Trans Neural Netw Learn Syst; 2013 Sep; 24(9):1377-89. PubMed ID: 24808575
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Unsupervised Feature Selection With Constrained ℓ₂,₀-Norm and Optimized Graph.
    Nie F; Dong X; Tian L; Wang R; Li X
    IEEE Trans Neural Netw Learn Syst; 2022 Apr; 33(4):1702-1713. PubMed ID: 33361007
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Low-rank structure learning via nonconvex heuristic recovery.
    Deng Y; Dai Q; Liu R; Zhang Z; Hu S
    IEEE Trans Neural Netw Learn Syst; 2013 Mar; 24(3):383-96. PubMed ID: 24808312
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Hyperspectral Images Denoising via Nonconvex Regularized Low-Rank and Sparse Matrix Decomposition.
    Xie T; Li S; Sun B
    IEEE Trans Image Process; 2020; 29():44-56. PubMed ID: 31329555
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Lagrangian support vector regression via unconstrained convex minimization.
    Balasundaram S; Gupta D; Kapil
    Neural Netw; 2014 Mar; 51():67-79. PubMed ID: 24374970
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Constrained optimal filter design for multi-channel active noise control via convex optimization.
    Zhuang Y; Liu Y
    J Acoust Soc Am; 2021 Oct; 150(4):2888. PubMed ID: 34717511
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 12.