Kernel Approximation
Kernel Approximation is a method in machine learning that belongs to the class of feature mapping techniques, specifically distinguished by its approach of approximating the implicit high-dimensional feature space induced by a kernel function using explicit, computationally tractable feature representations, often to enable scalable linear methods in lieu of kernelized algorithms.
613
Publications
41.9K
Citations
1.3K
Authors
539
Institutions
Publications per year
2017–2026
204
613
Random Features for Large-Scale Kernel Machines
Ali Rahimi, Benjamin Recht · 2007 · 2.7K citations
Using the Nyström Method to Speed Up Kernel Machines
Christopher K. I. Williams, Matthias Seeger · 2000 · 1.5K citations
1–5 of 613
1.3K
9
h-index
9
h-index
7
h-index
7
h-index
7
h-index
1–5 of 1.3K
539
University of California, Berkeley
Berkeley, United States
12 h-index
21 publications
1.3K citations

Cornell University
Ithaca, United States
11 h-index
19 publications
1.4K citations
Stanford University
Stanford, United States
11 h-index
21 publications
813 citations
KU Leuven
Leuven, Belgium
11 h-index
30 publications
1.8K citations
The University of Texas at Austin
Austin, United States
11 h-index
28 publications
1K citations
Carnegie Mellon University
Pittsburgh, United States
10 h-index
23 publications
731 citations
Georgia Institute of Technology
Atlanta, United States
10 h-index
17 publications
344 citations

Centre National de la Recherche Scientifique
Paris, France
9 h-index
14 publications
636 citations
1–8 of 539
Repository · 66 publications · 2K citations
23
h-index
13 publications · 3.1K citations
13
h-index
TPAMI · 10 publications · 1.5K citations
10
h-index
10 publications · 286 citations
10
h-index
Conference · 8 publications · 258 citations
8
h-index
1–5