Efficient Mining of Subsample-Stable Graph Patterns - Archive ouverte HAL Access content directly
Conference Papers Year :

Efficient Mining of Subsample-Stable Graph Patterns

(1) , (2) , (3)
1
2
3

Abstract

A scalable method for mining graph patterns stable under subsampling is proposed. The existing subsample stability and robustness measures are not antimonotonic according to definitions known so far. We study a broader notion of anti-monotonicity for graph patterns, so that measures of subsample stability become antimonotonic. Then we propose gSOFIA for mining the most subsample-stable graph patterns. The experiments on numerous graph datasets show that gSOFIA is very efficient for discovering subsample-stable graph patterns.
Fichier principal
Vignette du fichier
icdm17-Sofia-graph.pdf (299.11 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01668663 , version 1 (20-12-2017)

Identifiers

  • HAL Id : hal-01668663 , version 1

Cite

Aleksey Buzmakov, Sergei O. Kuznetsov, Amedeo Napoli. Efficient Mining of Subsample-Stable Graph Patterns. ICDM 2017 - 17th IEEE International Conference on Data Mining, Nov 2017, New Orleans, United States. pp.1-6. ⟨hal-01668663⟩
209 View
227 Download

Share

Gmail Facebook Twitter LinkedIn More