Abstract

Recently, Multi-Graph Learning was proposed as the extension of Multi-Instance Learning and has achieved some successes. However, to the best of our knowledge, currently, there is no study working on Multi-Graph Multi-Label Learning, where each object is represented as a bag containing a number of graphs and each bag is marked with multiple class labels. It is an interesting problem existing in many applications, such as image classification, medicinal analysis and so on. In this paper, we propose an innovate algorithm to address the problem. Firstly, it uses more precise structures, multiple Graphs, instead of Instances to represent an image so that the classification accuracy could be improved. Then, it uses multiple labels as the output to eliminate the semantic ambiguity of the image. Furthermore, it calculates the entropy to mine the informative subgraphs instead of just mining the frequent subgraphs, which enables selecting the more accurate features for the classification. Lastly, since the current algorithms cannot directly deal with graph-structures, we degenerate the Multi-Graph Multi-Label Learning into the Multi-Instance Multi-Label Learning in order to solve it by MIML-ELM (Improving Multi-Instance Multi-Label Learning by Extreme Learning Machine). The performance study shows that our algorithm outperforms the competitors in terms of both effectiveness and efficiency.

Highlights

  • Due to the advance of smart phones, nowadays people upload a great number of photos to the Internet

  • Graphs can be represented as instances based on what kinds of classifying features (a.k.a. informative subgraphs) that they contain, so graphs can be represented as multiple instances

  • Another subgraph B − C has the frequency of only three, it appears three times in four positive graphs and does not appear in the negative ones at all, so it can stand for the trait of the positive class and is suitable to be regarded as a classifying feature

Read more

Summary

Introduction

Due to the advance of smart phones, nowadays people upload a great number of photos to the Internet. The subgraph A − B is not appropriate to be an informative feature, but, due to its high frequency, gMGFL considers that it is, which will cause imprecise results To solve these problems, in this paper, we proposed an advanced graph-structure algorithm named. Our algorithm is based on a multi-graph and it can solve multi-label (i.e., multiple subjects) problems, which means it can deal with multiple semantic information. It uses the Extreme Learning Machine rather than Support Vector Machine to build an image classifier, which is more efficient.

Graph-Structure Classification
Multi-Instance Multi-Label Learning
MIML-ELM
The MGML Algorithm
Problem Definition
Overall Framework of MGML
Evaluation of Informative Subgraphs
Entropy-Based Subgraph Mining
Building Classifier
Example of MGML
Datasets
Evaluation Criteria
Effectiveness
MIML-SVM
Efficiency
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call