research-article

Recurrent Subgraph Prediction

Authors:

Saurabh Nagrecha,

Nitesh V. Chawla,

Horst BunkeAuthors Info & Claims

ASONAM '15: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015

Pages 416 - 423

https://doi.org/10.1145/2808797.2809283

Published: 25 August 2015 Publication History

Abstract

Interactions in dynamic networks often transcend the dyadic barrier and emerge as subgraphs. The evolution of these subgraphs cannot be completely predicted using a pairwise link prediction analysis. We propose a novel solution to the problem---"Prediction of Recurrent Subgraphs (PReSub)" which treats subgraphs as individual entities in their own right. PReSub predicts re-occurring subgraphs using the network's vector space embedding and a set of "early warning subgraphs" which act as global and local descriptors of the subgraph's behavior. PReSub can be used as an out-of-the-box pipeline method with user-provided subgraphs or even to discover interesting subgraphs in an unsupervised manner. It can handle missing network information and is parallelizable. We show that PReSub outperforms traditional pairwise link prediction for a variety of evolving network datasets. The goal of this framework is to improve our understanding of subgraphs and provide an alternative representation in order to characterize their behavior.

References

[1]

J. Leskovec, A. Singh, and J. Kleinberg, "Patterns of Influence in a Recommendation Network," in Advances in Knowledge Discovery and Data Mining. Springer, 2006, pp. 380--389.

Digital Library

[2]

L. Backstrom, C. Dwork, and J. Kleinberg, "Wherefore Art Thou R3579X? Anonymized Social Networks, Hidden Patterns, and Structural Steganography," in Proceedings of the 16th international conference on World Wide Web. ACM, 2007, pp. 181--190.

Digital Library

[3]

H. Hu, X. Yan, Y. Huang, J. Han, and X. J. Zhou, "Mining Coherent Dense Subgraphs across Massive Biological Networks for Functional Discovery," Bioinformatics, vol. 21, no. suppl 1, pp. i213--i221, 2005.

Digital Library

[4]

K. Riesen and H. Bunke, "Graph Classification Based on Vector Space Embedding," International Journal of Pattern Recognition and Artificial Intelligence, vol. 23, no. 06, pp. 1053--1081, 2009.

[5]

P. Holme and J. Saramäki, "Temporal Networks," Physics reports, vol. 519, no. 3, pp. 97--125, 2012.

[6]

C. Jiang, F. Coenen, and M. Zito, "A Survey of Frequent Subgraph Mining Algorithms," KER, vol. 28, no. 1, pp. 75--105, 2013.

[7]

J. Han, J. Pei, and Y. Yin, "Mining Frequent Patterns without Candidate Generation," in ACM SIGMOD Record, vol. 29, no. 2, 2000, pp. 1--12.

Digital Library

[8]

H. Li, Y. Wang, D. Zhang, M. Zhang, and E. Y. Chang, "PFP: Parallel FP-Growth for Query Recommendation," in Proceedings of the 2008 ACM conference on Recommender systems. ACM, 2008, pp. 107--114.

Digital Library

[9]

D. J. Cook and L. B. Holder, "Substructure Discovery Using Minimum Description Length and Background Knowledge," arXiv cs/9402102, 1994.

Digital Library

[10]

H. Bunke and K. Shearer, "A Graph Distance Metric based on the Maximal Common Subgraph," Pattern recognition letters, vol. 19, no. 3, pp. 255--259, 1998.

Digital Library

[11]

K. Riesen and H. Bunke, "Reducing the Dimensionality of Dissimilarity Space Embedding Graph Kernels," Engineering Applications of Artificial Intelligence, vol. 22, no. 1, pp. 48--56, 2009.

Digital Library

[12]

M. Neuhaus, K. Riesen, and H. Bunke, "Fast Suboptimal Algorithms for the Computation of Graph Edit Distance," in Structural, Syntactic, and Statistical Pattern Recognition. Springer, 2006, pp. 163--172.

Digital Library

[13]

S. Fankhauser, K. Riesen, and H. Bunke, "Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching," in Graph-based representations in pattern recognition. Springer, 2011, pp. 102--111.

Digital Library

[14]

A. Andoni and K. Onak, "Approximating Edit Distance in Near-Linear Time," SIAM Journal on Computing, vol. 41, no. 6, pp. 1635--1648, 2012.

[15]

E. Pekalska, R. Duin, and P. Paclik, "Prototype Selection for Dissimilarity-based Classifiers," Pattern Recognition, vol. 39, no. 2, pp. 189--208, 2006.

Digital Library

[16]

K. Riesen, M. Neuhaus, and H. Bunke, "Graph Embedding in Vector Spaces by means of Prototype Selection," in Graph-Based Representations in Pattern Recognition. Springer, 2007, pp. 383--393.

