DeepAI AI Chat
Log In Sign Up

Approximate Network Motif Mining Via Graph Learning

by   Carlos Oliver, et al.
ETH Zurich

Frequent and structurally related subgraphs, also known as network motifs, are valuable features of many graph datasets. However, the high computational complexity of identifying motif sets in arbitrary datasets (motif mining) has limited their use in many real-world datasets. By automatically leveraging statistical properties of datasets, machine learning approaches have shown promise in several tasks with combinatorial complexity and are therefore a promising candidate for network motif mining. In this work we seek to facilitate the development of machine learning approaches aimed at motif mining. We propose a formulation of the motif mining problem as a node labelling task. In addition, we build benchmark datasets and evaluation metrics which test the ability of models to capture different aspects of motif discovery such as motif number, size, topology, and scarcity. Next, we propose MotiFiesta, a first attempt at solving this problem in a fully differentiable manner with promising results on challenging baselines. Finally, we demonstrate through MotiFiesta that this learning setting can be applied simultaneously to general-purpose data mining and interpretable feature extraction for graph classification tasks.


page 1

page 2

page 3

page 4


Reductions for Frequency-Based Data Mining Problems

Studying the computational complexity of problems is one of the - if not...

Dual Convolutional Neural Network for Graph of Graphs Link Prediction

Graphs are general and powerful data representations which can model com...

Characterizing Transactional Databases for Frequent Itemset Mining

This paper presents a study of the characteristics of transactional data...

Distributed Feature Extraction in a P2P Setting - A Case Study

Finding the right data representation is essential for virtually every d...

Boosting Frequent Itemset Mining via Early Stopping Intersections

Mining frequent itemsets from a transaction database has emerged as a fu...

Helping AI to Play Hearthstone: AAIA'17 Data Mining Challenge

This paper summarizes the AAIA'17 Data Mining Challenge: Helping AI to P...

Grafting for Combinatorial Boolean Model using Frequent Itemset Mining

This paper introduces the combinatorial Boolean model (CBM), which is de...