메뉴 건너뛰기




Volumn 26, Issue 12, 2014, Pages 3077-3089

SlashBurn: Graph compression and mining beyond caveman communities

Author keywords

Graph compression; graph mining; hubs and spokes

Indexed keywords

GRAPH COMPRESSIONS; GRAPH MINING; HUBS AND SPOKES;

EID: 84910103691     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2014.2320716     Document Type: Article
Times cited : (136)

References (39)
  • 2
    • 84866450568 scopus 로고    scopus 로고
    • GBASE: An efficient analysis platform for large graphs
    • U. Kang, H. Tong, J. Sun, C.-Y. Lin, and C. Faloutsos, "GBASE: An efficient analysis platform for large graphs," VLDB J., vol. 21, no. 5, pp. 637-650, 2012.
    • (2012) VLDB J. , vol.21 , Issue.5 , pp. 637-650
    • Kang, U.1    Tong, H.2    Sun, J.3    Lin, C.-Y.4    Faloutsos, C.5
  • 12
    • 0018442815 scopus 로고
    • Arithmetic coding
    • J. Rissanen and G. G. L. Jr, "Arithmetic coding," IBM J. Res. Develop., vol. 23, no. 2, pp. 149-162, 1979.
    • (1979) IBM J. Res. Develop , vol.23 , Issue.2 , pp. 149-162
    • Rissanen, J.1
  • 13
    • 33746192198 scopus 로고    scopus 로고
    • A graph-theoretic perspective on centrality
    • S. P. Borgatti and M. G. Everett, "A graph-theoretic perspective on centrality," Soc. Netw., vol. 28, pp. 466-484, 2006.
    • (2006) Soc. Netw. , vol.28 , pp. 466-484
    • Borgatti, S.P.1    Everett, M.G.2
  • 16
    • 0037058980 scopus 로고    scopus 로고
    • The average distances in random graphs with given expected degrees
    • F. Chung and L. Lu, "The average distances in random graphs with given expected degrees," Proc. Nat. Acad. Sci USA, vol. 99, no. 25, pp. 15879-15882, 2002.
    • (2002) Proc. Nat. Acad. Sci USA , vol.99 , Issue.25 , pp. 15879-15882
    • Chung, F.1    Lu, L.2
  • 17
    • 19944376183 scopus 로고    scopus 로고
    • The webgraph framework I: Compression techniques
    • P. Boldi and S. Vigna, "The webgraph framework I: Compression techniques," in Proc. 13th Int. Conf. WorldWideWeb, 2004, pp. 595-602.
    • (2004) Proc. 13th Int. Conf. WorldWideWeb , pp. 595-602
    • Boldi, P.1    Vigna, S.2
  • 19
    • 0038763983 scopus 로고    scopus 로고
    • Connected components in randomgraphs with given degree sequences
    • F. Chung and L. Lu, "Connected components in randomgraphs with given degree sequences," Ann. Combinatorics, vol. 6, pp. 125-145, 2002.
    • (2002) Ann. Combinatorics , vol.6 , pp. 125-145
    • Chung, F.1    Lu, L.2
  • 20
    • 0034721164 scopus 로고    scopus 로고
    • Error and attack tolerance of complex networks
    • R. Albert, H. Jeong, and A.-L. Barabasi, "Error and attack tolerance of complex networks," Nature, vol. 406, pp. 378-382, 2000.
    • (2000) Nature , vol.406 , pp. 378-382
    • Albert, R.1    Jeong, H.2    Barabasi, A.-L.3
  • 21
    • 0035896667 scopus 로고    scopus 로고
    • Breakdown of the internet under intentional attack
    • Apr.
    • R. Cohen, K. Erez, D. ben Avraham, and S. Havlin, "Breakdown of the internet under intentional attack," Phys. Rev. Lett., vol. 86, pp. 3682-3685, Apr. 2001.
    • (2001) Phys. Rev. Lett. , vol.86 , pp. 3682-3685
    • Cohen, R.1    Erez, K.2    Ben Avraham, D.3    Havlin, S.4
  • 22
    • 41349120887 scopus 로고    scopus 로고
    • Attack vulnerability of complex networks
    • May
    • P.Holme, B. J.Kim,C.N.Yoon, and S.K.Han,"Attack vulnerability of complex networks," Phys. Rev. E, vol. 65, no. 5, p. 056109,May 2002.
    • (2002) Phys. Rev. e , vol.65 , Issue.5
    • Holme, P.1    Kim, B.J.2    Yoon, C.N.3    Han, S.K.4
  • 27
    • 0037062448 scopus 로고    scopus 로고
    • Community structure in social and biological networks
    • M. Girvan and M. Newman, "Community structure in social and biological networks," Proc.Nat. Acad.SciUSA, vol. 99, pp. 7821-7826, 2002.
    • (2002) Proc. Nat. Acad. Sci USA , vol.99 , pp. 7821-7826
    • Girvan, M.1    Newman, M.2
  • 31
    • 77956196952 scopus 로고    scopus 로고
    • Graph compression by BFS
    • A. Apostolico and G. Drovandi, "Graph compression by BFS," Algorithms, vol. 2, no. 3, pp. 1031-1044, 2009.
    • (2009) Algorithms , vol.2 , Issue.3 , pp. 1031-1044
    • Apostolico, A.1    Drovandi, G.2
  • 34
    • 84857180154 scopus 로고    scopus 로고
    • Beyond ?caveman communities': Hubs and spokes for graph compression and mining
    • U. Kang and C. Faloutsos, "Beyond ?caveman communities': Hubs and spokes for graph compression and mining," in Proc. IEEE 11th Int. Conf. Data Mining, 2011, pp. 300-309.
    • (2011) Proc. IEEE 11th Int. Conf. Data Mining , pp. 300-309
    • Kang, U.1    Faloutsos, C.2
  • 38
    • 77954604765 scopus 로고    scopus 로고
    • Distributed nonnegative matrix factorization for web-scale dyadic data analysis on MapReduce
    • C. Liu, H. chih Yang, J. Fan, L.-W. He, and Y.-M. Wang, "Distributed nonnegative matrix factorization for web-scale dyadic data analysis on MapReduce," in Proc. 19th Int. Conf. World Wide Web, 2010, pp. 681-690.
    • (2010) Proc. 19th Int. Conf. World Wide Web , pp. 681-690
    • Liu, C.1    Chih Yang, H.2    Fan, J.3    He, L.-W.4    Wang, Y.-M.5
  • 39
    • 33749652149 scopus 로고    scopus 로고
    • Jellyfish: A conceptual model for the as internet topology
    • G. Siganos, S. L. Tauro, and M. Faloutsos, "Jellyfish: A conceptual model for the as internet topology," J. Commun. Netw., vol. 8, pp. 339-350, 2006.
    • (2006) J. Commun. Netw. , vol.8 , pp. 339-350
    • Siganos, G.1    Tauro, S.L.2    Faloutsos, M.3


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