MARC 닫기
00000nam c22002058c 4500
000000523252
20180611142649
171227s2014 nyua b 001 0 eng
▼a 9781107057135 (hardback)
▼a (KERIS)BIB000013502181
▼a 211047
▼c 211047
▼d 211047
▼a Shalev-Shwartz, Shai.
▼a Understanding machine learning:
▼b from foundations to algorithms/
▼d by Shai Shalev-Shwartz,
▼e Shai Ben-David.
▼a New York, NY:
▼b Cambridge University Press,
▼c 2014.
▼a xvi, 397 p.:
▼b ill.;
▼c 26 cm.
▼a Includes bibliographical references and index.
▼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.
▼a Machine learning.
▼a Algorithms.
▼a COMPUTERS / Computer Vision & Pattern Recognition.
▼2 bisacsh
▼a Ben-David, Shai.
▼a 하한보배
▼a 단행본
▼a 006.31
▼b Sh1u
| 자료유형 : | 단행본 |
|---|---|
| ISBN : | 9781107057135 (hardback) |
| 개인저자 : | Shalev-Shwartz, Shai. |
| 서명/저자사항 : | Understanding machine learning: from foundations to algorithms/ by Shai Shalev-Shwartz, Shai Ben-David. |
| 발행사항 : | New York, NY: Cambridge University Press, 2014. |
| 형태사항 : | xvi, 397 p.: ill.; 26 cm. |
| 서지주기 : | Includes bibliographical references and index. |
| 내용주기 : | 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. |
| 일반주제명 : | Machine learning. -- |
| 일반주제명 : | Algorithms. -- |
| 일반주제명 : | COMPUTERS / Computer Vision & Pattern Recognition. -- |
| 개인저자 : | Ben-David, Shai. |
| 분류기호 : | 006.31 |
| 언어 | 영어 |
서평쓰기