Sciweavers

52 search results - page 3 / 11
» Euclidean Embedding of Co-Occurrence Data
Sort
View
IJON
2011
133views more  IJON 2011»
13 years 7 days ago
Relational generative topographic mapping
Abstract. The generative topographic mapping (GTM) has been proposed as a statistical model to represent high dimensional data by means of a sparse lattice of points in latent spac...
Andrej Gisbrecht, Bassam Mokbel, Barbara Hammer
SDM
2012
SIAM
247views Data Mining» more  SDM 2012»
11 years 7 months ago
Simplex Distributions for Embedding Data Matrices over Time
Early stress recognition is of great relevance in precision plant protection. Pre-symptomatic water stress detection is of particular interest, ultimately helping to meet the chal...
Kristian Kersting, Mirwaes Wahabzada, Christoph R&...
CVPR
2010
IEEE
14 years 1 months ago
Unified Graph Matching in Euclidean Spaces
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
Julian McAuley, Teofilo de Campos, Tiberio Caetano
PKDD
2005
Springer
131views Data Mining» more  PKDD 2005»
13 years 10 months ago
ISOLLE: Locally Linear Embedding with Geodesic Distance
Locally Linear Embedding (LLE) has recently been proposed as a method for dimensional reduction of high-dimensional nonlinear data sets. In LLE each data point is reconstructed fro...
Claudio Varini, Andreas Degenhard, Tim W. Nattkemp...
CVPR
2012
IEEE
11 years 7 months ago
A fast nearest neighbor search algorithm by nonlinear embedding
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
Yoonho Hwang, Bohyung Han, Hee-Kap Ahn