180 related articles for article (PubMed ID: 23410393)
1. 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]
2. 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]
3. 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]
4. Analysis of Network Clustering Algorithms and Cluster Quality Metrics at Scale.
Emmons S; Kobourov S; Gallant M; Börner K
PLoS One; 2016; 11(7):e0159161. PubMed ID: 27391786
[TBL] [Abstract][Full Text] [Related]
5. Accelerated Simplified Swarm Optimization with Exploitation Search Scheme for Data Clustering.
Yeh WC; Lai CM
PLoS One; 2015; 10(9):e0137246. PubMed ID: 26348483
[TBL] [Abstract][Full Text] [Related]
6. Single-Cell Clustering Based on Shared Nearest Neighbor and Graph Partitioning.
Zhu X; Zhang J; Xu Y; Wang J; Peng X; Li HD
Interdiscip Sci; 2020 Jun; 12(2):117-130. PubMed ID: 32086753
[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. Spectral embedding network for attributed graph clustering.
Zhang X; Liu H; Wu XM; Zhang X; Liu X
Neural Netw; 2021 Oct; 142():388-396. PubMed ID: 34139655
[TBL] [Abstract][Full Text] [Related]
9. Fast construction of k-nearest neighbor graphs for point clouds.
Connor M; Kumar P
IEEE Trans Vis Comput Graph; 2010; 16(4):599-608. PubMed ID: 20467058
[TBL] [Abstract][Full Text] [Related]
10. Detecting alternative graph clusterings.
Mandala S; Kumara S; Yao T
Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Jul; 86(1 Pt 2):016111. PubMed ID: 23005495
[TBL] [Abstract][Full Text] [Related]
11. Local quality functions for graph clustering with non-negative matrix factorization.
van Laarhoven T; Marchiori E
Phys Rev E Stat Nonlin Soft Matter Phys; 2014 Dec; 90(6):062813. PubMed ID: 25615154
[TBL] [Abstract][Full Text] [Related]
12. LEGClust- a clustering algorithm based on layered entropic subgraphs.
Santos JM; Marques de Sa J; Alexandre LA
IEEE Trans Pattern Anal Mach Intell; 2008 Jan; 30(1):62-75. PubMed ID: 18000325
[TBL] [Abstract][Full Text] [Related]
13. 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]
14. A genetic graph-based approach for partitional clustering.
Menéndez HD; Barrero DF; Camacho D
Int J Neural Syst; 2014 May; 24(3):1430008. PubMed ID: 24552507
[TBL] [Abstract][Full Text] [Related]
15. Exploring complex networks via topological embedding on surfaces.
Aste T; Gramatica R; Di Matteo T
Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Sep; 86(3 Pt 2):036109. PubMed ID: 23030982
[TBL] [Abstract][Full Text] [Related]
16. A clustering-based graph Laplacian framework for value function approximation in reinforcement learning.
Xu X; Huang Z; Graves D; Pedrycz W
IEEE Trans Cybern; 2014 Dec; 44(12):2613-25. PubMed ID: 24802018
[TBL] [Abstract][Full Text] [Related]
17. General optimization technique for high-quality community detection in complex networks.
Sobolevsky S; Campari R; Belyi A; Ratti C
Phys Rev E Stat Nonlin Soft Matter Phys; 2014 Jul; 90(1):012811. PubMed ID: 25122346
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. Graph Learning for Multiview Clustering.
Kun Zhan ; Changqing Zhang ; Junpeng Guan ; Junsheng Wang
IEEE Trans Cybern; 2018 Oct; 48(10):2887-2895. PubMed ID: 28961135
[TBL] [Abstract][Full Text] [Related]
20. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
Guturu P; Dantu R
IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
