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

Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

Originalsprog	Engelsk
Titel	KDD '13 Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Forlag	Association for Computing Machinery
Publikationsdato	2013
Sider	239-249
ISBN (Trykt)	978-1-4503-2174-7
Status	Udgivet - 2013

Citationsformater

@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. s. 239-249.

Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review