You are on page 1of 2

Contents

1 Overview
1.1 Machine learning tasks
2 History and relationships to other fields
2.1 Relation to data mining
2.2 Relation to optimization
2.3 Relation to statistics
3 Theory
4 Approaches
4.1 Types of learning algorithms
4.1.1 Supervised learning
4.1.2 Unsupervised learning
4.1.3 Reinforcement learning
4.1.4 Feature learning
4.1.5 Sparse dictionary learning
4.1.6 Anomaly detection
4.1.7 Association rules
4.2 Models
4.2.1 Artificial neural networks
4.2.2 Decision trees
4.2.3 Support vector machines
4.2.4 Bayesian networks
4.2.5 Genetic algorithms
4.3 Training models
4.3.1 Federated learning
5 Applications
6 Limitations
6.1 Bias
7 Model assessments
8 Ethics
9 Software
9.1 Free and open-source software
9.2 Proprietary software with free and open-source editions
9.3 Proprietary software
10 Journals
11 Conferences
12 See also
13 References
14 Further reading
15 External links

A support vector machine is a supervised learning model that divides the data into
regions separated by a linear boundary. Here, the linear boundary divides the black
circles from the white.
Machine learning tasks are classified into several broad categories. In supervised
learning, the algorithm builds a mathematical model from a set of data that
contains both the inputs and the desired outputs. For example, if the task were
determining whether an image contained a certain object, the training data for a
supervised learning algorithm would include images with and without that object
(the input), and each image would have a label (the output) designating whether it
contained the object. In special cases, the input may be only partially available,
or restricted to special feedback.[clarification needed] Semi-supervised learning
algorithms develop mathematical models from incomplete training data, where a
portion of the sample input doesn't have labels.

Classification algorithms and regression algorithms are types of supervised


learning. Classification algorithms are used when the outputs are restricted to a
limited set of values. For a classification algorithm that filters emails, the
input would be an incoming email, and the output would be the name of the folder in
which to file the email. For an algorithm that identifies spam emails, the output
would be the prediction of either "spam" or "not spam", represented by the Boolean
values true and false. Regression algorithms are named for their continuous
outputs, meaning they may have any value within a range. Examples of a continuous
value are the temperature, length, or price of an object.

You might also like