Sciweavers

98 search results - page 10 / 20
» On Point Sampling Versus Space Sampling for Dimensionality R...
Sort
View
IV
2007
IEEE
160views Visualization» more  IV 2007»
14 years 1 months ago
Targeted Projection Pursuit for Interactive Exploration of High- Dimensional Data Sets
High-dimensional data is, by its nature, difficult to visualise. Many current techniques involve reducing the dimensionality of the data, which results in a loss of information. ...
Joe Faith
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 7 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...
JMLR
2012
11 years 10 months ago
Krylov Subspace Descent for Deep Learning
In this paper, we propose a second order optimization method to learn models where both the dimensionality of the parameter space and the number of training samples is high. In ou...
Oriol Vinyals, Daniel Povey
IEEEMM
2007
146views more  IEEEMM 2007»
13 years 7 months ago
Learning Microarray Gene Expression Data by Hybrid Discriminant Analysis
— Microarray technology offers a high throughput means to study expression networks and gene regulatory networks in cells. The intrinsic nature of high dimensionality and small s...
Yijuan Lu, Qi Tian, Maribel Sanchez, Jennifer L. N...
IROS
2009
IEEE
200views Robotics» more  IROS 2009»
14 years 2 months ago
Fast geometric point labeling using conditional random fields
— In this paper we present a new approach for labeling 3D points with different geometric surface primitives using a novel feature descriptor – the Fast Point Feature Histogram...
Radu Bogdan Rusu, Andreas Holzbach, Nico Blodow, M...