Label propagation is one of the state-of-the-art methods for semi-supervised learning, which estimates labels by propagating label information through a graph. Label propagation assumes that data points (nodes) connected in a graph should have similar labels. Consequently, the label estimation heavily depends on edge weights in a graph which represent similarity of each node pair. We propose a method for a graph to capture the manifold structure of input features using edge weights parameterized by a similarity function. In this approach, edge weights represent both similarity and local reconstruction weight simultaneously, both being reasonable for label propagation. For further justification, we provide analytical considerations including an interpretation as a cross-validation of a propagation model in the feature space, and an error analysis based on a low dimensional manifold model. Experimental results demonstrated the effectiveness of our approach both in synthetic and real datasets.
Masayuki Karasuyama (Kyoto University)
Hiroshi Mamitsuka (Kyoto University / Aalto University)
More from the Same Authors
2019 Poster: AttentionXML: Label Tree-based Attention-Aware Deep Model for High-Performance Extreme Multi-Label Text Classification »
Ronghui You · Zihan Zhang · Ziye Wang · Suyang Dai · Hiroshi Mamitsuka · Shanfeng Zhu
2018 Poster: Efficient Convex Completion of Coupled Tensors using Coupled Nuclear Norms »
Kishan Wimalawarne · Hiroshi Mamitsuka