Sciweavers

37 search results - page 3 / 8
» Measuring the Related Properties of Linearity and Elongation...
Sort
View
JCB
2002
70views more  JCB 2002»
13 years 6 months ago
Strong Feature Sets from Small Samples
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...
Seungchan Kim, Edward R. Dougherty, Junior Barrera...
AAAI
2010
13 years 7 months ago
Conformal Mapping by Computationally Efficient Methods
Dimensionality reduction is the process by which a set of data points in a higher dimensional space are mapped to a lower dimension while maintaining certain properties of these p...
Stefan Pintilie, Ali Ghodsi
SDM
2008
SIAM
120views Data Mining» more  SDM 2008»
13 years 7 months ago
Spatial Scan Statistics for Graph Clustering
In this paper, we present a measure associated with detection and inference of statistically anomalous clusters of a graph based on the likelihood test of observed and expected ed...
Bei Wang, Jeff M. Phillips, Robert Schreiber, Denn...
TSP
2008
101views more  TSP 2008»
13 years 6 months ago
Bayesian Compressive Sensing
The data of interest are assumed to be represented as N-dimensional real vectors, and these vectors are compressible in some linear basis B, implying that the signal can be recons...
Shihao Ji, Ya Xue, Lawrence Carin
COMPGEOM
2006
ACM
13 years 8 months ago
On the ICP algorithm
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
Esther Ezra, Micha Sharir, Alon Efrat