메뉴 건너뛰기




Volumn , Issue , 2013, Pages 899-905

Do more views of a graph help? Community detection and clustering in multi-graphs

Author keywords

[No Author keywords available]

Indexed keywords

CITATION NETWORKS; CLUSTERING ACCURACY; CLUSTERING TECHNIQUES; COLLABORATION NETWORK; COMMUNITY DETECTION; MINIMUM DESCRIPTION LENGTH; SYNTHETIC NETWORKS; SYSTEMATIC ANALYSIS;

EID: 84890850521     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (111)

References (23)
  • 1
  • 2
    • 84880243365 scopus 로고    scopus 로고
    • PICS: Parameter-free identification of cohesive subgroups in large attributed graphs
    • Leman Akoglu, Hanghang Tong, Brendan Meeder, and Christos Faloutsos. PICS: Parameter-free identification of cohesive subgroups in large attributed graphs. In SDM, pages 439-450, 2012.
    • (2012) SDM , pp. 439-450
    • Akoglu, L.1    Tong, H.2    Meeder, B.3    Faloutsos, C.4
  • 3
    • 83055179251 scopus 로고    scopus 로고
    • Finding redundant and complementary communities in multidimensional networks
    • Michele Berlingerio, Michele Coscia, and Fosca Giannotti. Finding redundant and complementary communities in multidimensional networks. In CIKM, 2011.
    • (2011) CIKM
    • Berlingerio, M.1    Coscia, M.2    Giannotti, F.3
  • 4
    • 85015181945 scopus 로고    scopus 로고
    • Mining coherent subgraphs in multi-layer graphs with edge labels
    • Brigitte Boden, Stephan Giinnemann, Holger Hoffmann, and Thomas SeidL Mining coherent subgraphs in multi-layer graphs with edge labels. In KDD, 2012.
    • (2012) KDD
    • Boden, B.1    Giinnemann, S.2    Hoffmann, H.3    Seidl, T.4
  • 5
    • 34548571606 scopus 로고    scopus 로고
    • Autopart: Parameter-free graph partitioning and outlier detection
    • Deepayan Chakrabarti. Autopart: Parameter-free graph partitioning and outlier detection. In PKDD, pages 112-124, 2004.
    • (2004) PKDD , pp. 112-124
    • Chakrabarti, D.1
  • 6
    • 0035580899 scopus 로고    scopus 로고
    • Algorithms for graph partitioning on the planted partition modeL Random Struct
    • Anne Condon and Richard M. Karp. Algorithms for graph partitioning on the planted partition modeL Random Struct. Algorithms, 18(2):116-140, 2001.
    • (2001) Algorithms , vol.18 , Issue.2 , pp. 116-140
    • Condon, A.1    Karp, R.M.2
  • 7
    • 70349313631 scopus 로고    scopus 로고
    • Inferring friendship network structure by using mobile phone data
    • N. Eagle, A.S. Pentland, and D. Lazer. Inferring friendship network structure by using mobile phone data. PNAS, 106(36):15274-15278 2009.
    • (2009) PNAS , vol.106 , Issue.36 , pp. 15274-15278
    • Eagle, N.1    Pentland, A.S.2    Lazer, D.3
  • 8
    • 0002740437 scopus 로고
    • Foundations of the PARAFAC procedure: Models and conditions for an" explanatory" multimodal factor analysis
    • R.A. Harshman. Foundations of the PARAFAC procedure: Models and conditions for an" explanatory" multimodal factor analysis. UCLA Working Papers in Phonetics, 16:1-84, 1970.
    • (1970) UCLA Working Papers in Phonetics , vol.16 , pp. 1-84
    • Harshman, R.A.1
  • 9
    • 78651332330 scopus 로고    scopus 로고
    • Shrink: A structural clustering algorithm for detecting hierarchical communities in networks
    • Jianbin Huang, Heli Sun, liawei Han, Hongbo Deng, Yizhou Sun, and Yaguang Liu. Shrink: a structural clustering algorithm for detecting hierarchical communities in networks. In CIKM, pages 219-228, 2010.
    • (2010) CIKM , pp. 219-228
    • Huang, J.1    Sun, H.2    Han, L.3    Deng, H.4    Sun, Y.5    Liu, Y.6
  • 10
    • 68649096448 scopus 로고    scopus 로고
    • Tensor decompositions and applications
    • T.G. Kolda and B.W. Bader. Tensor decompositions and applications. SIAM review, 51(3), 2009.
    • (2009) SIAM Review , vol.51 , Issue.3
    • Kolda, T.G.1    Bader, B.W.2
  • 13
    • 80051642158 scopus 로고    scopus 로고
    • Co-clustering as multilinear decomposition with sparse latent factors
    • E.E. Papalexakis and N.D. Sidiropoulos. Co-clustering as multilinear decomposition with sparse latent factors. In IEEE ICASSP, pages 2064-2067, 2011.
    • (2011) IEEE ICASSP , pp. 2064-2067
    • Papalexakis, E.E.1    Sidiropoulos, N.D.2
  • 14
    • 0001098776 scopus 로고
    • A universal prior for integers and estimation by minimum description length
    • J. Rissanen. A universal prior for integers and estimation by minimum description length. The Annals of Statistics, 11(2):416-431, 1983.
    • (1983) The Annals of Statistics , vol.11 , Issue.2 , pp. 416-431
    • Rissanen, J.1
  • 15
    • 79958227880 scopus 로고    scopus 로고
    • Latent clustering on graphs with multiple edge types
    • Matthew Rocklin and Ali Pinar. Latent clustering on graphs with multiple edge types. In WAW, pages 38-49, 2011.
    • (2011) WAW , pp. 38-49
    • Rocklin, M.1    Pinar, A.2
  • 16
    • 84857739219 scopus 로고    scopus 로고
    • A variational bayesian framework for clustering with multiple graphs
    • Motoki Shiga and Hiroshi Mamitsuka. A variational bayesian framework for clustering with multiple graphs. IEEE Trans. Know!. Data Eng., 24(4): 577-590, 2012.
    • (2012) IEEE Trans. Know!. Data Eng , vol.24 , Issue.4 , pp. 577-590
    • Shiga, M.1    Mamitsuka, H.2
  • 17
    • 36849035825 scopus 로고    scopus 로고
    • Graphscope: Parameter-free mining of large time-evolving graphs
    • Jimeng Sun, Christos Faloutsos, Spiros Papadimitriou, and Philip S. Yu. Graphscope: parameter-free mining of large time-evolving graphs. In KDD, 2007.
    • (2007) KDD
    • Sun, J.1    Faloutsos, C.2    Papadimitriou, S.3    Yu, P.S.4
  • 18
    • 84859527663 scopus 로고    scopus 로고
    • Community detection via heterogeneous interaction analysis. Data Min
    • Lei Tang, Xufei Wang, and Huan Liu.community detection via heterogeneous interaction analysis. Data Min. Know!. Discov., 25(1):1-33, 2012.
    • (2012) Know!. Discov , vol.25 , Issue.1 , pp. 1-33
    • Tang, L.1    Wang, X.2    Liu, H.3
  • 19
    • 77951203344 scopus 로고    scopus 로고
    • Clustering with multiple graphs
    • Wei Tang, Zhengdong Lu, and Inderjit S. Dhillon. Clustering with multiple graphs. In ICDM, pages 1016-1021, 2009.
    • (2009) ICDM , pp. 1016-1021
    • Tang, W.1    Lu, Z.2    Dhillon, I.S.3
  • 20
    • 34548583274 scopus 로고    scopus 로고
    • A tutorial on spectral clustering
    • Ulrike von Luxburg. A tutorial on spectral clustering. Statistics and Computing, 17(4):395-416, 2007.
    • (2007) Statistics and Computing , vol.17 , Issue.4 , pp. 395-416
    • Von Luxburg, U.1
  • 21
    • 36949010345 scopus 로고    scopus 로고
    • Schweiger Scan: A structural clustering algorithm for networks
    • Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, and Thomas A. J. Schweiger. Scan: a structural clustering algorithm for networks. In KDD, pages 824-833, 2007.
    • (2007) KDD , pp. 824-833
    • Xu, X.1    Yuruk, N.2    Feng, Z.3    Thomas, A.J.4
  • 22
    • 84862690118 scopus 로고    scopus 로고
    • A model-based approach to attributed graph clustering
    • Zhiqiang Xu, Yiping Ke, Yi Wang, Hong Cheng, and James Cheng. A model-based approach to attributed graph clustering. In SIGMOD pages 505-516, 2012.
    • (2012) SIGMOD , pp. 505-516
    • Xu, Z.1    Ke, Y.2    Wang, Y.3    Cheng, H.4    Cheng, J.5
  • 23
    • 34547970997 scopus 로고    scopus 로고
    • Spectral clustering and transductive learning with multiple views
    • Dengyong Zhou and Christopher J. C. Burges. Spectral clustering and transductive learning with multiple views. In ICML, pages 1159-1166 2007.
    • (2007) ICML , pp. 1159-1166
    • Zhou, D.1    Burges, C.C.J.2


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