• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Book chapter

Efficient Mining of Subsample-Stable Graph Patterns

P. 757-762.

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 antimonotonicity 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.