Efficient subset selection via the kernelized Rényi distance

@article{Srinivasan2009EfficientSS,
  title={Efficient subset selection via the kernelized R{\'e}nyi distance},
  author={Balaji Vasan Srinivasan and Ramani Duraiswami},
  journal={2009 IEEE 12th International Conference on Computer Vision},
  year={2009},
  pages={1081-1088}
}
With improved sensors, the amount of data available in many vision problems has increased dramatically and allows the use of sophisticated learning algorithms to perform inference on the data. However, since these algorithms scale with data size, pruning the data is sometimes necessary. The pruning procedure must be statistically valid and a representative subset of the data must be selected without introducing selection bias. Information theoretic measures have been used for sampling the data… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Gaussian Processes for Machine Learning

Advanced Lectures on Machine Learning • 2009
View 6 Excerpts
Highly Influenced

Sparse On-Line Gaussian Processes

Neural Computation • 2002
View 6 Excerpts
Highly Influenced

The Relevance Vector Machine

NIPS • 1999
View 5 Excerpts
Highly Influenced

A Tutorial on Support Vector Machines for Pattern Recognition

Data Mining and Knowledge Discovery • 1998
View 5 Excerpts
Highly Influenced

Fast image search for learned metrics

2008 IEEE Conference on Computer Vision and Pattern Recognition • 2008
View 1 Excerpt

Similar Papers

Loading similar papers…