arrow
返回

Sample-dependent graph construction with application to dimensionality reduction

delete2010-12-01
delete58
PRE
AI
B
Bo Yang
Songcan Chen 封面图
Songcan Chen (Songcan Chen) *
DOI:10.1016/j.neucom.2010.03.019delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Graph construction plays a key role on learning algorithms based on graph Laplacian However the traditional graph construction approaches of epsilon-neighborhood and k-nearest-neighbor need to predefine the same neighbor parameter epsilon (or k) for all samples which usually suffers from the difficulty of parameter selection and generally fail to effectively fit intrinsic structures of data To mitigate these limitations to a certain extent in this paper we present a novel and sample dependent approach of graph construction and name the so-constructed graph as Sample-dependent Graph (SG) Specifically instead of predefining the same neighbor parameter for all sample, the SG depends on samples in question to determine neighbors of each sample and similarities between sample pairs As a result it not only avoids the intractability and high expense of neighbor parameter selection but also can more effectively fit the intrinsic structures of data Further in order to show the effectiveness of the SG we apply it to the dimensionality reduction based on graph embedding and incorporate it into the state-of-the-art off-the-shelf unsupervised locality preserving projection (LPP) to develop the sample-dependent LPP (SLPP) SLPP naturally inherits the merits of SG and maintains the attractive properties of the traditional LPP The experiments on the toy and benchmark (UCI face recognition object category and handwritten digits recognition) datasets show the effectiveness and feasibility of the SG and SLPP with promising results (C) 2010 Elsevier B V All rights reserved
Keyword:
Graph Laplacian
Graph construction
Dimensionality reduction (DR)
Graph embedding
Similarity neighborhood
Local neighbor
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Neurocomputing 封面图
Neurocomputing
IF:
6.5
论文数:
2.5W
被引数:
6.5W

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
Circulating Breast Cancer Cells Are Frequently Apoptotic
err2001-07-01
err0
errOAAI
errGábor Méhes; Armin Witt; Ernst Kubista; Peter F. Ambros
err分享
err收藏
Face recognition from a single image per person: A survey
err2006-09-01
err555
PREAI
errTan, Xiaoyang; Chen, Songcan; Zhou, Zhi-Hua; Zhang, Fuyan
err分享
err收藏
学者 查看更多内容