Large-scale kernel machines / [edited by] L�eon Bottou ... [et al.].
Contributor(s): Bottou, L�eon
| IEEE Xplore (Online Service) [distributor.] | MIT Press [publisher.].
Material type: 
BookSeries: Neural information processing series: Publisher: Cambridge, Massachusetts : MIT Press, c2007Distributor: [Piscataqay, New Jersey] : IEEE Xplore, [2007]Description: 1 PDF (xii, 396 pages) : illustrations.Content type: text Media type: electronic Carrier type: online resourceISBN: 9780262255790.Subject(s): Data structures (Computer science) | Machine learningGenre/Form: Electronic books.Additional physical formats: Print version: No titleDDC classification: 005.7/3 Online resources: Abstract with links to resource Also available in print.Summary: 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.
Includes bibliographical references (p. [361]-387) and index.
Restricted to subscribers or individual electronic text purchasers.
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.
Also available in print.
Mode of access: World Wide Web
Description based on PDF viewed 12/23/2015.
There are no comments for this item.