Positive and Unlabeled Multi-Graph Learning
- Publication Type:
- Journal Article
- Citation:
- IEEE Transactions on Cybernetics, 2017, 47 (4), pp. 818 - 829
- Issue Date:
- 2017-04-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| 07439802.pdf | Published Version | 1.35 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 2017 IEEE. In this paper, we advance graph classification to handle multi-graph learning for complicated objects, where each object is represented as a bag of graphs and the label is only available to each bag but not individual graphs. In addition, when training classifiers, users are only given a handful of positive bags and many unlabeled bags, and the learning objective is to train models to classify previously unseen graph bags with maximum accuracy. To achieve the goal, we propose a positive and unlabeled multi-graph learning (puMGL) framework to first select informative subgraphs to convert graphs into a feature space. To utilize unlabeled bags for learning, puMGL assigns a confidence weight to each bag and dynamically adjusts its weight value to select 'reliable negative bags.' A number of representative graphs, selected from positive bags and identified reliable negative graph bags, form a 'margin graph pool' which serves as the base for deriving subgraph patterns, training graph classifiers, and further updating the bag weight values. A closed-loop iterative process helps discover optimal subgraphs from positive and unlabeled graph bags for learning. Experimental comparisons demonstrate the performance of puMGL for classifying real-world complicated objects.
Please use this identifier to cite or link to this item: