Sciweavers

894 search results - page 8 / 179
» Learning to cluster using local neighborhood structure
Sort
View
ICPR
2008
IEEE
15 years 4 months ago
Semi-supervised learning by locally linear embedding in kernel space
Graph based semi-supervised learning methods (SSL) implicitly assume that the intrinsic geometry of the data points can be fully specified by an Euclidean distance based local ne...
Rujie Liu, Yuehong Wang, Takayuki Baba, Daiki Masu...
CORR
2006
Springer
151views Education» more  CORR 2006»
14 years 9 months ago
Graph Laplacians and their convergence on random neighborhood graphs
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxb...
IJCV
2000
149views more  IJCV 2000»
14 years 9 months ago
Recognition without Correspondence using Multidimensional Receptive Field Histograms
The appearance of an object is composed of local structure. This local structure can be described and characterized by a vector of local features measured by local operators such a...
Bernt Schiele, James L. Crowley
ECCV
2010
Springer
15 years 2 months ago
Learning What and How of Contextual Models for Scene Labeling
We present a data-driven approach to predict the importance of edges and construct a Markov network for image analysis based on statistical models of global and local image feature...
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
15 years 3 months ago
Orthogonal Neighborhood Preserving Projections
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
Effrosini Kokiopoulou, Yousef Saad