Reducing Million-Node Graphs to a Few Structural Patterns : A Unified Approach
暂无分享,去创建一个
Neil Shah | Tara Safavi | Neil Shah | Tara Safavi | Yike Liu | Yike Liu
[1] Danai Koutra,et al. TimeCrunch: Interpretable Dynamic Graph Summarization , 2015, KDD.
[2] Jon M. Kleinberg,et al. Group formation in large social networks: membership, growth, and evolution , 2006, KDD '06.
[3] Dimitrios M. Thilikos,et al. Evaluating Cooperation in Communities with the k-Core Structure , 2011, 2011 International Conference on Advances in Social Networks Analysis and Mining.
[4] Jignesh M. Patel,et al. Big data and its technical challenges , 2014, CACM.
[5] Christos Faloutsos,et al. Fully automatic cross-associations , 2004, KDD.
[6] Hong Cheng,et al. Graph Clustering Based on Structural/Attribute Similarities , 2009, Proc. VLDB Endow..
[7] J. Rissanen. A UNIVERSAL PRIOR FOR INTEGERS AND ESTIMATION BY MINIMUM DESCRIPTION LENGTH , 1983 .
[8] Danai Koutra,et al. Summarizing and understanding large graphs , 2015, Stat. Anal. Data Min..
[9] M E J Newman,et al. Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.
[10] Gerhard Weikum,et al. A Fresh Look on Knowledge Bases: Distilling Named Events from News , 2014, CIKM.
[11] Jure Leskovec,et al. Overlapping community detection at scale: a nonnegative matrix factorization approach , 2013, WSDM.
[12] Jure Leskovec,et al. Empirical comparison of algorithms for network community detection , 2010, WWW '10.
[13] Santo Fortunato,et al. Community detection in graphs , 2009, ArXiv.
[14] Nisheeth Shrivastava,et al. Graph summarization with bounded error , 2008, SIGMOD Conference.
[15] Christos Faloutsos,et al. Fast and reliable anomaly detection in categorical data , 2012, CIKM.
[16] G. Karypis,et al. Multilevel k-way hypergraph partitioning , 1999, Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361).
[17] Arne Koopman. Characteristic relational patterns , 2009, KDD.
[18] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[19] Christos Faloutsos,et al. On data mining, compression, and Kolmogorov complexity , 2007, Data Mining and Knowledge Discovery.
[20] Silvio Lattanzi,et al. On compressing social networks , 2009, KDD.
[21] Jean-Loup Guillaume,et al. Fast unfolding of communities in large networks , 2008, 0803.0476.
[22] Stephen P. Borgatti,et al. Special issue on blockmodels: Introduction , 1992 .
[23] P. Hespanha,et al. An Efficient MATLAB Algorithm for Graph Partitioning , 2006 .
[24] Danai Koutra,et al. VOG: Summarizing and Understanding Large Graphs , 2014, SDM.
[25] Christos Faloutsos,et al. Beyond 'Caveman Communities': Hubs and Spokes for Graph Compression and Mining , 2011, 2011 IEEE 11th International Conference on Data Mining.
[26] Hong Cheng,et al. A model-based approach to attributed graph clustering , 2012, SIGMOD Conference.
[27] Lawrence B. Holder,et al. Substructure Discovery Using Minimum Description Length and Background Knowledge , 1993, J. Artif. Intell. Res..
[28] Christos Faloutsos,et al. Beyond Blocks: Hyperbolic Community Detection , 2014, ECML/PKDD.
[29] Ravi Kumar,et al. Preferential behavior in online groups , 2008, WSDM '08.
[30] J. Rissanen,et al. Modeling By Shortest Data Description* , 1978, Autom..
[31] Ming Li,et al. Clustering by compression , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..