Sciweavers

356 search results - page 14 / 72
» Solving the Small Sample Size Problem of LDA
Sort
View
CORR
2011
Springer
186views Education» more  CORR 2011»
13 years 2 months ago
Similarity Join Size Estimation using Locality Sensitive Hashing
Similarity joins are important operations with a broad range of applications. In this paper, we study the problem of vector similarity join size estimation (VSJ). It is a generali...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
SSPR
1998
Springer
13 years 11 months ago
Regularization by Adding Redundant Features
The Pseudo Fisher Linear Discriminant (PFLD) based on a pseudo-inverse technique shows a peaking behaviour of the generalization error for training sample sizes that are about the...
Marina Skurichina, Robert P. W. Duin
PRICAI
2004
Springer
14 years 25 days ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
GECCO
2008
Springer
126views Optimization» more  GECCO 2008»
13 years 8 months ago
The impact of population size on code growth in GP: analysis and empirical validation
The crossover bias theory for bloat [18] is a recent result which predicts that bloat is caused by the sampling of short, unfit programs. This theory is clear and simple, but it ...
Riccardo Poli, Nicholas Freitag McPhee, Leonardo V...
STACS
2009
Springer
14 years 1 days ago
Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...
Mahdi Cheraghchi, Amin Shokrollahi