<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>03198cam a22003015a 4500</leader>
  <controlfield tag="001">18053648</controlfield>
  <controlfield tag="003">OSt</controlfield>
  <controlfield tag="005">20201128021505.0</controlfield>
  <controlfield tag="008">140304t2014    nyua   frb   f001 0 eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9781107057135 (hardback)</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">1107057132 (hardback)</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">DLC</subfield>
    <subfield code="b">eng</subfield>
    <subfield code="c">DLC</subfield>
    <subfield code="d">DLC</subfield>
    <subfield code="d">EG-ScBUE</subfield>
  </datafield>
  <datafield tag="082" ind1="0" ind2="4">
    <subfield code="a">006.31</subfield>
    <subfield code="2">23</subfield>
    <subfield code="b">SHA</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Shalev-Shwartz, Shai.</subfield>
    <subfield code="9">38870</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Understanding machine learning :</subfield>
    <subfield code="b">from foundations to algorithms /</subfield>
    <subfield code="c">Shai Shalev-Shwartz, Jerusalem, Shai Ben-David.</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">New York :</subfield>
    <subfield code="b">Cambridge University Press,</subfield>
    <subfield code="c">c.2014.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xvi, 397 p. :</subfield>
    <subfield code="b">ill. ;</subfield>
    <subfield code="c">26 cm.</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Index : p. 395-397.</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
    <subfield code="a">Bibliography : p. 385-393.</subfield>
  </datafield>
  <datafield tag="505" ind1="8" ind2=" ">
    <subfield code="a">Machine generated contents note: 1. Introduction; Part I. Foundations: 2. A gentle start; 3. A formal learning model; 4. Learning via uniform convergence; 5. The bias-complexity tradeoff; 6. The VC-dimension; 7. Non-uniform learnability; 8. The runtime of learning; Part II. From Theory to Algorithms: 9. Linear predictors; 10. Boosting; 11. Model selection and validation; 12. Convex learning problems; 13. Regularization and stability; 14. Stochastic gradient descent; 15. Support vector machines; 16. Kernel methods; 17. Multiclass, ranking, and complex prediction problems; 18. Decision trees; 19. Nearest neighbor; 20. Neural networks; Part III. Additional Learning Models: 21. Online learning; 22. Clustering; 23. Dimensionality reduction; 24. Generative models; 25. Feature selection and generation; Part IV. Advanced Theory: 26. Rademacher complexities; 27. Covering numbers; 28. Proof of the fundamental theorem of learning theory; 29. Multiclass learnability; 30. Compression bounds; 31. PAC-Bayes; Appendix A. Technical lemmas; Appendix B. Measure concentration; Appendix C. Linear algebra.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">"Machine learning is one of the fastest growing areas of computer science, with far-reaching applications. The aim of this textbook is to introduce machine learning, and the algorithmic paradigms it offers, in a principled way. The book provides an extensive theoretical account of the fundamental ideas underlying machine learning and the mathematical derivations that transform these principles into practical algorithms. Following a presentation of the basics of the field, the book covers a wide array of central topics that have not been addressed by previous textbooks. These include a discussion of the computational complexity of learning and the concepts of convexity and stability; important algorithmic paradigms including stochastic gradient descent, neural networks, and structured output learning; and emerging theoretical concepts such as the PAC-Bayes approach and compression-based bounds. Designed for an advanced undergraduate or beginning graduate course, the text makes the fundamentals and algorithms of machine learning accessible to students and non-expert readers in statistics, computer science, mathematics, and engineering"--</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="7">
    <subfield code="a">Machine learning.</subfield>
    <subfield code="2">BUEsh</subfield>
    <subfield code="9">2922</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="7">
    <subfield code="a">Algorithms.</subfield>
    <subfield code="2">BUEsh</subfield>
    <subfield code="9">13108</subfield>
  </datafield>
  <datafield tag="651" ind1=" " ind2=" ">
    <subfield code="2">BUEsh</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="b">COMSCI</subfield>
    <subfield code="c">August2015</subfield>
    <subfield code="c">December2015</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Ben-David, Shai.</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">ddc</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">20531</subfield>
    <subfield code="d">20503</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="2">ddc</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="8">Baccah</subfield>
    <subfield code="a">MAIN</subfield>
    <subfield code="b">MAIN</subfield>
    <subfield code="c">LOW</subfield>
    <subfield code="d">2015-08-16</subfield>
    <subfield code="e">Purchase</subfield>
    <subfield code="g">1013.00</subfield>
    <subfield code="h">21759</subfield>
    <subfield code="l">2</subfield>
    <subfield code="m">16</subfield>
    <subfield code="o">006.31 SHA</subfield>
    <subfield code="p">000030815</subfield>
    <subfield code="r">2025-07-15 00:00:00</subfield>
    <subfield code="s">2019-04-09</subfield>
    <subfield code="v">1266.00</subfield>
    <subfield code="y">BB</subfield>
  </datafield>
</record>
