BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

106 related articles for article (PubMed ID: 28113737)

  • 1. Nonsmooth Penalized Clustering via $\ell _{p}$ Regularized Sparse Regression.
    Niu L; Zhou R; Tian Y; Qi Z; Zhang P
    IEEE Trans Cybern; 2017 Jun; 47(6):1423-1433. PubMed ID: 28113737
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Feature Selection With $\ell_{2,1-2}$ Regularization.
    Yong Shi ; Jianyu Miao ; Zhengyu Wang ; Peng Zhang ; Lingfeng Niu
    IEEE Trans Neural Netw Learn Syst; 2018 Oct; 29(10):4967-4982. PubMed ID: 29994757
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Non-Lipschitz lp-regularization and box constrained model for image restoration.
    Chen X; Ng MK; Zhang C
    IEEE Trans Image Process; 2012 Dec; 21(12):4709-21. PubMed ID: 23008251
    [TBL] [Abstract][Full Text] [Related]  

  • 4. OPTIMAL COMPUTATIONAL AND STATISTICAL RATES OF CONVERGENCE FOR SPARSE NONCONVEX LEARNING PROBLEMS.
    Wang Z; Liu H; Zhang T
    Ann Stat; 2014; 42(6):2164-2201. PubMed ID: 25544785
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Smoothing neural network for L
    Li W; Bian W
    Neural Netw; 2021 Nov; 143():678-689. PubMed ID: 34403868
    [TBL] [Abstract][Full Text] [Related]  

  • 6. 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]  

  • 7. On a Monotone Scheme for Nonconvex Nonsmooth Optimization with Applications to Fracture Mechanics.
    Ghilli D; Kunisch K
    J Optim Theory Appl; 2019; 183(2):609-641. PubMed ID: 31975742
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Robust AOA-Based Target Localization for Uniformly Distributed Noise via
    Chen Y; Wang C; Yan Q
    Entropy (Basel); 2022 Sep; 24(9):. PubMed ID: 36141144
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Nonsmooth Optimization-Based Model and Algorithm for Semisupervised Clustering.
    Bagirov AM; Taheri S; Bai F; Zheng F
    IEEE Trans Neural Netw Learn Syst; 2023 Sep; 34(9):5517-5530. PubMed ID: 34851837
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A Semismooth Newton Algorithm for High-Dimensional Nonconvex Sparse Learning.
    Shi Y; Huang J; Jiao Y; Yang Q
    IEEE Trans Neural Netw Learn Syst; 2020 Aug; 31(8):2993-3006. PubMed ID: 31536018
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Smoothing inertial projection neural network for minimization L
    Zhao Y; He X; Huang T; Huang J
    Neural Netw; 2018 Mar; 99():31-41. PubMed ID: 29306802
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Smoothing inertial neurodynamic approach for sparse signal reconstruction via L
    Zhao Y; Liao X; He X; Tang R; Deng W
    Neural Netw; 2021 Aug; 140():100-112. PubMed ID: 33752140
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Fast nonconvex nonsmooth minimization methods for image restoration and reconstruction.
    Nikolova M; Ng MK; Tam CP
    IEEE Trans Image Process; 2010 Dec; 19(12):3073-88. PubMed ID: 20542766
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Image Super-Resolution via Adaptive Regularization and Sparse Representation.
    Cao F; Cai M; Tan Y; Zhao J
    IEEE Trans Neural Netw Learn Syst; 2016 Jul; 27(7):1550-61. PubMed ID: 26766382
    [TBL] [Abstract][Full Text] [Related]  

  • 15. On the convergence of nonconvex minimization methods for image recovery.
    Xiao J; Ng MK; Yang YF
    IEEE Trans Image Process; 2015 May; 24(5):1587-98. PubMed ID: 25675457
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Convergence Analysis of Online Gradient Method for High-Order Neural Networks and Their Sparse Optimization.
    Fan Q; Kang Q; Zurada JM; Huang T; Xu D
    IEEE Trans Neural Netw Learn Syst; 2023 Oct; PP():. PubMed ID: 37847629
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Discriminative embedded clustering: a framework for grouping high-dimensional data.
    Hou C; Nie F; Yi D; Tao D
    IEEE Trans Neural Netw Learn Syst; 2015 Jun; 26(6):1287-99. PubMed ID: 25095267
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A Modified BFGS Formula Using a Trust Region Model for Nonsmooth Convex Minimizations.
    Cui Z; Yuan G; Sheng Z; Liu W; Wang X; Duan X
    PLoS One; 2015; 10(10):e0140606. PubMed ID: 26501775
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Cluster Analysis: Unsupervised Learning via Supervised Learning with a Non-convex Penalty.
    Pan W; Shen X; Liu B
    J Mach Learn Res; 2013 Jul; 14(7):1865. PubMed ID: 24358018
    [TBL] [Abstract][Full Text] [Related]  

  • 20. The Proximal Trajectory Algorithm in SVM Cross Validation.
    Astorino A; Fuduli A
    IEEE Trans Neural Netw Learn Syst; 2016 May; 27(5):966-77. PubMed ID: 27101080
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.