Sciweavers

335 search results - page 38 / 67
» Neighborly Embedded Manifolds
Sort
View
GD
1999
Springer
13 years 11 months ago
Planarity-Preserving Clustering and Embedding for Large Planar Graphs
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
CVPR
2003
IEEE
14 years 9 months ago
Optimal Linear Representations of Images for Object Recognition
Although linear representations are frequently used in image analysis, their performances are seldom optimal in specific applications. This paper proposes a stochastic gradient al...
Xiuwen Liu, Anuj Srivastava, Kyle Gallivan
ESANN
2007
13 years 9 months ago
Estimation of tangent planes for neighborhood graph correction
Local algorithms for non-linear dimensionality reduction [1], [2], [3], [4], [5] and semi-supervised learning algorithms [6], [7] use spectral decomposition based on a nearest neig...
Karina Zapien Arreola, Gilles Gasso, Stépha...
AAAI
2006
13 years 9 months ago
Tensor Embedding Methods
Over the past few years, some embedding methods have been proposed for feature extraction and dimensionality reduction in various machine learning and pattern classification tasks...
Guang Dai, Dit-Yan Yeung
ICPR
2008
IEEE
14 years 8 months ago
On refining dissimilarity matrices for an improved NN learning
Application-specific dissimilarity functions can be used for learning from a set of objects represented by pairwise dissimilarity matrices in this context. These dissimilarities m...
Elzbieta Pekalska, Robert P. W. Duin