Skip to main content

Random Multi-Graphs: A semi-supervised learning framework for classification of high dimensional data.

Zhang, Z., Sun, J., Zhong, G. and Dong, J., 2016. Random Multi-Graphs: A semi-supervised learning framework for classification of high dimensional data. Image and Vision Computing, 60, 30-37.

Full text available as:

[img]
Preview
PDF
Random Multi-graphs.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

715kB

DOI: 10.1016/j.imavis.2016.08.006

Abstract

Currently, high dimensional data processing confronts two main difficulties: inefficient similarity measure and high computational complexity in both time and memory space. Common methods to deal with these two difficulties are based on dimensionality reduction and feature selection. In this paper, we present a different way to solve high dimensional data problems by combining the ideas of Random Forests and Anchor Graph semi-supervised learning. We randomly select a subset of features and use the Anchor Graph method to construct a graph. This process is repeated many times to obtain multiple graphs, a process which can be implemented in parallel to ensure runtime efficiency. Then the multiple graphs vote to determine the labels for the unlabeled data. We argue that the randomness can be viewed as a kind of regularization. We evaluate the proposed method on eight real-world data sets by comparing it with two traditional graph-based methods and one state-of-the-art semi-supervised learning method based on Anchor Graph to show its effectiveness. We also apply the proposed method to the subject of face recognition.

Item Type:Article
ISSN:0262-8856
Uncontrolled Keywords:semi-supervised learning; graph; regularization; randomness; anchors 2010 MSC: 00-01, 99-00
Group:Faculty of Media & Communication
ID Code:33296
Deposited By: Unnamed user with email symplectic@symplectic
Deposited On:31 Jan 2020 15:30
Last Modified:31 Jan 2020 15:30

Downloads

Downloads per month over past year

More statistics for this item...
Repository Staff Only -