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 *

181 related articles for article (PubMed ID: 33267397)

  • 1. An Entropy Regularization
    Xiong L; Wang C; Huang X; Zeng H
    Entropy (Basel); 2019 Jul; 21(7):. PubMed ID: 33267397
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Subspace K-means clustering.
    Timmerman ME; Ceulemans E; De Roover K; Van Leeuwen K
    Behav Res Methods; 2013 Dec; 45(4):1011-23. PubMed ID: 23526258
    [TBL] [Abstract][Full Text] [Related]  

  • 3. A novel Chinese herbal medicine clustering algorithm via artificial bee colony optimization.
    Han N; Qiao S; Yuan G; Huang P; Liu D; Yue K
    Artif Intell Med; 2019 Nov; 101():101760. PubMed ID: 31813485
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Low-rank representation with adaptive graph regularization.
    Wen J; Fang X; Xu Y; Tian C; Fei L
    Neural Netw; 2018 Dec; 108():83-96. PubMed ID: 30173056
    [TBL] [Abstract][Full Text] [Related]  

  • 5. An Improved K-Means Algorithm Based on Evidence Distance.
    Zhu A; Hua Z; Shi Y; Tang Y; Miao L
    Entropy (Basel); 2021 Nov; 23(11):. PubMed ID: 34828248
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Robust Dimension Reduction for Clustering With Local Adaptive Learning.
    Wang XD; Chen RC; Zeng ZQ; Hong CQ; Yan F
    IEEE Trans Neural Netw Learn Syst; 2019 Mar; 30(3):657-669. PubMed ID: 30040663
    [TBL] [Abstract][Full Text] [Related]  

  • 7. KGLRR: A low-rank representation K-means with graph regularization constraint method for Single-cell type identification.
    Wang LP; Liu JX; Shang JL; Kong XZ; Guan BX; Wang J
    Comput Biol Chem; 2023 Jun; 104():107862. PubMed ID: 37031647
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Hyper-Laplacian regularized multi-view subspace clustering with low-rank tensor constraint.
    Lu GF; Yu QR; Wang Y; Tang G
    Neural Netw; 2020 May; 125():214-223. PubMed ID: 32146353
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Extensions of kmeans-type algorithms: a new clustering framework by integrating intracluster compactness and intercluster separation.
    Huang X; Ye Y; Zhang H
    IEEE Trans Neural Netw Learn Syst; 2014 Aug; 25(8):1433-46. PubMed ID: 25050942
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Heterogeneous Tensor Decomposition for Clustering via Manifold Optimization.
    Sun Y; Gao J; Hong X; Mishra B; Yin B
    IEEE Trans Pattern Anal Mach Intell; 2016 Mar; 38(3):476-89. PubMed ID: 27046492
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Improving data retrieval quality: Evidence based medicine perspective.
    Kamalov M; Dobrynin V; Balykina J; Kolbin A; Verbitskaya E; Kasimova M
    Int J Risk Saf Med; 2015; 27 Suppl 1():S106-7. PubMed ID: 26639684
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Low Rank Subspace Clustering via Discrete Constraint and Hypergraph Regularization for Tumor Molecular Pattern Discovery.
    Liu J; Cheng Y; Wang X; Cui X; Kong Y; Du J
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(5):1500-1512. PubMed ID: 29993749
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A Robust and High-Dimensional Clustering Algorithm Based on Feature Weight and Entropy.
    Du X
    Entropy (Basel); 2023 Mar; 25(3):. PubMed ID: 36981399
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Sequential Subspace Clustering via Temporal Smoothness for Sequential Data Segmentation.
    Haijun Liu ; Jian Cheng ; Feng Wang
    IEEE Trans Image Process; 2018 Feb; 27(2):866-878. PubMed ID: 29757734
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A nonparametric clustering algorithm with a quantile-based likelihood estimator.
    Hino H; Murata N
    Neural Comput; 2014 Sep; 26(9):2074-101. PubMed ID: 24922504
    [TBL] [Abstract][Full Text] [Related]  

  • 16. An Initialization Method Based on Hybrid Distance for k-Means Algorithm.
    Yang J; Ma Y; Zhang X; Li S; Zhang Y
    Neural Comput; 2017 Nov; 29(11):3094-3117. PubMed ID: 28957026
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Learning Markov Random Walks for robust subspace clustering and estimation.
    Liu R; Lin Z; Su Z
    Neural Netw; 2014 Nov; 59():1-15. PubMed ID: 25005156
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Information-theoretic semi-supervised metric learning via entropy regularization.
    Niu G; Dai B; Yamada M; Sugiyama M
    Neural Comput; 2014 Aug; 26(8):1717-62. PubMed ID: 24877733
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Sparse subspace clustering: algorithm, theory, and applications.
    Elhamifar E; Vidal R
    IEEE Trans Pattern Anal Mach Intell; 2013 Nov; 35(11):2765-81. PubMed ID: 24051734
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Extending Data Reliability Measure to a Filter Approach for Soft Subspace Clustering.
    Boongoen T; Changjing Shang ; Iam-On N; Qiang Shen
    IEEE Trans Syst Man Cybern B Cybern; 2011 Dec; 41(6):1705-14. PubMed ID: 21803692
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.