Semi-supervised multi-graph classification using optimal feature selection and extreme learning machine
Semi-supervised multi-graph classification using optimal feature selection and extreme learning machine
复制标题
DOI:
10.1016/j.neucom.2017.01.114
复制
发表时间:
2018-02
期刊:
影响因子:
6
通讯作者:
Jun Pang;Yu Gu;Jia Xu;Ge Yu
中科院分区:
文献类型:
--
作者:
Jun Pang;Yu Gu;Jia Xu;Ge Yu
A multi-graph is represented by a bag of graphs. Semi-supervised multi-graph classification is a partly supervised learning problem, which has a wide range of applications, such as bio-pharmaceutical activity tests, scientific publication categorization and online product recommendation. However, to the best of our knowledge, few research works have be reported. In this paper, we propose a semi-supervised multi-graph classification algorithm to handle the semi-supervised multi-graph classification problem. Our algorithm consists of three main steps, including the optimal subgraph feature selection, the subgraph feature representation of multi-graph and the semi-supervised classifier building. We first propose an evaluation criterion of the optimal subgraph features, which not only considers unlabeled multi-graphs but also considers the constraints between the multi-graph level and the graph level. Then, the optimal subgraph feature selection problem is equivalently converted into the problem of miningmmost informative subgraph features. Based on those derivedmsubgraph features, every multi-graph is represented by anm-dimensional vector, where theith dimension equals to 1 if at least one graph involved in the multi-graph contains theith subgraph feature. At last, based on these vectors, semi-supervised extreme learning machine(semi-supervised ELM) is adopted to build the prediction model for predicting the labels of unseen multi-graphs. Extensive experiments on real-world and synthetic graph datasets show that the proposed algorithm is effective and efficient.