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 *

113 related articles for article (PubMed ID: 37023089)

  • 1. Eigenvalue based spectral classification.
    Borkowski P; Kłopotek MA; Starosta B; Wierzchoń ST; Sydow M
    PLoS One; 2023; 18(4):e0283413. PubMed ID: 37023089
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Hypergraphs with edge-dependent vertex weights:
    Zhu Y; Segarra S
    Front Big Data; 2023; 6():1020173. PubMed ID: 36896444
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Toward the optimization of normalized graph Laplacian.
    Xie B; Wang M; Tao D
    IEEE Trans Neural Netw; 2011 Apr; 22(4):660-6. PubMed ID: 21356614
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Graphlet Laplacians for topology-function and topology-disease relationships.
    Windels SFL; Malod-Dognin N; Pržulj N
    Bioinformatics; 2019 Dec; 35(24):5226-5234. PubMed ID: 31192358
    [TBL] [Abstract][Full Text] [Related]  

  • 5. HOMOTOPY CONTINUATION FOR THE SPECTRA OF PERSISTENT LAPLACIANS.
    Wei X; Wei GW
    Found Data Sci; 2021 Dec; 3(4):677-700. PubMed ID: 35822080
    [TBL] [Abstract][Full Text] [Related]  

  • 6. An efficient supply management in water flow network using graph spectral techniques.
    Gopalsamy T; Thankappan V; Chandramohan S
    Environ Sci Pollut Res Int; 2023 Jan; 30(2):2530-2543. PubMed ID: 35932342
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Graph Laplacian Regularization for Robust Optical Flow Estimation.
    Young SI; Naman AT; Taubman D
    IEEE Trans Image Process; 2019 Oct; ():. PubMed ID: 31613756
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Optimized data fusion for K-means Laplacian clustering.
    Yu S; Liu X; Tranchevent LC; Glänzel W; Suykens JA; De Moor B; Moreau Y
    Bioinformatics; 2011 Jan; 27(1):118-26. PubMed ID: 20980271
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Bounds of the spectral radius and the Nordhaus-Gaddum type of the graphs.
    Wang T; Jia L; Sun F
    ScientificWorldJournal; 2013; 2013():472956. PubMed ID: 23844399
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A Local Structural Descriptor for Image Matching via Normalized Graph Laplacian Embedding.
    Tang J; Shao L; Li X; Lu K
    IEEE Trans Cybern; 2016 Feb; 46(2):410-20. PubMed ID: 25775504
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Discovering genetic ancestry using spectral graph theory.
    Lee AB; Luca D; Klei L; Devlin B; Roeder K
    Genet Epidemiol; 2010 Jan; 34(1):51-9. PubMed ID: 19455578
    [TBL] [Abstract][Full Text] [Related]  

  • 12. The Laplacian spectrum of neural networks.
    de Lange SC; de Reus MA; van den Heuvel MP
    Front Comput Neurosci; 2014 Jan; 7():189. PubMed ID: 24454286
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Directed network Laplacians and random graph models.
    Gong X; Higham DJ; Zygalakis K
    R Soc Open Sci; 2021 Oct; 8(10):211144. PubMed ID: 34659784
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Deep unsupervised feature selection by discarding nuisance and correlated features.
    Shaham U; Lindenbaum O; Svirsky J; Kluger Y
    Neural Netw; 2022 Aug; 152():34-43. PubMed ID: 35500458
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Spectral Embedding Norm: Looking Deep into the Spectrum of the Graph Laplacian.
    Cheng X; Mishne G
    SIAM J Imaging Sci; 2020; 13(2):1015-1048. PubMed ID: 34136062
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Limitations in the spectral method for graph partitioning: Detectability threshold and localization of eigenvectors.
    Kawamoto T; Kabashima Y
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Jun; 91(6):062803. PubMed ID: 26172750
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Multiway
    Pasadakis D; Alappat CL; Schenk O; Wellein G
    Mach Learn; 2022; 111(2):791-829. PubMed ID: 35400807
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Weighted graph cuts without eigenvectors a multilevel approach.
    Dhillon IS; Guan Y; Kulis B
    IEEE Trans Pattern Anal Mach Intell; 2007 Nov; 29(11):1944-57. PubMed ID: 17848776
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Investigation of the use of spectral clustering for the analysis of molecular data.
    Gan S; Cosgrove DA; Gardiner EJ; Gillet VJ
    J Chem Inf Model; 2014 Dec; 54(12):3302-19. PubMed ID: 25379955
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Spectral redemption in clustering sparse networks.
    Krzakala F; Moore C; Mossel E; Neeman J; Sly A; Zdeborová L; Zhang P
    Proc Natl Acad Sci U S A; 2013 Dec; 110(52):20935-40. PubMed ID: 24277835
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.