Abstract
In this chapter, we introduce some basics of machine learning. Specifically, we first give a brief introduction to regression and classification, which are typical machine learning tasks studied in the literature. To this end, we take linear regression, neural networks, support vector machines, Boosting, and K nearest neighbors as examples, introduce their basic ideas, and discuss their properties. Many of these algorithms have been extended to handle the problem of learning to rank. Then, we move onto the statistical learning theory, which is concerned with the theoretical guarantee of the generalization of a machine learning algorithm from the training set to the unseen test set. Familiarity with the notations and theorems mentioned in this chapter will be very helpful for the readers to understand different learning to rank algorithms and the statistical learning theory for ranking.
References
Bishop, C.M.: Pattern Recognition and Machine Learning. Springer, Berlin (2006)
Bousquet, O., Boucheron, S., Lugosi, G.: Introduction to statistical learning theory. In: Advanced Lectures on Machine Learning, pp. 169–207. Springer, Berlin (2004)
Mitchell, T.: Machine Learning. McGraw-Hill, New York (1997)
Ng, A.: Lecture notes for machine learning. Stanford University cs229 (2010). http://see.stanford.edu/see/courseinfo.aspx?coll=348ca38a-3a6d-4052-937d-cb017338d7b1s
Vapnik, V.N.: Statistical Learning Theory. Wiley-Interscience, New York (1998)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Liu, TY. (2011). Machine Learning. In: Learning to Rank for Information Retrieval. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14267-3_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-14267-3_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14266-6
Online ISBN: 978-3-642-14267-3
eBook Packages: Computer ScienceComputer Science (R0)