Global Linear Neighborhoods for Efficient Label Propagation

Abstract

Previous chapter Next chapter Full AccessProceedings Proceedings of the 2012 SIAM International Conference on Data Mining (SDM)Global Linear Neighborhoods for Efficient Label PropagationZe Tian and Rui KuangZe Tian and Rui Kuangpp.863 - 872Chapter DOI:https://doi.org/10.1137/1.9781611972825.74PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract Graph-based semi-supervised learning improves classification by combining labeled and unlabeled data through label propagation. It was shown that the sparse representation of graph by weighted local neighbors provides a better similarity measure between data points for label propagation. However, selecting local neighbors can lead to disjoint components and incorrect neighbors in graph, and thus, fail to capture the underlying global structure. In this paper, we propose to learn a nonnegative low-rank graph to capture global linear neighborhoods, under the assumption that each data point can be linearly reconstructed from weighted combinations of its direct neighbors and reachable indirect neighbors. The global linear neighborhoods utilize information from both direct and indirect neighbors to preserve the global cluster structures, while the low-rank property retains a compressed representation of the graph. An efficient algorithm based on a multiplicative update rule is designed to learn a nonnegative low-rank factorization matrix minimizing the neighborhood reconstruction error. Large scale simulations and experiments on UCI datasets and high-dimensional gene expression datasets showed that label propagation based on global linear neighborhoods captures the global cluster structures better and achieved more accurate classification results. Previous chapter Next chapter RelatedDetails Published:2012ISBN:978-1-61197-232-0eISBN:978-1-61197-282-5 https://doi.org/10.1137/1.9781611972825Book Series Name:ProceedingsBook Code:PRDT12Book Pages:1-1150