Sciweavers

4560 search results - page 8 / 912
» Finding Data in the Neighborhood
Sort
View
GRC
2008
IEEE
13 years 8 months ago
Neighborhood Smoothing Embedding for Noisy Manifold Learning
Manifold learning can discover the structure of high dimensional data and provides understanding of multidimensional patterns by preserving the local geometric characteristics. Ho...
Guisheng Chen, Junsong Yin, Deyi Li
ESANN
2006
13 years 9 months ago
Weighted differential topographic function: a refinement of topographic function
Topology preservation of Self-Organizing Maps (SOMs) is an advantageous property for correct clustering. Among several existing measures of topology violation, this paper studies t...
Lili Zhang, Erzsébet Merényi
IPPS
2010
IEEE
13 years 5 months ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
DM
2008
100views more  DM 2008»
13 years 7 months ago
Constructing and classifying neighborhood anti-Sperner graphs
For a simple graph G let NG(u) be the (open) neighborhood of vertex u V (G). Then G is neighborhood anti-Sperner (NAS) if for every u there is a v V (G)\{u} with NG(u) NG(v). A...
John P. McSorley
ICCV
2005
IEEE
14 years 9 months ago
Neighborhood Preserving Embedding
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
Xiaofei He, Deng Cai, Shuicheng Yan, HongJiang Zha...