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

Authors

1.3K

  1. MW
    Michael W. Mahoney

    University of California, Berkeley, United States

    8 publications · 1.2K citations

    9

    h-index

  2. JA
    Johan A. K. Suykens

    KU Leuven, Belgium

    9 publications · 380 citations

    9

    h-index

  3. SL
    Shizhong Liao

    Tianjin University, China

    7 publications · 177 citations

    7

    h-index

  4. RS
    Robert Schaback

    University of Göttingen, Germany

    7 publications · 577 citations

    7

    h-index

  5. JC
    Jiun‐Shyan Chen

    University of California San Diego, United States

    7 publications · 363 citations

    7

    h-index

1–5 of 1.3K

Venues

  1. arXiv (Cornell University)

    Repository · 66 publications · 2K citations

    23

    h-index

  2. IEEE Transactions on Neural Networks

    13 publications · 3.1K citations

    13

    h-index

  3. IEEE Transactions on Pattern Analysis and Machine Intelligence

    TPAMI · 10 publications · 1.5K citations

    10

    h-index

  4. Neurocomputing

    10 publications · 286 citations

    10

    h-index

  5. Neural Information Processing Systems

    Conference · 8 publications · 258 citations

    8

    h-index

1–5