暂无分享,去创建一个
[1] Ying Xuan,et al. Modularity-Maximizing Graph Communities via Mathematical Programming , 2009 .
[2] Ali S. Hadi,et al. Finding Groups in Data: An Introduction to Chster Analysis , 1991 .
[3] Thomas Hofmann,et al. Support vector machine learning for interdependent and structured output spaces , 2004, ICML.
[4] J. Reichardt,et al. Statistical mechanics of community detection. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.
[5] Sergiy Butenko,et al. Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem , 2011, Oper. Res..
[6] David D. Jensen,et al. Finding tribes: identifying close-knit individuals from employment patterns , 2007, KDD '07.
[7] Gueorgi Kossinets,et al. Empirical Analysis of an Evolving Social Network , 2006, Science.
[8] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[9] Fang Wu,et al. Finding communities in linear time: a physics approach , 2003, ArXiv.
[10] Kazuo Iwama,et al. Linear-Time Enumeration of Isolated Cliques , 2005, ESA.
[11] Chong-sun Kim. Canonical Analysis of Several Sets of Variables , 1973 .
[12] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[13] Tamara G. Kolda,et al. Scalable Tensor Decompositions for Multi-aspect Data Mining , 2008, 2008 Eighth IEEE International Conference on Data Mining.
[14] Inderjit S. Dhillon,et al. Minimum Sum-Squared Residue Co-Clustering of Gene Expression Data , 2004, SDM.
[15] S. vanDongen. Graph Clustering by Flow Simulation , 2000 .
[16] Philip S. Yu,et al. Unsupervised learning on k-partite graphs , 2006, KDD '06.
[17] Charu C. Aggarwal,et al. Graph Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.
[18] E A Leicht,et al. Community structure in directed networks. , 2007, Physical review letters.
[19] Laks V. S. Lakshmanan,et al. GuruMine: A Pattern Mining System for Discovering Leaders and Tribes , 2009, 2009 IEEE 25th International Conference on Data Engineering.
[20] E A Leicht,et al. Mixture models and exploratory analysis in networks , 2006, Proceedings of the National Academy of Sciences.
[21] Tanya Y. Berger-Wolf,et al. A framework for analysis of dynamic social networks , 2006, KDD '06.
[22] J. Navarro-Pedreño. Numerical Methods for Least Squares Problems , 1996 .
[23] M. Newman,et al. Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[24] V. Traag,et al. Community detection in networks with positive and negative links. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.
[25] F. Harary,et al. The cohesiveness of blocks in social networks: Node connectivity and conditional density , 2001 .
[26] Yun Chi,et al. Facetnet: a framework for analyzing communities and their evolutions in dynamic networks , 2008, WWW.
[27] S. Fortunato,et al. Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.
[28] Christos Faloutsos,et al. HCDF: A Hybrid Community Discovery Framework , 2010, SDM.
[29] Joost N. Kok,et al. A quickstart in frequent structure mining can make a difference , 2004, KDD.
[30] Satu Elisa Schaeffer,et al. Stochastic Local Clustering for Massive Graphs , 2005, PAKDD.
[31] J. Rissanen,et al. Modeling By Shortest Data Description* , 1978, Autom..
[32] Alex Pothen,et al. PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .
[33] Anna Monreale,et al. Foundations of Multidimensional Network Analysis , 2011, 2011 International Conference on Advances in Social Networks Analysis and Mining.
[34] Huan Liu,et al. Uncoverning Groups via Heterogeneous Interaction Analysis , 2009, 2009 Ninth IEEE International Conference on Data Mining.
[35] Tie-Yan Liu,et al. Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering , 2005, KDD '05.
[36] Wei Chen,et al. Efficient influence maximization in social networks , 2009, KDD.
[37] Inderjit S. Dhillon,et al. Clustering with Bregman Divergences , 2005, J. Mach. Learn. Res..
[38] Michael Szell,et al. Multirelational organization of large-scale social networks in an online world , 2010, Proceedings of the National Academy of Sciences.
[39] Michael I. Jordan,et al. Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..
[40] Philip S. Yu,et al. Hierarchical, Parameter-Free Community Discovery , 2008, ECML/PKDD.
[41] C. Bron,et al. Algorithm 457: finding all cliques of an undirected graph , 1973 .
[42] Stephen E. Fienberg,et al. Bayesian Mixed Membership Models for Soft Clustering and Classification , 2004, GfKl.
[43] Tina Eliassi-Rad,et al. Applying latent dirichlet allocation to group discovery in large graphs , 2009, SAC '09.
[44] Leonard M. Freeman,et al. A set of measures of centrality based upon betweenness , 1977 .
[45] Laks V. S. Lakshmanan,et al. Discovering leaders from community actions , 2008, CIKM '08.
[46] Huan Liu,et al. Uncovering cross-dimension group structures in multi-dimensional networks , 2009, SDM 2009.
[47] Dino Pedreschi,et al. ExAMiner: optimized level-wise frequent pattern mining with monotone constraints , 2003, Third IEEE International Conference on Data Mining.
[48] Jure Leskovec,et al. Empirical comparison of algorithms for network community detection , 2010, WWW '10.
[49] Thomas Hofmann,et al. A Collapsed Variational Bayesian Inference Algorithm for Latent Dirichlet Allocation , 2007 .
[50] Chen Wang,et al. Detecting Overlapping Community Structures in Networks with Global Partition and Local Expansion , 2008, APWeb.
[51] Cristopher Moore,et al. Phase transition in the detection of modules in sparse networks , 2011, Physical review letters.
[52] Stefan Boettcher,et al. Optimization with extremal dynamics , 2003, Complex..
[53] Philip S. Yu,et al. A Framework for Clustering Evolving Data Streams , 2003, VLDB.
[54] Tamara G. Kolda,et al. Temporal Analysis of Semantic Graphs Using ASALSAN , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).
[55] Mark E. J. Newman,et al. The Structure and Function of Complex Networks , 2003, SIAM Rev..
[56] T. Vicsek,et al. Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.
[57] Gene H. Golub,et al. Matrix computations , 1983 .
[58] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[59] Kazuo Iwama,et al. Enumeration of isolated cliques and pseudo-cliques , 2009, TALG.
[60] Inderjit S. Dhillon,et al. Information-theoretic co-clustering , 2003, KDD '03.
[61] J. Pitman. Combinatorial Stochastic Processes , 2006 .
[62] M E J Newman,et al. Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.
[63] Tanya Y. Berger-Wolf,et al. Constant-factor approximation algorithms for identifying dynamic communities , 2009, KDD.
[64] Christos Faloutsos,et al. Fully automatic cross-associations , 2004, KDD.
[65] Alain Pirotte,et al. A novel way of computing dissimilarities between nodes of a graph , 2004 .
[66] Christian Komusiewicz,et al. Isolation concepts for efficiently enumerating dense subgraphs , 2009, Theor. Comput. Sci..
[67] M. McPherson,et al. Birds of a Feather: Homophily in Social Networks , 2001 .
[68] Tom Minka,et al. Expectation-Propogation for the Generative Aspect Model , 2002, UAI.
[69] Sebastiano Vigna,et al. A large time-aware web graph , 2008, SIGF.
[70] Philip S. Yu,et al. A Framework for Projected Clustering of High Dimensional Data Streams , 2004, VLDB.
[71] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[72] Reinhard Lipowsky,et al. Network Brownian Motion: A New Method to Measure Vertex-Vertex Proximity and to Identify Communities and Subcommunities , 2004, International Conference on Computational Science.
[73] Tanya Y. Berger-Wolf,et al. A framework for community identification in dynamic social networks , 2007, KDD '07.
[74] Dimitrios M. Thilikos,et al. Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover , 2001, Discret. Appl. Math..
[75] Massimo Marchiori,et al. Method to find community structures based on information centrality. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[76] Claudio Castellano,et al. Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[77] Deepayan Chakrabarti,et al. AutoPart: Parameter-Free Graph Partitioning and Outlier Detection , 2004, PKDD.
[78] M. Newman,et al. Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.
[79] Douglas H. Fisher,et al. Knowledge Acquisition Via Incremental Conceptual Clustering , 1987, Machine Learning.
[80] A. Clauset. Finding local community structure in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.
[81] C. Lee Giles,et al. Self-Organization and Identification of Web Communities , 2002, Computer.
[82] M E J Newman,et al. Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[83] Kazumi Saito,et al. Extracting Communities from Complex Networks by the k-Dense Method , 2008, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..
[84] Christos Faloutsos,et al. Monitoring Network Evolution using MDL , 2008, 2008 IEEE 24th International Conference on Data Engineering.
[85] Jure Leskovec,et al. The dynamics of viral marketing , 2005, EC '06.
[86] Martin G. Everett,et al. Graph colorings and power in experimental exchange networks , 1992 .
[87] M. Newman,et al. Hierarchical structure and the prediction of missing links in networks , 2008, Nature.
[88] I Vragović,et al. Network community structure and loop coefficient method. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.
[89] Jiawei Han,et al. A Particle-and-Density Based Evolutionary Clustering Method for Dynamic Networks , 2009, Proc. VLDB Endow..
[90] Steve Gregory,et al. A Fast Algorithm to Find Overlapping Communities in Networks , 2008, ECML/PKDD.
[91] Yi Zhang,et al. Probabilistic polyadic factorization and its application to personalized recommendation , 2008, CIKM '08.
[92] Vladimir Batagelj,et al. Generalized blockmodeling , 2005, Structural analysis in the social sciences.
[93] M. Narasimhan. Principles of Continuum Mechanics , 1992 .
[94] Huan Liu,et al. Relational learning via latent social dimensions , 2009, KDD.
[95] Ken Wakita,et al. Finding community structure in mega-scale social networks: [extended abstract] , 2007, WWW '07.
[96] Philip S. Yu,et al. Spectral clustering for multi-type relational data , 2006, ICML.
[97] Amy Nicole Langville,et al. A Kronecker product approximate preconditioner for SANs , 2004, Numer. Linear Algebra Appl..
[98] M E J Newman,et al. Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[99] Philip S. Yu,et al. GraphScope: parameter-free mining of large time-evolving graphs , 2007, KDD '07.
[100] Thomas L. Griffiths,et al. Learning Systems of Concepts with an Infinite Relational Model , 2006, AAAI.
[101] Shang-Hua Teng,et al. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems , 2003, STOC '04.
[102] A. Arenas,et al. Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.
[103] Stefano Lonardi,et al. A parallel edge-betweenness clustering tool for Protein-Protein Interaction networks , 2007, Int. J. Data Min. Bioinform..
[104] L. K. Hansen,et al. Learning latent structure in complex networks , 2009 .
[105] R. Lambiotte,et al. Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks , 2008, IEEE Transactions on Network Science and Engineering.
[106] Hisashi Koga,et al. Fast agglomerative hierarchical clustering algorithm using Locality-Sensitive Hashing , 2007, Knowledge and Information Systems.
[107] Peter D. Hoff,et al. Latent Space Approaches to Social Network Analysis , 2002 .
[108] John Scott. Social Network Analysis , 1988 .
[109] Jimeng Sun,et al. Beyond streams and graphs: dynamic tensor analysis , 2006, KDD '06.
[110] Andrea Lancichinetti,et al. Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.
[111] M. Barber. Modularity and community detection in bipartite networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.
[112] E. Ziv,et al. Information-theoretic approach to network modularity. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[113] Mason A. Porter,et al. Communities in Networks , 2009, ArXiv.
[114] Michael I. Jordan,et al. An Introduction to Variational Methods for Graphical Models , 1999, Machine-mediated learning.
[115] Sergio Gómez,et al. Size reduction of complex networks preserving modularity , 2007, ArXiv.
[116] Santo Fortunato,et al. Community detection in graphs , 2009, ArXiv.
[117] Christos Faloutsos,et al. Graph mining: Laws, generators, and algorithms , 2006, CSUR.
[118] M. Hastings. Community detection as an inference problem. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.
[119] Réka Albert,et al. Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.
[120] Benjamin H. Good,et al. Performance of modularity maximization in practical contexts. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.
[121] Kathryn B. Laskey,et al. Stochastic blockmodels: First steps , 1983 .
[122] Leon Danon,et al. Comparing community structure identification , 2005, cond-mat/0505245.
[123] Malik Magdon-Ismail,et al. Efficient Identification of Overlapping Communities , 2005, ISI.
[124] Fosca Giannotti,et al. Finding and Characterizing Communities in Multidimensional Networks , 2011, 2011 International Conference on Advances in Social Networks Analysis and Mining.
[125] Satu Elisa Schaeffer,et al. Graph Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.
[126] Inderjit S. Dhillon,et al. A generalized maximum entropy approach to bregman co-clustering and matrix approximation , 2004, J. Mach. Learn. Res..
[127] Steve Gregory,et al. Finding Overlapping Communities Using Disjoint Community Detection Algorithms , 2009, CompleNet.
[128] Tamara G. Kolda,et al. Link Prediction on Evolving Data Using Matrix and Tensor Factorizations , 2009, 2009 IEEE International Conference on Data Mining Workshops.
[129] Pablo Jensen,et al. Analysis of community structure in networks of correlated data. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.
[130] Stanley M. Selkow,et al. Algorithms in a Nutshell , 2008 .
[131] Peter Grünwald,et al. A tutorial introduction to the minimum description length principle , 2004, ArXiv.
[132] V. Carchiolo,et al. Extending the definition of modularity to directed graphs with overlapping communities , 2008, 0801.1647.
[133] Fosca Giannotti,et al. Finding redundant and complementary communities in multidimensional networks , 2011, CIKM '11.
[134] Christos Faloutsos,et al. Parameter-free spatial data mining using MDL , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).
[135] Andreas Krause,et al. Cost-effective outbreak detection in networks , 2007, KDD '07.
[136] Malik Magdon-Ismail,et al. Discovering Hidden Groups in Communication Networks , 2004, ISI.
[137] Yves Gingras,et al. A new approach for detecting scientific specialties from raw cocitation networks , 2009, J. Assoc. Inf. Sci. Technol..
[138] F. Radicchi,et al. Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.
[139] Jon M. Kleinberg,et al. Group formation in large social networks: membership, growth, and evolution , 2006, KDD '06.
[140] Hiroki Arimura,et al. LCM ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining , 2005 .
[141] Rajeev Motwani,et al. The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.
[142] 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.
[143] Roger Guimerà,et al. Cartography of complex networks: modules and universal roles , 2005, Journal of statistical mechanics.
[144] Martin G. Everett,et al. Exact colorations of graphs and digraphs , 1996 .
[145] Mark E. J. Newman,et al. An efficient and principled method for detecting communities in networks , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.
[146] Bak,et al. Punctuated equilibrium and criticality in a simple model of evolution. , 1993, Physical review letters.
[147] Andrea Lancichinetti,et al. Community detection algorithms: a comparative analysis: invited presentation, extended abstract , 2009, VALUETOOLS.
[148] Lei Tang,et al. Large scale multi-label classification via metalabeler , 2009, WWW '09.
[149] Deepayan Chakrabarti,et al. Evolutionary clustering , 2006, KDD '06.
[150] Sune Lehmann,et al. Supplementary Information Link Communities Reveal Multi-Scale Complexity in Networks by , 2010 .
[151] Jukka-Pekka Onnela,et al. Community Structure in Time-Dependent, Multiscale, and Multiplex Networks , 2009, Science.
[152] Arindam Banerjee,et al. Multi-way Clustering on Relation Graphs , 2007, SDM.
[153] Yuchung J. Wang,et al. Stochastic Blockmodels for Directed Graphs , 1987 .
[154] Huan Liu,et al. Scalable learning of collective behavior based on sparse social dimensions , 2009, CIKM.
[155] Jure Leskovec,et al. Predicting positive and negative links in online social networks , 2010, WWW '10.
[156] Huan Liu,et al. Community evolution in dynamic multi-mode networks , 2008, KDD.
[157] R. Guimerà,et al. Functional cartography of complex metabolic networks , 2005, Nature.
[158] Vladimir Batagelj,et al. Generalized Blockmodeling (Structural Analysis in the Social Sciences) , 2004 .
[159] A. Barabasi,et al. Evolution of the social network of scientific collaborations , 2001, cond-mat/0104162.
[160] Arlindo L. Oliveira,et al. Biclustering algorithms for biological data analysis: a survey , 2004, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[161] Steve Gregory,et al. Finding overlapping communities in networks by label propagation , 2009, ArXiv.
[162] George Karypis,et al. Finding Frequent Patterns in a Large Sparse Graph* , 2005, Data Mining and Knowledge Discovery.
[163] Edoardo M. Airoldi,et al. Mixed Membership Stochastic Blockmodels , 2007, NIPS.
[164] Jiawei Han,et al. Community Mining from Multi-relational Networks , 2005, PKDD.
[165] Steve Gregory,et al. An Algorithm to Find Overlapping Community Structure in Networks , 2007, PKDD.
[166] Malik Magdon-Ismail,et al. Finding communities by clustering a graph into overlapping subgraphs , 2005, IADIS AC.
[167] Claudio Castellano,et al. Community Structure in Graphs , 2007, Encyclopedia of Complexity and Systems Science.
[168] Jon M. Kleinberg,et al. An Impossibility Theorem for Clustering , 2002, NIPS.
[169] Trevor Hastie,et al. The Elements of Statistical Learning , 2001 .
[170] Philip S. Yu,et al. Window-based Tensor Analysis on High-dimensional and Multi-aspect Streams , 2006, Sixth International Conference on Data Mining (ICDM'06).
[171] Erik M Bollt,et al. Local method for detecting communities. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.
[172] Matthieu Latapy,et al. Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..
[173] Jean-Loup Guillaume,et al. Fast unfolding of communities in large networks , 2008, 0803.0476.
[174] Mark Newman,et al. Detecting community structure in networks , 2004 .
[175] Lieven De Lathauwer,et al. Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank-$(1,L,L)$ Terms , 2008, IEEE Transactions on Signal Processing.
[176] William A. Wallace,et al. Communication Dynamics of Blog Networks , 2008, SNAKDD.
[177] R. Lambiotte,et al. Line graphs, link partitions, and overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.
[178] Tamara G. Kolda,et al. Tensor Decompositions and Applications , 2009, SIAM Rev..
[179] Jimeng Sun,et al. MetaFac: community discovery via relational hypergraph factorization , 2009, KDD.
[180] P. Grünwald. The Minimum Description Length Principle (Adaptive Computation and Machine Learning) , 2007 .
[181] Philip S. Yu,et al. Identifying the influential bloggers in a community , 2008, WSDM '08.
[182] N. Alves. Unveiling community structures in weighted networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.
[183] Mao-Bin Hu,et al. Detect overlapping and hierarchical community structure in networks , 2008, ArXiv.
[184] S.,et al. An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .
[185] Chen Wang,et al. Detecting Overlapping Community Structures in Networks , 2009, World Wide Web.
[186] R. Hanneman. Introduction to Social Network Methods , 2001 .
[187] Jorma Rissanen,et al. Minimum Description Length Principle , 2010, Encyclopedia of Machine Learning.
[188] Jiawei Han,et al. gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[189] Chris H Wiggins,et al. Bayesian approach to network modularity. , 2007, Physical review letters.
[190] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[191] Martin Rosvall,et al. Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.
[192] Aristides Gionis,et al. Mining Graph Evolution Rules , 2009, ECML/PKDD.