[2N3-IS-2b] Machine learning (2/5)

[2N3-IS-2b-03] Graph Key Feature Extraction based on Bag of Features Model and Adjacent Point Pattern

〇Jianming Huang¹, Zhongxi Fang¹, Hiroyuki Kasai¹ (1. WASEDA University)

Keywords:Graph matching, Graph classification, Clutering

For graph classification tasks, graph kernels based on the R-convolution framework are effective tools which aims
to decompose graphs into substructures. However, the current R-convolution framework has a weak point that
its aggregating strategy of substructure similarities is too simple, which is based on unweighted summation and
multiplication of substructure similarities. This means that it may have less robustness. In our works, we tend to
combine the Bag of Feature (BoF) model and the Adjacent Point Pattern to form a more effective framework for
graph key feature extraction, which also supports large datasets.