Digital Library

[17]

V. Vacic, L. M. Iakoucheva, S. Lonardi, and P. Radivojac, "Graphlet Kernels for Prediction of Functional Residues in Protein Structures," Journal of Computational Biology, vol. 17, no. 1, pp. 55--72, 2010.

[18]

M. Lahiri and T. Y. Berger-Wolf, "Structure Prediction in Temporal Networks Using Frequent Subgraphs," in IEEE Symposium on CIDM, 2007, pp. 35--42.

[19]

J. Ugander, L. Backstrom, and J. Kleinberg, "Subgraph Frequencies: Mapping the Empirical and Extremal Geography of Large Graph Collections," in Proceedings of the 22nd international conference on World Wide Web, 2013, pp. 1307--1318.

Digital Library

[20]

R. N. Lichtenwalter, J. T. Lussier, and N. V. Chawla, "New Perspectives and Methods in Link Prediction," in Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2010, pp. 243--252.

Digital Library

[21]

J. Shetty and J. Adibi, "The Enron Email Dataset Database Schema and Brief Statistical Report," Information Sciences Institute Technical Report, University of Southern California, vol. 4, 2004.

[22]

B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi, "On the Evolution of User Interaction in Facebook," in Proceedings of the 2nd ACM workshop on Online social networks, 2009, pp. 37--42.

Digital Library

[23]

R. N. Lichtenwalter and N. V. Chawla, "LPmade: Link Prediction Made Easy," Journal of Machine Learning Research, vol. 12, pp. 2489--2492, 2011.

Digital Library

[24]

R. N. Lichtenwalter and N. V. Chawla, "Vertex Collocation Profiles: Subgraph Counting for Link Analysis and Prediction," in Proceedings of the 21st international conference on World Wide Web. ACM, 2012, pp. 1019--1028.

Digital Library

Cited By

Diaz-Pace JTommasel AGodoy D(2018)[Research Paper] Towards Anticipation of Architectural Smells Using Link Prediction Techniques2018 IEEE 18th International Working Conference on Source Code Analysis and Manipulation (SCAM)10.1109/SCAM.2018.00015(62-71)Online publication date: Sep-2018
https://doi.org/10.1109/SCAM.2018.00015
Li JZiebart BBerger-Wolf T(2018)A Game-Theoretic Adversarial Approach to Dynamic Network PredictionAdvances in Knowledge Discovery and Data Mining10.1007/978-3-319-93040-4_53(677-688)Online publication date: 17-Jun-2018
https://doi.org/10.1007/978-3-319-93040-4_53

Recurrent Subgraph Prediction
1. Human-centered computing
  1. Human computer interaction (HCI)
    1. Interaction paradigms
2. Information systems
  1. Information systems applications

Recommendations

Frequent subgraph mining in outerplanar graphs

In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining problem for tree datasets can be solved in incremental polynomial time, it ...
Spanning subgraph with Eulerian components

A graph is k-supereulerian if it has a spanning even subgraph with at most k components. We show that if G is a connected graph and G^' is the (collapsible) reduction of G, then G is k-supereulerian if and only if G^' is k-supereulerian. This extends ...
Antimagic labeling graphs with a regular dominating subgraph

An antimagic labeling of a connected graph with @? edges is an injective assignment of labels from {1,...,@?} to the edges such that the sums of incident labels are distinct at distinct vertices. Hartsfield and Ringel conjectured that every connected ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ASONAM '15: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015

August 2015

835 pages

ISBN:9781450338547

DOI:10.1145/2808797

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 August 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Funding Sources

Conference

ASONAM '15

Sponsor:

SIGKDD

ASONAM '15: Advances in Social Networks Analysis and Mining 2015

August 25 - 28, 2015

Paris, France

Acceptance Rates

Overall Acceptance Rate 116 of 549 submissions, 21%

Upcoming Conference

KDD '24

Sponsor:
sigkdd
sigkdd

The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining

August 25 - 29, 2024

Barcelona , Spain

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
91
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Diaz-Pace JTommasel AGodoy D(2018)[Research Paper] Towards Anticipation of Architectural Smells Using Link Prediction Techniques2018 IEEE 18th International Working Conference on Source Code Analysis and Manipulation (SCAM)10.1109/SCAM.2018.00015(62-71)Online publication date: Sep-2018
https://doi.org/10.1109/SCAM.2018.00015
Li JZiebart BBerger-Wolf T(2018)A Game-Theoretic Adversarial Approach to Dynamic Network PredictionAdvances in Knowledge Discovery and Data Mining10.1007/978-3-319-93040-4_53(677-688)Online publication date: 17-Jun-2018
https://doi.org/10.1007/978-3-319-93040-4_53

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents