Large-scale kernel machines / (Record no. 72884)

000 -LEADER
fixed length control field 03991nam a2200493 i 4500
001 - CONTROL NUMBER
control field 6267226
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20220712204604.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 151223s2007 maua ob 001 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
-- print
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9780262255790
-- ebook
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
-- electronic
082 04 - CLASSIFICATION NUMBER
Call Number 005.7/3
245 00 - TITLE STATEMENT
Title Large-scale kernel machines /
300 ## - PHYSICAL DESCRIPTION
Number of Pages 1 PDF (xii, 396 pages) :
490 1# - SERIES STATEMENT
Series statement Neural information processing series
520 ## - SUMMARY, ETC.
Summary, etc Pervasive and networked computers have dramatically reduced the cost of collecting and distributing large datasets. In this context, machine learning algorithms that scale poorly could simply become irrelevant. We need learning algorithms that scale linearly with the volume of the data while maintaining enough statistical efficiency to outperform algorithms that simply process a random subset of the data. This volume offers researchers and engineers practical solutions for learning from large scale datasets, with detailed descriptions of algorithms and experiments carried out on realistically large datasets. At the same time it offers researchers information that can address the relative lack of theoretical grounding for many useful algorithms. After a detailed description of state-of-the-art support vector machine technology, an introduction of the essential concepts discussed in the volume, and a comparison of primal and dual optimization techniques, the book progresses from well-understood techniques to more novel and controversial approaches. Many contributors have made their code and data available online for further experimentation. Topics covered include fast implementations of known algorithms, approximations that are amenable to theoretical guarantees, and algorithms that perform well in practice but are difficult to analyze theoretically.ContributorsL�on Bottou, Yoshua Bengio, St�phane Canu, Eric Cosatto, Olivier Chapelle, Ronan Collobert, Dennis DeCoste, Ramani Duraiswami, Igor Durdanovic, Hans-Peter Graf, Arthur Gretton, Patrick Haffner, Stefanie Jegelka, Stephan Kanthak, S. Sathiya Keerthi, Yann LeCun, Chih-Jen Lin, Ga�l�le Loosli, Joaquin Qui�onero-Candela, Carl Edward Rasmussen, Gunnar R�tsch, Vikas Chandrakant Raykar, Konrad Rieck, Vikas Sindhwani, Fabian Sinz, S�ren Sonnenburg, Jason Weston, Christopher K. I. Williams, Elad Yom-TovL�on Bottou is a Research Scientist at NEC Labs America. Olivier Chapelle is with Yahoo! Research. He is editor of Semi-Supervised Learning (MIT Press, 2006). Dennis DeCoste is with Microsoft Research. Jason Weston is a Research Scientist at NEC Labs America.
700 1# - AUTHOR 2
Author 2 Bottou, L�eon.
856 42 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267226
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cambridge, Massachusetts :
-- MIT Press,
-- c2007.
264 #2 -
-- [Piscataqay, New Jersey] :
-- IEEE Xplore,
-- [2007]
336 ## -
-- text
-- rdacontent
337 ## -
-- electronic
-- isbdmedia
338 ## -
-- online resource
-- rdacarrier
588 ## -
-- Description based on PDF viewed 12/23/2015.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Data structures (Computer science)
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Machine learning.

No items available.