메뉴 건너뛰기




Volumn , Issue , 2013, Pages 767-783

Finding endogenously formed communities

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; POLYNOMIAL APPROXIMATION; STOCHASTIC SYSTEMS;

EID: 84876055402     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973105.55     Document Type: Conference Paper
Times cited : (22)

References (29)
  • 1
    • 84876019623 scopus 로고    scopus 로고
    • Low-distortion inference of latent similarities from a multiplex social network
    • Ittai Abraham, Shiri Chechik, David Kempe, and Aleksandrs Slivkins. Low-distortion inference of latent similarities from a multiplex social network. In SODA, 2013.
    • (2013) SODA
    • Abraham, I.1    Chechik, S.2    Kempe, D.3    Slivkins, A.4
  • 13
    • 0036497195 scopus 로고    scopus 로고
    • Self-organization of the web and identification of communities
    • G. Flake, S. Lawrence, C. Giles, and F. Coetzee. Self-organization of the web and identification of communities. IEEE Computer, 2002.
    • (2002) IEEE Computer
    • Flake, G.1    Lawrence, S.2    Giles, C.3    Coetzee, F.4
  • 19
    • 84867456818 scopus 로고    scopus 로고
    • Structure and dynamics of information in networks
    • D. Kempe. Structure and dynamics of information in networks. Lecture Notes, 2011.
    • (2011) Lecture Notes
    • Kempe, D.1
  • 20
    • 84924178998 scopus 로고    scopus 로고
    • Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters
    • J. Leskovec, K. Lang, A. Dasgupta, and M. Mahoney. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, 2009.
    • (2009) Internet Mathematics
    • Leskovec, J.1    Lang, K.2    Dasgupta, A.3    Mahoney, M.4
  • 28
    • 70350679590 scopus 로고    scopus 로고
    • A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning
    • abs/0809.3232, Available at Submitted to SICOMP
    • D. A. Spielman and S.-H. Teng. A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning. CoRR, abs/0809.3232, 2008. Available at http://arxiv.org/abs/0809.3232. Submitted to SICOMP.
    • (2008) CoRR
    • Spielman, D.A.1    Teng, S.-H.2


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