Learning to count: A deep learning framework for graphlet count estimation - Archive ouverte HAL Access content directly
Journal Articles Network Science Year : 2021

## Learning to count: A deep learning framework for graphlet count estimation

(1) , (2) , (1) , (3)
1
2
3
Xutong Liu
• Function : Author
Yu-Zhen Janice Chen
• Function : Author
John Chi Shing Lui
• Function : Author
Konstantin Avrachenkov

#### Abstract

Graphlet counting is a widely-explored problem in network analysis and has been successfully applied to a variety of applications in many domains, most notatbly bioinformatics, social science and infrastructure network studies. Efficiently computing graphlet counts remains challenging due to the combinatorial explosion, where a naive enumeration algorithm needs O($N^k$) time for $k$-node graphlets in a network of size $N$. Recently, many works introduced carefully designed combinatorial and sampling methods with encouraging results. However, the existing methods ignore the fact that graphlet counts and the graph structural information are correlated. They always consider a graph as a new input and repeat the tedious counting procedure on a regular basis even if it is similar or exactly isomorphic to previously studied graphs. This provides an opportunity to speed up the graphlet count estimation procedure by exploiting this correlation via learning methods. In this paper, we raise a novel Graphlet Count Learning (GCL) problem: given a set of historical graphs with known graphlet counts, how to learn to estimate/predict graphlet count for unseen graphs coming from the same (or similar) underlying distribution. We develop a deep learning framework which contains two {\em convolutional neural network} (CNN) models and a series of data {\em preprocessing techniques} to solve the GCL problem. Extensive experiments are conducted on three types of synthetic random graphs and three types of real world graphs for all 3,4,5-node graphlets to demonstrate the accuracy, efficiency and generalizability of our framework. Compared with state-of-the-art exact/sampling methods, our framework shows great potential, which can offer up to two orders of magnitude speedup on synthetic graphs and achieves on par speed on real world graphs with competitive accuracy.

### Dates and versions

hal-02942321 , version 1 (17-09-2020)

### Identifiers

• HAL Id : hal-02942321 , version 1
• DOI :

### Cite

Xutong Liu, Yu-Zhen Janice Chen, John Chi Shing Lui, Konstantin Avrachenkov. Learning to count: A deep learning framework for graphlet count estimation. Network Science, 2021, 9, pp.S23-S60. ⟨10.1017/nws.2020.35⟩. ⟨hal-02942321⟩

### Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

122 View