BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

116 related articles for article (PubMed ID: 37342947)

  • 1. A Review of Convex Clustering From Multiple Perspectives: Models, Optimizations, Statistical Properties, Applications, and Connections.
    Feng Q; Chen CLP; Liu L
    IEEE Trans Neural Netw Learn Syst; 2023 Jun; PP():. PubMed ID: 37342947
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Splitting Methods for Convex Clustering.
    Chi EC; Lange K
    J Comput Graph Stat; 2015; 24(4):994-1013. PubMed ID: 27087770
    [TBL] [Abstract][Full Text] [Related]  

  • 3. NOISY MATRIX COMPLETION: UNDERSTANDING STATISTICAL GUARANTEES FOR CONVEX RELAXATION VIA NONCONVEX OPTIMIZATION.
    Chen Y; Chi Y; Fan J; Ma C; Yan Y
    SIAM J Optim; 2020; 30(4):3098-3121. PubMed ID: 34305368
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Does Determination of Initial Cluster Centroids Improve the Performance of
    Pourahmad S; Basirat A; Rahimi A; Doostfatemeh M
    Comput Math Methods Med; 2020; 2020():7636857. PubMed ID: 32802153
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems.
    Gong P; Zhang C; Lu Z; Huang JZ; Ye J
    JMLR Workshop Conf Proc; 2013; 28(2):37-45. PubMed ID: 25285330
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A Combination of Particle Swarm Optimization and Minkowski Weighted K-Means Clustering: Application in Lateralization of Temporal Lobe Epilepsy.
    Jamali-Dinan SS; Soltanian-Zadeh H; Bowyer SM; Almohri H; Dehghani H; Elisevich K; Nazem-Zadeh MR
    Brain Topogr; 2020 Jul; 33(4):519-532. PubMed ID: 32347472
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Statistical properties of convex clustering.
    Tan KM; Witten D
    Electron J Stat; 2015; 9(2):2324-2347. PubMed ID: 27617051
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Towards enhancement of performance of K-means clustering using nature-inspired optimization algorithms.
    Fong S; Deb S; Yang XS; Zhuang Y
    ScientificWorldJournal; 2014; 2014():564829. PubMed ID: 25202730
    [TBL] [Abstract][Full Text] [Related]  

  • 9. BRIDGING CONVEX AND NONCONVEX OPTIMIZATION IN ROBUST PCA: NOISE, OUTLIERS, AND MISSING DATA.
    Chen Y; Fan J; Ma C; Yan Y
    Ann Stat; 2021 Oct; 49(5):2948-2971. PubMed ID: 36148268
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Data Convexity and Parameter Independent Clustering for Biomedical Datasets.
    Rahman MA; Ang LM; Seng KP
    IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(2):765-772. PubMed ID: 32149694
    [TBL] [Abstract][Full Text] [Related]  

  • 11. MOCCA: Mirrored Convex/Concave Optimization for Nonconvex Composite Functions.
    Barber RF; Sidky EY
    J Mach Learn Res; 2016; 17(144):1-51. PubMed ID: 29391859
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Global Convergence Guarantees of (A)GIST for a Family of Nonconvex Sparse Learning Problems.
    Zhang H; Qian F; Shang F; Du W; Qian J; Yang J
    IEEE Trans Cybern; 2022 May; 52(5):3276-3288. PubMed ID: 32784147
    [TBL] [Abstract][Full Text] [Related]  

  • 13. PK-means: A new algorithm for gene clustering.
    Du Z; Wang Y; Ji Z
    Comput Biol Chem; 2008 Aug; 32(4):243-7. PubMed ID: 18502690
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. Cross-domain, soft-partition clustering with diversity measure and knowledge reference.
    Qian P; Sun S; Jiang Y; Su KH; Ni T; Wang S; Muzic RF
    Pattern Recognit; 2016 Feb; 50():155-177. PubMed ID: 27275022
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Boosting k-means clustering with symbiotic organisms search for automatic clustering problems.
    Ikotun AM; Ezugwu AE
    PLoS One; 2022; 17(8):e0272861. PubMed ID: 35951672
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Discrete Optimal Graph Clustering.
    Han Y; Zhu L; Cheng Z; Li J; Liu X
    IEEE Trans Cybern; 2020 Apr; 50(4):1697-1710. PubMed ID: 30530347
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Provable Convex Co-clustering of Tensors.
    Chi EC; Gaines BR; Sun WW; Zhou H; Yang J
    J Mach Learn Res; 2020; 21():. PubMed ID: 33312074
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Solving minimum distance problems with convex or concave bodies using combinatorial global optimization algorithms.
    Carretero JA; Nahon MA
    IEEE Trans Syst Man Cybern B Cybern; 2005 Dec; 35(6):1144-55. PubMed ID: 16366241
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A novel variant of social spider optimization using single centroid representation and enhanced mating for data clustering.
    Thalamala R; Barnabas J; Reddy AV
    PeerJ Comput Sci; 2019; 5():e201. PubMed ID: 33816854
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.