Jump to ContentJump to Main Navigation
Fundamentals of Machine Learning$
Users without a subscription are not able to see the full content.

Thomas P. Trappenberg

Print publication date: 2019

Print ISBN-13: 9780198828044

Published to Oxford Scholarship Online: January 2020

DOI: 10.1093/oso/9780198828044.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 23 July 2021

Introduction

Introduction

Chapter:
(p.1) 1 Introduction
Source:
Fundamentals of Machine Learning
Author(s):

Thomas P. Trappenberg

Publisher:
Oxford University Press
DOI:10.1093/oso/9780198828044.003.0001

This chapter provides a high-level overview of machine learning, in particular how it is related to building models from data. It starts with placing the basic concept in its historical context and phrases the learning problem in a simple mathematical term as function approximation as well as in a probabilistic context. In contrast to more traditional models, machine learning can be characterized as non-linear regression in high-dimensional spaces. This chapter points out how diverse subareas such as deep learning and Bayesian networks fit into the scheme of things and motivates further study with some examples of recent progress.

Keywords:   function approximation, non-linear regression, probabilistic context, historical context, mathematical formulation

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .