返回
Structured sparse graphs using manifold constraints for visual data analysis
DOI:10.1016/j.neucom.2018.06.067.png)
摘要
En 中文
Data-driven graphs constitute the cornerstone of many machine learning approaches. Recently, it was shown that sparse graphs (sparse representation based graphs) provide a powerful approach to graph-based semi-supervised classification. In this paper, we introduce a new structured sparse graph that is derived by integrating manifold-type constraints on the sparse coefficients without any a priori graph or similarity matrix. Furthermore, we introduce a direct and efficient solution to the proposed optimization problem. Unlike recent sparse graph construction methods that are based on the use of hand-crafted constraints or a predefined reference similarity matrix, our constraints are directly defined on the graph weights themselves, and can provide additional information to both local and global structures of the sparse graph. Experiments conducted on several image databases show that the proposed graph can give better results than many state-of-the-art sparse graphs when applied to the problem of graph-based label propagation. (c) 2018 Elsevier B.V. All rights reserved.
Keyword:
Graph construction
Sparse representation
Manifold constraints
Graph-based semi-supervised learning
Label propagation
Image classification
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Multi-view clustering via multi-manifold regularized non-negative matrix factorization
NEURAL NETWORKS
IF6.3
A Review of Technical Impact of Electrical Vehicle Charging Stations on Distribution Grid电动汽车充电站对配电网的技术影响研究综述

