메뉴 건너뛰기




Volumn 4, Issue 6, 2010, Pages

A search algorithm for clusters in a network or graph

Author keywords

Clustering; Complex networks; Modularity

Indexed keywords

BIOLOGICAL NETWORKS; BREADTH-FIRST; CLUSTERING; COMPLEX NETWORKS; DENDROGRAMS; HIERARCHICAL CLUSTERS; INPUT PARAMETER; MODULARITY; NON-PARAMETRIC ALGORITHM; OTHER ALGORITHMS; RUNNING TIME; SCALE FREE NETWORKS; SEARCH ALGORITHMS; SOCIAL NETWORKS; STRUCTURAL CLUSTERING;

EID: 78651548728     PISSN: 19759339     EISSN: None     Source Type: Journal    
DOI: 10.4156/jdcta.vol4.issue6.14     Document Type: Article
Times cited : (14)

References (14)
  • 1
    • 23844541694 scopus 로고    scopus 로고
    • Unsupervised learning of natural languages
    • Zach Solan, David Horn, Eytan Ruppin, Shimon Edelman, "Unsupervised learning of natural languages", PNAS, vol. 102, no.33, pp. 11629-11634, 2005.
    • (2005) PNAS , vol.102 , Issue.33 , pp. 11629-11634
    • Solan, Z.1    Horn, D.2    Ruppin, E.3    Edelman, S.4
  • 3
    • 85170282443 scopus 로고    scopus 로고
    • A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise
    • M. Ester, H.-P. Kriegel, J. Sander, X. Xu, "A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise", In Proceeding Of KDD, pp.226-231, 1996.
    • (1996) In Proceeding of KDD , pp. 226-231
    • Ester, M.1    Kriegel, H.-P.2    Sander, J.3    Xu, X.4
  • 4
    • 78149301227 scopus 로고    scopus 로고
    • A min-max cut algorithm for graph partitioning and data clustering
    • C. Ding, X. He, H. Zha, M. Gu, H. Simon, "A min-max cut algorithm for graph partitioning and data clustering", In Proceeding of ICDM 2001.
    • (2001) In Proceeding of ICDM
    • Ding, C.1    He, X.2    Zha, H.3    Gu, M.4    Simon, H.5
  • 6
    • 37649028224 scopus 로고    scopus 로고
    • Finding and evaluating community structure in networks
    • 026113
    • M. E. J. Newman, M. Girvan, "Finding and evaluating community structure in networks", Phys. Rev. E 69, 026113, 2004.
    • (2004) Phys. Rev. E , pp. 69
    • Newman, M.E.J.1    Girvan, M.2
  • 7
    • 33745012299 scopus 로고    scopus 로고
    • Modularity and community structure in networks
    • M. E. J. Newman, "Modularity and community structure in networks", PNAS, vol. 103, no. 23, pp. 8578-8582, 2006.
    • (2006) PNAS , vol.103 , Issue.23 , pp. 8578-8582
    • Newman, M.E.J.1
  • 8
    • 41349117788 scopus 로고    scopus 로고
    • Finding community structure in very large networks
    • 066111
    • A. Clauset, M. E. J. Newman, C. Moore, "Finding community structure in very large networks", Physical Review E 70, 066111, 2004.
    • (2004) Physical Review E , pp. 70
    • Clauset, A.1    Newman, M.E.J.2    Moore, C.3
  • 9
    • 14644396645 scopus 로고    scopus 로고
    • Functional cartography of complex metabolic networks
    • R. Guimera, L. A. N. Amaral, "Functional cartography of complex metabolic networks", Nature, vol. 433, pp.895-900, 2005.
    • (2005) Nature , vol.433 , pp. 895-900
    • Guimera, R.1    Amaral, L.A.N.2
  • 10
    • 33846126275 scopus 로고    scopus 로고
    • Resolution limit in community detection
    • Santo Fortunato, Marc Barthelemy, "Resolution limit in community detection", PNAS, vol. 104, no.1, pp.36-41, 2007.
    • (2007) PNAS , vol.104 , Issue.1 , pp. 36-41
    • Fortunato, S.1    Barthelemy, M.2
  • 11
    • 0038483826 scopus 로고    scopus 로고
    • Emergence of scaling in random networks
    • A.L. Barabasi, R. Albert, "Emergence of scaling in random networks", Science, vol. 286, pp.509-512, 1999.
    • (1999) Science , vol.286 , pp. 509-512
    • Barabasi, A.L.1    Albert, R.2
  • 14
    • 78651562064 scopus 로고    scopus 로고
    • http://cs.unm.edu/~aaron/research/fastmodularity.htm.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.