Fast and Scalable Polynomial Kernels via Explicit Feature Maps¶

Pham, N., & Pagh, R. (2013). Fast and Scalable Polynomial Kernels via Explicit Feature Maps. Proceedings of KDD 2013, 239-247.

Type: Conference paper
Intellectual base: Primary research
Year: 2013
Pages: 239-247
DOI: 10.1145/2487575.2487591
DOI registrant: Association for Computing Machinery
Link: https://doi.org/10.1145/2487575.2487591

Cited by¶

1 citation across 1 artifact.

Domain-specific¶

Tensor Sketch
- The result approximates inner products and norms of polynomial-feature tensors in a much smaller dimension.

Verification¶

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:112796942725 · see in the full table