Graph mining: Laws, generators, and algorithms

By Deepayan Chakrabarti, Christos Faloutsos. 2006

738 citations recorded by the source corpus.

Subfields: Computer Vision and Pattern Recognition, Statistical and Nonlinear Physics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Vision and Pattern Recognition

In Statistical and Nonlinear Physics

Citations in the corpus

Graphite: Iterative Generative Modeling of Graphs (2018, background): “We direct the interested reader to prominent surveys on this topic [32, 31, 5].”
NetGAN: Generating Graphs via Random Walks (2018, methodology): “For a survey we refer the reader to Chakrabarti & Faloutsos (2006) and Goldenberg et al. (2010).”
Community Detection and Mining in Social Media (2010, background): “1 NETWORK MODELING Since the seminal work by Watts and Strogatz (1998), and Barabási and Albert (1999), network modeling has gained some significant momentum (Chakrabarti and Faloutsos, 2006).”
Leveraging social media networks for classification (2011, background): “In social networks, the small-world effect [46] is often observed [4].”
Statistical properties of community structure in large social and information networks (2008, background): “For example, see the reviews on community identification [125, 52], data clustering [90], graph and spectral clustering [75, 151, 143], graph and heavy-tailed data analysis [126, 29, 49], surveys on various aspects of complex networks [10, 55, 124, 25, 51, 114, 23], the monographs on spectral graph ”
Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters (2008, background): “For example, see the reviews on community identification [128, 53], data clustering [91], graph and spectral clustering [76, 154, 146], graph and heavy-tailed data analysis [129, 29, 50], surveys on various aspects of complex networks [10, 56, 127, 25, 52, 117, 23], the monographs on spectral graph ”
oddball: Spotting Anomalies in Weighted Graphs (2010, background): “Several properties of real-world unweighted graphs have been discovered, surveyed in [10].”
Handbook of Big Data (2016, background): “The term large can have two meanings, not mutually exclusive: (1) a large number of cases (records, rows), also called the large -n problem , or (2) a large number of variables (attributes, columns), also called the large -p problem .”
Anomaly detection in online social networks (2014, background): “Consequently, early models (reviewed by Chakrabarti and Faloutsos (2006), see also Sallaberry et al. (2013)) capture only a small number of what we now consider to be general properties of social networks Akoglu and Faloutsos (2009), while more recent models (e.g. Akoglu and Faloutsos (2009);…”
Cross-domain collaboration recommendation (2012, background): “Researchers have studied various issues in social networks, such as network properties [6, 11] and generation processes [18], link predictions [19, 20, 21, 32] and recommendations [2, 7, 17].”
Efficient aggregation for graph summarization (2008, methodology): “Comprehensive surveys on these methods are provided in [6] and [13].”
What graph neural networks cannot learn: depth vs width (2019, neutral): “r is exponentially smaller than n. It should be remarked that graphs with ( logn) diameter are rather commonly encountered in network science and are generated by various standard random graph models [30], such as the Erdos{Renyi [31], the Barabasi-Albert [32], and the exponential cuto [33] models, ”
Bayesian Robust Attributed Graph Clustering: Joint Learning of Partial Anomalies and Group Structure (2018, neutral): “0 ) (Chakrabarti and Faloutsos 2006).”
Clustering and Community Detection in Directed Networks: A Survey (2013, background): “ of a community/cluster in undirected networks. Table1gives a list of used symbols along with their denition. For a general introduction to the eld of complex networks, the reader may refer to Refs. [26,1,27]. 2.1. Graph Theory A network is usually represented by a graph (throughout the paper we use”
Scalable modeling of real graphs using Kronecker multiplication (2007, background): “See (Chakrabarti & Faloutsos, 2006) for a detailed survey and comparison of these methods.”