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 *

508 related articles for article (PubMed ID: 18999496)

  • 1. Benchmark graphs for testing community detection algorithms.
    Lancichinetti A; Fortunato S; Radicchi F
    Phys Rev E Stat Nonlin Soft Matter Phys; 2008 Oct; 78(4 Pt 2):046110. PubMed ID: 18999496
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities.
    Lancichinetti A; Fortunato S
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Jul; 80(1 Pt 2):016118. PubMed ID: 19658785
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Community detection algorithms: a comparative analysis.
    Lancichinetti A; Fortunato S
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Nov; 80(5 Pt 2):056117. PubMed ID: 20365053
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Graph clustering with local search optimization: the resolution bias of the objective function matters most.
    van Laarhoven T; Marchiori E
    Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Jan; 87(1):012812. PubMed ID: 23410393
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Scalable detection of statistically significant communities and hierarchies, using message passing for modularity.
    Zhang P; Moore C
    Proc Natl Acad Sci U S A; 2014 Dec; 111(51):18144-9. PubMed ID: 25489096
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Adaptive clustering algorithm for community detection in complex networks.
    Ye Z; Hu S; Yu J
    Phys Rev E Stat Nonlin Soft Matter Phys; 2008 Oct; 78(4 Pt 2):046115. PubMed ID: 18999501
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Improving the performance of algorithms to find communities in networks.
    Darst RK; Nussinov Z; Fortunato S
    Phys Rev E Stat Nonlin Soft Matter Phys; 2014 Mar; 89(3):032809. PubMed ID: 24730901
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Memetic algorithm for community detection in networks.
    Gong M; Fu B; Jiao L; Du H
    Phys Rev E Stat Nonlin Soft Matter Phys; 2011 Nov; 84(5 Pt 2):056101. PubMed ID: 22181467
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Detecting Community Structure by Using a Constrained Label Propagation Algorithm.
    Chin JH; Ratnavelu K
    PLoS One; 2016; 11(5):e0155320. PubMed ID: 27176470
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Community identification in networks with unbalanced structure.
    Zhang S; Zhao H
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Jun; 85(6 Pt 2):066114. PubMed ID: 23005169
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Hierarchical benchmark graphs for testing community detection algorithms.
    Yang Z; Perotti JI; Tessone CJ
    Phys Rev E; 2017 Nov; 96(5-1):052311. PubMed ID: 29347723
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Exponential random graph models for networks with community structure.
    Fronczak P; Fronczak A; Bujok M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Sep; 88(3):032810. PubMed ID: 24125315
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Exploring community structure in biological networks with random graphs.
    Sah P; Singh LO; Clauset A; Bansal S
    BMC Bioinformatics; 2014 Jun; 15():220. PubMed ID: 24965130
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Emergence and size of the giant component in clustered random graphs with a given degree distribution.
    Berchenko Y; Artzy-Randrup Y; Teicher M; Stone L
    Phys Rev Lett; 2009 Apr; 102(13):138701. PubMed ID: 19392410
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Modeling of growing networks with directional attachment and communities.
    Kimura M; Saito K; Ueda N
    Neural Netw; 2004 Sep; 17(7):975-88. PubMed ID: 15312840
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Finding statistically significant communities in networks.
    Lancichinetti A; Radicchi F; Ramasco JJ; Fortunato S
    PLoS One; 2011 Apr; 6(4):e18961. PubMed ID: 21559480
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A seed-expanding method based on random walks for community detection in networks with ambiguous community structures.
    Su Y; Wang B; Zhang X
    Sci Rep; 2017 Feb; 7():41830. PubMed ID: 28157183
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Benchmark model to assess community structure in evolving networks.
    Granell C; Darst RK; Arenas A; Fortunato S; Gómez S
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Jul; 92(1):012805. PubMed ID: 26274223
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Faster unfolding of communities: speeding up the Louvain algorithm.
    Traag VA
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Sep; 92(3):032801. PubMed ID: 26465522
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Limits of modularity maximization in community detection.
    Lancichinetti A; Fortunato S
    Phys Rev E Stat Nonlin Soft Matter Phys; 2011 Dec; 84(6 Pt 2):066122. PubMed ID: 22304170
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 26.