BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

148 related articles for article (PubMed ID: 37200121)

  • 1. Large-Scale Clustering With Structured Optimal Bipartite Graph.
    Zhang H; Nie F; Li X
    IEEE Trans Pattern Anal Mach Intell; 2023 Aug; 45(8):9950-9963. PubMed ID: 37200121
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Joint feature selection and optimal bipartite graph learning for subspace clustering.
    Mei S; Zhao W; Gao Q; Yang M; Gao X
    Neural Netw; 2023 Jul; 164():408-418. PubMed ID: 37182344
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Learning the consensus and complementary information for large-scale multi-view clustering.
    Liu M; Palade V; Zheng Z
    Neural Netw; 2024 Apr; 172():106103. PubMed ID: 38219678
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Efficient Multi-View Clustering via Unified and Discrete Bipartite Graph Learning.
    Fang SG; Huang D; Cai XS; Wang CD; He C; Tang Y
    IEEE Trans Neural Netw Learn Syst; 2023 Apr; PP():. PubMed ID: 37030820
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Joint Structured Bipartite Graph and Row-Sparse Projection for Large-Scale Feature Selection.
    Dong X; Nie F; Wu D; Wang R; Li X
    IEEE Trans Neural Netw Learn Syst; 2024 May; PP():. PubMed ID: 38717885
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Fast Self-Supervised Clustering With Anchor Graph.
    Wang J; Ma Z; Nie F; Li X
    IEEE Trans Neural Netw Learn Syst; 2022 Sep; 33(9):4199-4212. PubMed ID: 33587715
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Structured Optimal Graph-Based Clustering With Flexible Embedding.
    Ren P; Xiao Y; Chang X; Prakash M; Nie F; Wang X; Chen X
    IEEE Trans Neural Netw Learn Syst; 2020 Oct; 31(10):3801-3813. PubMed ID: 31722496
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. Anchor Graph Network for Incomplete Multiview Clustering.
    Fu Y; Li Y; Huang Q; Cui J; Wen J
    IEEE Trans Neural Netw Learn Syst; 2024 Jan; PP():. PubMed ID: 38215314
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Semi-Supervised Multi-View Clustering with Weighted Anchor Graph Embedding.
    Wang S; Cao J; Lei F; Dai Q; Liang S; Wing-Kuen Ling B
    Comput Intell Neurosci; 2021; 2021():4296247. PubMed ID: 34354743
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Tensorized Bipartite Graph Learning for Multi-View Clustering.
    Xia W; Gao Q; Wang Q; Gao X; Ding C; Tao D
    IEEE Trans Pattern Anal Mach Intell; 2023 Apr; 45(4):5187-5202. PubMed ID: 35786549
    [TBL] [Abstract][Full Text] [Related]  

  • 12. scBGEDA: deep single-cell clustering analysis via a dual denoising autoencoder with bipartite graph ensemble clustering.
    Wang Y; Yu Z; Li S; Bian C; Liang Y; Wong KC; Li X
    Bioinformatics; 2023 Feb; 39(2):. PubMed ID: 36734596
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Multiview Clustering: A Scalable and Parameter-Free Bipartite Graph Fusion Method.
    Li X; Zhang H; Wang R; Nie F
    IEEE Trans Pattern Anal Mach Intell; 2022 Jan; 44(1):330-344. PubMed ID: 32750830
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Structured Graph Learning for Scalable Subspace Clustering: From Single View to Multiview.
    Kang Z; Lin Z; Zhu X; Xu W
    IEEE Trans Cybern; 2022 Sep; 52(9):8976-8986. PubMed ID: 33729977
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Robust large-scale clustering based on correntropy.
    Jin G; Gao J; Tan L
    PLoS One; 2022; 17(11):e0277012. PubMed ID: 36331916
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Learning an Optimal Bipartite Graph for Subspace Clustering via Constrained Laplacian Rank.
    Nie F; Chang W; Wang R; Li X
    IEEE Trans Cybern; 2023 Feb; 53(2):1235-1247. PubMed ID: 34637388
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Fast multiple graphs learning for multi-view clustering.
    Jiang T; Gao Q
    Neural Netw; 2022 Nov; 155():348-359. PubMed ID: 36115161
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Co-Clustering on Bipartite Graphs for Robust Model Fitting.
    Lin S; Luo H; Yan Y; Xiao G; Wang H
    IEEE Trans Image Process; 2022; 31():6605-6620. PubMed ID: 36256709
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Exact and approximate graph matching using random walks.
    Gori M; Maggini M; Sarti L
    IEEE Trans Pattern Anal Mach Intell; 2005 Jul; 27(7):1100-11. PubMed ID: 16013757
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Efficient Discrete Clustering With Anchor Graph.
    Wang J; Ma Z; Nie F; Li X
    IEEE Trans Neural Netw Learn Syst; 2023 Jun; PP():. PubMed ID: 37289611
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.