Answers are grounded in this paper and cite their sources.
We propose hashing to facilitate efficient kernels. This generalizes previous work using sampling and we show a principled way to compute the kernel matrix for data streams and sparse feature spaces. Moreover, we give deviation bounds from the exact kernel matrix. This has applications to estimation on strings and graphs
No takes yet. Share an insight, caveat, or question.
Shi et al. (2009) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: