arrow
返回

Robust manifold learning with CycleCut

delete2012-03-01
delete7
delete
OA
AI
M
Mike Gashler *
T
Tony Martinez
DOI:10.1080/09540091.2012.664122delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Many manifold learning algorithms utilise graphs of local neighbourhoods to estimate manifold topology. When neighbourhood connections short-circuit between geodesically distant regions of the manifold, poor results are obtained due to the compromises that the manifold learner must make to satisfy the erroneous criteria. Also, existing manifold learning algorithms have difficulty in unfolding manifolds with toroidal intrinsic variables without introducing significant distortions to local neighbourhoods. An algorithm called CycleCut is presented, which prepares data for manifold learning by removing short-circuit connections and by severing toroidal connections in a manifold.
Keyword:
neighbourhood graphs
shortcut connection detection
nonlinear dimensionality reduction
manifold learning
AI总结

AI总结

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

期刊

Connection Science 封面图
Connection Science
IF:
3.4
论文数:
850
被引数:
1.5K

机构

B
Brigham Young University
学者数:
9.0K
论文数: 6.0K
被引数: 9.3K
引用论文

引用论文

err
IF0
err
err0
PREAI
err
err分享
err收藏
ISOLLE: LLE with geodesic distance
err2006-08-01
err39
PREAI
errVarini, Claudio; Degenhard, Andreas; Nattkemper, Tim W.
err分享
err收藏
Hormones and the control of porphyrin biosynthesis and structure in the hamster Harderian gland
err1996-06-01
err0
errOAAI
errA.P. Payne; S.W. Shah; F.A. Marr; J. McGadey; G.G. Thompson; M.R. Moore
err分享
err收藏
没有更多内容