HomeScience GlossaryMachine Learning Algorithms: How Computers Learn from Data

Machine Learning Algorithms: How Computers Learn from Data

Machine learning algorithms are mathematical procedures that enable computers to identify patterns in data and improve without explicit programming. Learn the three main types and how they work.

Share
Science Glossary · Explore this series
March 20, 2026
Key Takeaways
  • Machine learning algorithms let computers learn patterns from data without explicit programming.
  • Three main types exist: supervised, unsupervised, and reinforcement learning.
  • Arthur Samuel coined "machine learning" in 1959 with his IBM checkers program.

Machine learning algorithms are mathematical procedures that enable computers to identify patterns in data and improve their performance on tasks without explicit programming for each decision.

Why Machine Learning Algorithms Matter

Key figure

1959

Year Arthur Samuel coined 'machine learning' at IBM

Machine learning algorithms underpin most AI systems in daily use, from email spam filters to medical imaging tools that flag potential tumors. The algorithms themselves have become subjects of scientific inquiry, not just engineering tools.

The intersection of these algorithms with scientific discovery is a recurring theme in AI research. When researchers trained a neural network on millions of black hole simulations, the algorithm identified spin patterns that human analysis had missed. When AI drug discovery programs entered clinical trials, their success and failure traced directly to which algorithms processed molecular data.

The distinction between algorithm and model matters because the terms are often confused. In machine learning, an algorithm is the step-by-step mathematical procedure used to train a model. The model is the output. The algorithm is the recipe.

How Machine Learning Algorithms Work

Machine learning algorithms fall into three broad categories, each defined by how they learn from data.

Supervised learning algorithms train on labeled examples. Given thousands of images tagged "cat" or "not cat," a supervised algorithm adjusts its internal parameters until it can classify new images accurately. Linear regression, decision trees, and support vector machines are common supervised algorithms. Arthur Samuel's 1959 checkers program at IBM, widely considered the first self-learning program, used a form of supervised learning.

Key figure

3

Core algorithm types: supervised, unsupervised, reinforcement

Unsupervised learning algorithms receive data without labels. They find structure on their own, grouping similar data points into clusters or reducing complex datasets to their essential dimensions. K-means clustering and principal component analysis are standard tools in this category. Astronomers use unsupervised algorithms to sort galaxies by morphology without predefined categories.

Reinforcement learning algorithms learn through trial and error. An agent takes actions in an environment, receives rewards or penalties, and adjusts its strategy to maximize long-term reward. DeepMind's AlphaGo, which defeated world champion Lee Sedol in 2016, used reinforcement learning to discover Go strategies no human had played before.

A fourth approach, semi-supervised learning, combines labeled and unlabeled data. It is common in medical imaging, where labeled examples are expensive because each requires expert annotation.

Key Context

Arthur Samuel coined the phrase "machine learning" in a 1959 paper titled "Some Studies in Machine Learning Using the Game of Checkers," published in the IBM Journal of Research and Development. Samuel defined the field as giving "computers the ability to learn without being explicitly programmed." His checkers program played thousands of games against itself, improving with each iteration. Samuel (1901-1990) had joined IBM in Poughkeepsie, New York, in 1949.

The word "algorithm" itself traces to the 9th-century Persian mathematician Muhammad ibn Musa al-Khwarizmi, whose name was Latinized to "Algoritmi." Al-Khwarizmi's treatise on arithmetic introduced systematic problem-solving procedures to European mathematics. Every machine learning algorithm, however complex, follows this same principle: a defined sequence of steps applied to data.

FAQ

What is the difference between a machine learning algorithm and a model?

An algorithm is the mathematical procedure used during training. A model is the result of that training, a program that can make predictions on new data. The algorithm is the recipe; the model is the finished dish.

Can machine learning algorithms work without large datasets?

Some can. Few-shot learning techniques train on as few as five to ten examples per category. Transfer learning reuses models trained on large datasets, then fine-tunes them with small, specialized datasets. But most standard algorithms perform better with more data.

Why do machine learning algorithms sometimes produce biased results?

Algorithms learn patterns from their training data. If that data reflects historical biases, such as hiring data that favors one demographic, the algorithm will reproduce those patterns. The bias is in the data and the problem framing, not in the mathematics itself.

How are machine learning algorithms different from traditional programming?

In traditional programming, a developer writes explicit rules for every decision. In machine learning, the developer provides data and an algorithm, and the system derives its own rules through training. The programmer defines the learning process, not the outcome.

Related Reading

Generative AI
Generative AI: How Machines Learned to Create
Agentic AI
Agentic AI: The Machines That Act on Their Own
Data Quality in AI
Data Quality in AI: Why Better Data Beats Better Models
AIOps (AI for IT Operations)
AIOps: How AI Automates IT Operations

Sources

Fact Check: Claim-by-Claim Verification Verified

All core claims verified against primary sources. Historical attributions, algorithm classifications, and named examples confirmed accurate.

1 Supported
Arthur Samuel coined "machine learning" in 1959
2 Mostly supported
Samuel's checkers program was the first self-learning program
Widely cited as among the first; some sources note Christopher Strachey's 1951 program as earlier AI work, though Samuel's was specifically self-learning.
3 Supported
DeepMind's AlphaGo defeated Lee Sedol in 2016 using reinforcement learning
Well-documented event. AlphaGo used a combination of deep neural networks and reinforcement learning.
4 Supported
Three main algorithm types: supervised, unsupervised, reinforcement
Standard classification in IBM and MIT Sloan references.
5 Supported
"Algorithm" derives from al-Khwarizmi's name
Established etymological fact confirmed across multiple academic sources.

Sources used for verification

Share
Related Articles
AI In Science Connects the Dots, But Only In Fields That Are Fragmented

An analysis of 80 million papers shows AI boosts originality where knowledge is scattered and connections are weak, but contributes little novelty in structured science.

"Keep Humanity Safe From AI," Urges Pope Leo XIV

Pope Leo XIV's first encyclical reaches the same verdict on AI as the labs building it, then parts ways over the meaning of human limits.

AI Solves Erdős Math Problem: What's Next for AI in Mathematics?

An AI solved an 80-year-old Erdős math problem by walking a path mathematicians had collectively avoided.

Is AI Making You Dumber? Not If You Challenge It

Cognitive debt is the cost of letting AI think for you. New research shows the difference between healthy and harmful AI use comes down to one habit.