Access the full text.
Sign up today, get DeepDyve free for 14 days.
C. Gros (2015)
Graph Theory and Small-World Networks
Geng Li, Murat Semerci, B. Yener, Mohammed Zaki (2012)
Effective graph classification based on topological and label attributesStatistical Analysis and Data Mining: The ASA Data Science Journal, 5
Thomas Gärtner, Peter Flach, Stefan Wrobel (2003)
Learning Theory and Kernel Machines
J. Ugander, L. Backstrom, J. Kleinberg (2013)
Subgraph frequencies: mapping the empirical and extremal geography of large graph collectionsProceedings of the 22nd international conference on World Wide Web
N. Shervashidze, S. Vishwanathan, Tobias Petri, K. Mehlhorn, K. Borgwardt (2009)
Efficient graphlet kernels for large graph comparison
Nesreen Ahmed, Ryan Rossi, R. Zhou, J. Lee, Xiangnan Kong, Theodore Willke, Hoda Eldardiry (2017)
Representation Learning in Large Attributed GraphsArXiv, abs/1710.09471
P. Mahé, Nobuhisa Ueda, T. Akutsu, J. Perret, Jean-Philippe Vert (2004)
Extensions of marginalized graph kernelsProceedings of the twenty-first international conference on Machine learning
T. Hastie, R. Tibshirani, J. Friedman (2001)
The Elements of Statistical Learning
S. Soundarajan, Tina Eliassi-Rad, Brian Gallagher (2014)
A Guide to Selecting a Network Similarity Method
NK Ahmed, J Neville, RA Rossi, N Duffield, TL Willke (2016)
Graphlet decomposition: framework, algorithms, and applicationsKnowl Inf Syst (KAIS), 50
Nesreen Ahmed, Jennifer Neville, Ryan Rossi, N. Duffield, Theodore Willke
Under Consideration for Publication in Knowledge and Information Systems Graphlet Decomposition: Framework, Algorithms, and Applications
Kansuke Ikehara, A. Clauset (2017)
Characterizing the structural diversity of complex networks across domainsArXiv, abs/1710.11304
B. Abrahao, S. Soundarajan, J. Hopcroft, Robert Kleinberg (2012)
On the separability of structural classes of communities
G. Kollias, Madan Sathe, O. Schenk, A. Grama (2014)
Fast parallel algorithms for graph similarity and matchingJ. Parallel Distributed Comput., 74
M. Newman, M. Newman, S. Strogatz, D. Watts, D. Watts (2000)
Random graphs with arbitrary degree distributions and their applications.Physical review. E, Statistical, nonlinear, and soft matter physics, 64 2 Pt 2
James Canning, Emma Ingram, Sammantha Nowak-Wolff, Adriana Ortiz, Nesreen Ahmed, Ryan Rossi, Karl Schmitt, S. Soundarajan (2018)
Predicting Graph Categories from Structural PropertiesArXiv, abs/1805.02682
Ryan Rossi, S. Fahmy, N. Talukder (2013)
A multi-level approach for evaluating internet topology generators2013 IFIP Networking Conference
J. Leskovec, Deepayan Chakrabarti, J. Kleinberg, C. Faloutsos, Zoubin Ghahramani (2008)
Kronecker Graphs: An Approach to Modeling NetworksArXiv, abs/0812.4905
Priya Mahadevan, Calvin Hubble, D. Krioukov, B. Huffaker, Amin Vahdat (2007)
Orbis: rescaling degree correlations to generate annotated internet topologies
Sebastián Moreno, Jennifer Neville, Sergey Kirshner (2010)
Tied Kronecker product graph models to capture variance in network populations2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
M. Newman, M. Newman (2002)
Assortative mixing in networks.Physical review letters, 89 20
Stephen Bonner, John Brennan, G. Theodoropoulos, Ibad Kureshi, A. McGough (2016)
Efficient comparison of massive graphs through the use of 'graph fingerprints'.
Ryan Rossi, Nesreen Ahmed (2014)
Role Discovery in NetworksIEEE Transactions on Knowledge and Data Engineering, 27
P. Erdos, A. Rényi (1984)
On the evolution of random graphsTransactions of the American Mathematical Society, 286
James Canning, Emma Ingram, Sammantha Nowak-Wolff, Adriana Ortiz, Nesreen Ahmed, Ryan Rossi, Karl Schmitt, S. Soundarajan (2017)
Network Classification and CategorizationArXiv, abs/1709.04481
Xiaoming Wang, Xiliang Liu, D. Loguinov (2008)
Modeling the Evolution of Degree Correlation in Scale-Free Topology GeneratorsIEEE INFOCOM 2008 - The 27th Conference on Computer Communications
Priya Mahadevan, Calvin Hubble, D. Krioukov, B. Huffaker, Amin Vahdat (2007)
OrbisProceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '07
J. Lee, Ryan Rossi, Xiangnan Kong (2017)
Deep Graph Attention ModelArXiv, abs/1709.06075
Ryan Rossi, Nesreen Ahmed (2014)
Coloring large complex networksSocial Network Analysis and Mining, 4
Nils Kriege, Petra Mutzel (2012)
Subgraph Matching Kernels for Attributed Graphs
Ting Guo, Xingquan Zhu (2013)
Understanding the roles of sub-graph features for graph classification: an empirical study perspectiveProceedings of the 22nd ACM international conference on Information & Knowledge Management
Thomas Gärtner, Peter Flach, S. Wrobel (2003)
On Graph Kernels: Hardness Results and Efficient Alternatives
B. Bollobás (1984)
The evolution of random graphsTransactions of the American Mathematical Society, 286
R. Albert, A. Barabási (2001)
Statistical mechanics of complex networksArXiv, cond-mat/0106096
Nesreen Ahmed, Jennifer Neville, Ryan Rossi, N. Duffield (2015)
Efficient Graphlet Counting for Large Networks2015 IEEE International Conference on Data Mining
Nesreen Ahmed, Ryan Rossi (2015)
Interactive Visual Graph Analytics on the Web
Ryan Rossi, D. Gleich, A. Gebremedhin, Md. Patwary (2014)
Fast maximum clique algorithms for large graphsProceedings of the 23rd International Conference on World Wide Web
Stephen Bonner, John Brennan, G. Theodoropoulos, Ibad Kureshi, A. McGough (2016)
Deep topology classification: A new approach for massive graph classification2016 IEEE International Conference on Big Data (Big Data)
P. Erd6s, A. R~nyi
On the Evolution of Random Graphs
Thomas Gärtner (2003)
A survey of kernels for structured dataSIGKDD Explor., 5
D. Watts, S. Strogatz (1998)
Collective dynamics of ‘small-world’ networksNature, 393
Z. Duan (2008)
GRAPH THEORY AND COMPLEX NETWORKSAdvances in Mechanics
Danai Koutra, Hanghang Tong, D. Lubensky (2013)
BIG-ALIGN: Fast Bipartite Graph Alignment2013 IEEE 13th International Conference on Data Mining
Waqar Ali, A. Wegner, Robert Gaunt, C. Deane, G. Reinert (2016)
Comparison of large networks with sub-sampling strategiesScientific Reports, 6
N. Shervashidze, Pascal Schweitzer, E. Leeuwen, K. Mehlhorn, K. Borgwardt (2011)
Weisfeiler-Lehman Graph KernelsJ. Mach. Learn. Res., 12
J. Onnela, Daniel Fenn, Stephen Reid, M. Porter, P. Mucha, M. Fricker, N. Jones (2010)
Taxonomies of networks from community structure.Physical review. E, Statistical, nonlinear, and soft matter physics, 86 3 Pt 2
Arif Khan, D. Gleich, A. Pothen, M. Halappanavar (2012)
A multithreaded algorithm for network alignment via approximate matching2012 International Conference for High Performance Computing, Networking, Storage and Analysis
N. Malod-Dognin, Natasa Przulj (2015)
L-GRAAL: Lagrangian graphlet-based network alignerBioinformatics, 31
M. Newman (2010)
Networks: An Introduction
Nesreen Ahmed, Jennifer Neville, R. Kompella (2012)
Network Sampling: From Static to Streaming GraphsArXiv, abs/1211.3412
Petter Holme, Beom Kim (2001)
Growing scale-free networks with tunable clustering.Physical review. E, Statistical, nonlinear, and soft matter physics, 65 2 Pt 2
L. Zager, G. Verghese (2008)
Graph similarity scoring and matchingAppl. Math. Lett., 21
S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, U. Alon (2002)
Milo , Networks Network Motifs : Simple Building Blocks of Complex
Fan Chung, Linyuan Lu (2002)
Connected Components in Random Graphs with Given Expected Degree SequencesAnnals of Combinatorics, 6
T. Milenković, W. Ng, W. Hayes, Natasa Przulj (2010)
Optimal Network Alignment with Graphlet Degree VectorsCancer Informatics, 9
J. Raymond, Eleanor Gardiner, P. Willett (2002)
RASCAL: Calculation of Graph Similarity using Maximum Common Edge SubgraphsComput. J., 45
Corinna Cortes, V. Vapnik (1995)
Support-Vector NetworksMachine Learning, 20
Radford Neal (2006)
Pattern Recognition and Machine LearningPattern Recognition and Machine Learning
L. Ralaivola, S. Swamidass, Hiroto Saigo, P. Baldi (2005)
Graph kernels for chemical informaticsNeural networks : the official journal of the International Neural Network Society, 18 8
R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, U. Alon (2002)
Network motifs: simple building blocks of complex networks.Science, 298 5594
Ryan Rossi, R. Zhou, Nesreen Ahmed (2017)
Deep Feature Learning for GraphsArXiv, abs/1704.08829
L. Breiman (2001)
Random ForestsMachine Learning, 45
D. Duvenaud, D. Maclaurin, J. Aguilera-Iparraguirre, Rafael Gómez-Bombarelli, Timothy Hirzel, Alán Aspuru-Guzik, Ryan Adams (2015)
Convolutional Networks on Graphs for Learning Molecular FingerprintsArXiv, abs/1509.09292
Ryan Rossi, Nesreen Ahmed (2015)
The Network Data Repository with Interactive Graph Analytics and Visualization
S. Vishwanathan, K. Borgwardt, I. Kondor, N. Schraudolph (2008)
Graph KernelsArXiv, abs/0807.0093
Kansuke Ikehara (2016)
The Structure of Complex Networks Across Domains
Stephen Bonner, John Brennan, G. Theodoropoulos, Ibad Kureshi, A. McGough (2016)
GFP-X: A parallel approach to massive graph comparison using spark2016 IEEE International Conference on Big Data (Big Data)
T. Goldsmith, D. Davenport (1990)
Assessing structural similarity of graphs
Complex networks arise in many domains and often represent phenomena such as brain activity, social relationships, molecular interactions, hyperlinks, and re-tweets. In this work, we study the problem of predicting the category (domain) of arbitrary networks. This includes complex networks from different domains as well as synthetically generated graphs from six different network models. We formulate this problem as a multiclass classification problem and learn a model to predict the domain of a new previously unseen network using only a small set of simple structural features. The model is able to accurately predict the domain of arbitrary networks from 17 different domains with 95.7% accuracy. This work makes two important findings. First, our results indicate that complex networks from various domains have distinct structural properties that allow us to predict with high accuracy the category of a new previously unseen network. Second, synthetic graphs are trivial to classify as the classification model can predict with near-certainty the graph model used to generate it. Overall, the results demonstrate that networks drawn from different domains and graph models are distinguishable using a few simple structural features.
Social Network Analysis and Mining – Springer Journals
Published: Sep 19, 2019
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.