Fast and Scalable Polynomial Kernels via Explicit Feature Maps

Ninh Dang Pham; Rasmus Pagh

Fast and Scalable Polynomial Kernels via Explicit Feature Maps

Ninh Dang Pham
, Rasmus Pagh

Algorithms

Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

Original language	English
Title of host publication	KDD '13 Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Publisher	Association for Computing Machinery
Publication date	2013
Pages	239-249
ISBN (Print)	978-1-4503-2174-7
Publication status	Published - 2013

Cite this

@inproceedings{6539633d7102495cb0ddf08fa4426dc4,

title = "Fast and Scalable Polynomial Kernels via Explicit Feature Maps",

author = "Pham, \{Ninh Dang\} and Rasmus Pagh",

year = "2013",

language = "English",

isbn = " 978-1-4503-2174-7",

pages = "239--249",

booktitle = "KDD '13 Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining",

publisher = "Association for Computing Machinery",

address = "United States",

}

Fast and Scalable Polynomial Kernels via Explicit Feature Maps. / Pham, Ninh Dang; Pagh, Rasmus.
KDD '13 Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining. Association for Computing Machinery, 2013. p. 239-249.

Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review