2011

AUTHORS TITLE

Machine Learning

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.

Related objects

How to use: Click on a object to move its position. Double click to open its homepage. Right click to preview its contents.

25 TRIPLES      25 PREDICATES      22 URIs      14 LITERALS

Subject Predicate Object
1 book-chapters:e238ec89e0f3a6865ff6b43793237b04 sg:abstract 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.
2 sg:abstractRights OpenAccess
3 sg:bibliographyRights Restricted
4 sg:bodyHtmlRights Restricted
5 sg:bodyPdfRights Restricted
6 sg:chapterNumber Chapter 22
9 sg:ddsId Chap22
10 sg:doi 10.1007/978-3-642-14267-3_22
11 sg:esmRights OpenAccess
12 sg:hasBook books:e6a055109c26a77783cc218e6d770cfd
13 sg:hasBookEdition book-editions:f69c2a63a05df6a398ca162092057324
14 sg:hasContributingOrganization grid-institutes:grid.466946.f
15 sg:hasContribution contributions:42514e22929ddc2f09ce45ba45b43bb2
16 sg:language En
19 sg:pageFirst 267
20 sg:pageLast 282
21 sg:scigraphId e238ec89e0f3a6865ff6b43793237b04
22 sg:title Machine Learning
24 rdf:type sg:BookChapter
25 rdfs:label BookChapter: Machine Learning
HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular JSON format for linked data.

`curl -H 'Accept: application/ld+json' 'http://scigraph.springernature.com/things/book-chapters/e238ec89e0f3a6865ff6b43793237b04'`

N-Triples is a line-based linked data format ideal for batch operations .

`curl -H 'Accept: application/n-triples' 'http://scigraph.springernature.com/things/book-chapters/e238ec89e0f3a6865ff6b43793237b04'`

`curl -H 'Accept: text/turtle' 'http://scigraph.springernature.com/things/book-chapters/e238ec89e0f3a6865ff6b43793237b04'`

RDF/XML is a standard XML format for linked data.

`curl -H 'Accept: application/rdf+xml' 'http://scigraph.springernature.com/things/book-chapters/e238ec89e0f3a6865ff6b43793237b04'`