References:
Two ways: Group them by learning style, and by their similarity in form or function.
cite: https://machinelearningmastery.com/a-tour-of-machine-learning-algorithms/
Supervised learning: all training data with known labels.
Unsupervised learning: Input data is not labeled.
Semi-Supervised learning: input data is a mixture of labeled and unlabelled examples.
cite: https://machinelearningmastery.com/a-tour-of-machine-learning-algorithms/
Algorithms grouped by similarities of how they work:
Regression Algorithms. Modeling the relationship between variables that is iteratively refined using a measure of error in the predictions made by the model. used in statistical machine learning.
Instance-based Algorithms. Winner-take-all methods, memory-based learning. Find the best match between new data and existing data. Focus is on the representation of the stored instances and similarity measures used between instances.
Regularization Algorithms.
Decision Tree Algorithms.
Clustering Algorithms.
Association Rule Learning Algorithms. extract rules that best explain observed relationships between variables in the data.
Aritificial Neural Network ALgorithm. inspired by the structure/function of biological neural networks. Enormous field comprised of hundreds of algorithms and variants for all manner of problem types.
Dimensionality Reduction Algorithms. Unsupervised manner. Describe data using less information. Useful to visualize dimensional data or to simplify data then to be used by supervised learning. Classification, regression.
Ensemble Algorithms. combination of weaker models. Focus on what types of weak learners to combine and the ways in which to combine them.
Evolutionary Algorithms (EA).
Algorithms of subfields in ML.
Algorithms for special tasks in ML.
References: Kernel Functions Machine Learning is the field of study that gives computers the ability to learn without being explicitly programmed. – Arthur Samuel in 1959. A computer program is said to learn from experience E with respect to some task T and some performance measure P, if its performance on T, as measured by P, improves with experience E. – Tom Michell, CMU. Support Vector Machines:
If you could revise
the fundmental principles of
computer system design
to improve security...
... what would you change?