Apache Sqoop moved data between Hadoop and relational databases for most of a decade, and it was retired to the Apache Attic in June 2021. Apache Mahout, once the standard answer to running machine learning on a cluster, now opens its homepage with Qumat, a quantum-computing library. RapidMiner's product page redirects to siemens.com. The words those tools were sold under outlived the tools, and they are now loose enough that two people can agree on a project and each picture a different job.
The short version, before the detail. Data mining discovers patterns in data you already hold. Machine learning fits a model that makes a call on data it has never seen. Mining looks backwards and ends in something a person reads. Learning looks forwards and ends in something a program runs after everyone has gone home.
Every version number, release date and price below was read from the project's own repository, release index or pricing page on 10 August 2026. Studies, surveys and news are named in the text with their date instead of linked. Two sections carry corrections: one to claims that circulate in nearly every article on this subject, and one to the earlier version of this article, which used a wrong example of machine learning in production and repeated a definition that does not exist.
What actually separates them
The clean split is goal and direction in time. Mining is descriptive: you have a pile of history and you want to know what is in it, which groups exist, what co-occurs, what looks wrong. Success is a finding a human can act on. Learning is predictive: you want something that takes a new record and returns a label, a number or a decision. Success is accuracy on records the model has never met.
They share a toolbox, which is exactly why they blur. Decision trees, k-means, regression and neural networks all appear on both sides of the line. The difference is not the algorithm, it is what you keep at the end: an insight, or a reusable predictor.
There is a lineage difference underneath. Mining grew out of databases and statistics, from the problem of querying enormous stored datasets for structure. Learning grew out of artificial intelligence, from the ambition of systems that improve themselves. That history shows up as the feedback loop. A mining analysis has none: you run it, you read it, you stop. A machine-learning system is defined by the loop, because a model that never sees its own outcomes is a model nobody is maintaining.
Mining ends in a sentence. Learning ends in an artefact that keeps working, or keeps failing, on its own.
Six words, and what each one actually claims
- Data mining. Sifting stored data for patterns nobody specified in advance. The academic literature is stricter than the trade press here, and the strictness is worth borrowing. In their 1996 AI Magazine paper, Fayyad, Piatetsky-Shapiro and Smyth defined knowledge discovery in databases as "the nontrivial process of identifying valid, novel, potentially useful, and ultimately understandable patterns in data", and were explicit that "KDD refers to the overall process of discovering useful knowledge from data, and data mining refers to a particular step in this process". They also recorded the term's reputation: "The term data mining has had negative connotations in statistics since the 1960s when computer-based data analysis techniques were first introduced." The phrase knowledge discovery in databases was coined at the first KDD workshop in 1989 to put the emphasis on knowledge as the end product, a distinction we unpack in data, information and knowledge. Both halves survive in the field's own naming: ACM SIGKDD still calls itself the special interest group on Knowledge Discovery and Data Mining, and KDD 2026 runs 9–13 August in Jeju, Korea. Our primer on what data mining is covers the method side.
- Machine learning. Algorithms that fit a model from examples and then generalise to new inputs. The definition worth memorising is Tom Mitchell's, from his 1997 textbook: a program learns from experience E with respect to a class of tasks T and a performance measure P if its performance at tasks in T, measured by P, improves with experience E. It is not elegant, and it is the only common definition that tells you what to build: name the task, name the measure, name the experience. If you cannot name all three, you do not yet have a machine-learning problem.
- Big data. Not a technique. A statement about scale and the architecture scale forces on you. The formal version comes from NIST, whose Big Data Interoperability Framework (SP 1500-1r2, October 2019) defines it as "extensive datasets, primarily in the characteristics of volume, variety, velocity, and/or variability, that require a scalable architecture for efficient storage, manipulation, and analysis". Note the four characteristics and the load-bearing clause at the end: the definition is about what the data forces you to build, not about a row count.
- Data analysis. Interrogating data to answer a question you already have. One question, one answer, usually statistics and a chart.
- Data analytics. The discipline and the tooling around that act, including the part where findings become dashboards, KPIs and forecasts other people look at. Analysis is the work; analytics is the practice plus the packaging.
- Data science. The umbrella: problem framing, collection, exploration, mining, modelling, visualisation, deployment. It is also a job title with real numbers attached. The US Bureau of Labor Statistics counts 245,900 data scientists in 2024, median pay $112,590 a year as of May 2024, and projects 34% growth to 2034. Davenport and Patil, who called it the sexiest job of the 21st century in Harvard Business Review in October 2012, revisited it there in July 2022 and argued the role had been institutionalised, split apart and partly automated, and that companies should build teams instead of hunting for unicorns.
Comparison table
| Aspect | Data mining | Machine learning |
|---|---|---|
| What you keep | A finding, plus the query that produced it | An artefact that keeps answering after you stop watching |
| Direction in time | Backwards, over records already stored | Forwards, on records that do not exist yet |
| Origin | Databases and statistics; the term carried a bad smell in statistics from the 1960s and was formalised as one step of KDD in 1996 | Artificial intelligence; defined operationally as improving at a task, on a measure, with experience |
| Who judges it | A domain expert reading the result | A held-out set, scored |
| Characteristic failure | A pattern that is real in this data and nowhere else | A model that scores well on the test set and decays in production |
| Feedback loop | Usually none; run, read, stop | The whole point |
| Classic methods | Apriori and FP-growth, association rules, k-means and DBSCAN, outlier detection | Regression, SVMs, gradient boosting, neural networks |
| Runs when | Ad hoc, when somebody has a question | On a schedule, in production, and again when it drifts |
| Process model | CRISP-DM, six phases, published 1999 | No comparable consensus; MLOps practice differs by vendor |
Where the tidy line breaks
Unsupervised methods sit on both sides. Clustering is the obvious case. Run k-means to understand your customer base and you are mining. Run the same k-means to assign every incoming customer to a segment that drives a pricing rule and you have a model in production. Nothing about the algorithm changed, only whether anything downstream consumes the output automatically.
The feedback loop is an operational property, not a mathematical one. A gradient-boosted model that nobody retrains is a frozen description of a dataset from eighteen months ago. It is machine learning by construction and data mining by behaviour, which is why "does it learn from its own outcomes" is a better interview question than "which library did you use".
The law uses one of these words to mean something else entirely. In EU copyright, text and data mining is a defined term covering any automated analytical technique applied to text and data in digital form to generate information, including patterns, trends and correlations. Articles 3 and 4 of Directive (EU) 2019/790 build exceptions on it, with Article 4 letting rightsholders reserve their works from commercial mining through machine-readable means. Training a language model on scraped pages falls inside that definition. So does a SQL query that counts word frequencies. If you write a data protection or licensing memo using the engineering sense of the phrase, you will get the scope wrong in both directions.
Two traps you can reproduce in a minute
Both disciplines have a default metric that flatters the work, and in both cases the failure is quiet. The numbers below came from a script run on a two-vCPU container with Python 3.11.15, NumPy 2.4.4, pandas 3.0.2 and scikit-learn 1.8.0, seeded so it repeats. Same seed, same figures; the shape holds for any seed.
Trap one: the support threshold keeps the rules that tell you nothing. Association-rule mining ranks candidates by support (how often the pair appears) and confidence (how often B appears given A). Both reward items that are merely common.
import numpy as np
rng = np.random.default_rng(20260810)
n = 200_000
bread = rng.random(n) < 0.60
butter = rng.random(n) < 0.20 # independent of bread
tea = rng.random(n) < 0.10
lemon = rng.random(n) < np.where(tea, 0.30, 0.04) # genuinely dependent
def rule(a, b):
conf = b[a].mean()
return (a & b).mean(), conf, conf / b.mean() # support, confidence, lift
print("butter -> bread", rule(butter, bread)) # 0.1200 0.5993 1.002
print("tea -> lemon", rule(tea, lemon)) # 0.0297 0.2996 4.588Butter and bread are independent by construction, and the rule still reports 12% support and 60% confidence. It clears a 5% support, 50% confidence filter comfortably, and it is worth exactly nothing: lift 1.002 means knowing about the butter told you nothing about the bread. The tea and lemon rule, where the dependency is real and large, has 3% support and gets deleted by that same filter. Sort by lift, and set minimum support to control runtime rather than to decide what is interesting.
Trap two: accuracy on a rare outcome is a compliment you pay yourself. On a synthetic 200,000-row dataset with a 1.99% positive rate, predicting "no" for every record scores 98.01% accuracy. A logistic regression trained on the same data also scores 98.01%, because at a 0.5 threshold it says no to nearly everything: recall 0.0008. The model is not useless, and accuracy cannot tell you that. ROC-AUC is 0.805 and average precision 0.116 against a 0.0198 base rate, so the signal is there and the threshold has to be chosen for the cost of a miss. Report accuracy on an imbalanced target and you ship a classifier that learned the majority class.
Trap three is arithmetic and needs no script. Mine a catalogue of 1,000 items for co-occurring pairs and you are testing 499,500 hypotheses. At a 5% significance level, roughly 24,975 will look significant with no relationship behind them. Mining generates false discoveries in proportion to how hard it looked, which is the honest reason statisticians distrusted the phrase. Hold out a time window and re-test the survivors, or expect to brief executives on noise.
How they chain in one pipeline
In practice these are stages, not rivals.
- You mine a historical extract to learn what is in it: which segments exist, which fields correlate, which records are broken.
- Those findings decide feature engineering and, more often, whether the problem as posed is answerable at all.
- You train a model on the same history to turn a description into a prediction.
- In production the model's outcomes become new data, which you mine again, usually because something has gone wrong.
The framework built for step-by-step honesty here is CRISP-DM, the Cross-Industry Standard Process for Data Mining, published in 1999 with six phases from business understanding through deployment. Its own domain, crisp-dm.org, did not answer when we tried it on 10 August 2026, but the method is still documented inside commercial products, including IBM SPSS Modeler. A twenty-seven-year-old process model nobody has replaced tells you how much of this work is unchanged.
So the versus framing is usually a false choice. Mining is the exploratory front end, learning is the operational back end, and teams get into trouble when they skip the front end because the library was easier to install.
Big data: the word that outlived its own definition
The three Vs come from a META Group research note by Doug Laney, 3D Data Management: Controlling Data Volume, Velocity, and Variety, published in February 2001, four years before Gartner bought META Group. It was a good note. It has since been stretched to five Vs, seven Vs and ten Vs by people adding whichever noun they were selling, and NIST's own count in 2019 is four, adding variability.
The practical definition, "too big for one machine", is the part that quietly stopped being true.
- A single AWS U7i instance tops out at 32 TiB of memory and 1,920 vCPUs. Datasets that justified a Hadoop cluster in 2012 now fit in RAM on one rented box.
- DuckDB shipped 1.5.5 on 22 July 2026 and runs analytical SQL over hundreds of gigabytes on a laptop, in process, with no cluster to operate.
- Jordan Tigani, an engineering lead on BigQuery, published Big Data is Dead in February 2023 with the numbers from inside: the vast majority of BigQuery customers held under a terabyte in total storage, and among customers spending more than $1,000 a year, 90% of queries scanned less than 100 MB.
- On the two-vCPU container used for the measurements above, pandas grouped 10 million rows into 5,000 groups in 0.45 seconds, on a frame occupying 160 MB. That is a laptop-scale answer to a workload that used to justify a platform.
What has not shrunk is the bill. Google charges $6.25 per TiB scanned for on-demand BigQuery queries, with the first 1 TiB each month free, and about $23.55 per TiB per month for active storage. One careless SELECT * across a 20 TiB table is $125. Schedule it hourly behind a dashboard nobody opens and it is $3,000 a day. Big data in 2026 is a budget line rather than a row count, and the useful question is not "is this big" but "what does one full scan cost, and how often does something trigger it".
Big data is the environment, not the activity: the where and the how much, never the what you do. Our big data basics piece covers the storage side.
What changed between the vocabulary and now
The words settled around 2012. The tools underneath them did not sit still, and a check of the release indices on 10 August 2026 sorts the living from the embalmed.
| Project | Signal of life, checked 10 August 2026 |
|---|---|
| scikit-learn | 1.9.0, June 2026 |
| Apache Spark | 4.2.0, 14 July 2026 |
| Apache Hadoop | 3.5.0, 2 April 2026 |
| DuckDB | 1.5.5, 22 July 2026 |
| Orange | 3.40.0, 20 December 2025 |
| Weka | 3.8.7, 30 March 2026, ending four years of silence since 3.8.6 in February 2022 |
| Apache Sqoop | retired to the Attic, June 2021 |
| Apache Mahout | homepage now leads with a quantum-computing library |
| RapidMiner | Altair bought it in 2022, Siemens has since absorbed Altair, and the old URL redirects |
| crisp-dm.org | no answer |
Two rows deserve reading twice. Hadoop is still releasing, which surprises people who declared it dead, and Weka going quiet for four years then shipping a Java 25 build is a reminder that "no recent release" and "abandoned" are different claims.
Weather forecasting is the example the earlier version of this article got wrong. It described weather models as machine learning that refines its averages year over year. That is not how operational forecasting worked then and it is not how it works now, and the real change is more interesting. ECMWF put a machine-learned model, AIFS v1.1, into operations in February 2025. In May 2026 it announced it was ending real-time runs of the four external ML models it had been hosting, Huawei's Pangu-Weather, Google DeepMind's GraphCast, Microsoft's Aurora and Nvidia's FourCastNet, on the grounds that first-generation models had aged out and that fine-tuned ones degraded after the IFS Cycle 50r1 upgrade. A physics simulation and a learned emulator of one are different objects, and the emulator has spent eighteen months moving into production.
The other change is that a chunk of exploratory mining has migrated to language models. Clustering free-text complaints, pulling entities out of contracts, labelling a sample to bootstrap a classifier: a week with a bag-of-words pipeline is now a prompt and a validation set. The validation set is the part that still matters, and the part that gets skipped.
Four claims that keep getting copied
"Machine learning is the field of study that gives computers the ability to learn without being explicitly programmed." Arthur Samuel, 1959. We read the paper. The phrase is not in it. Samuel's 1959 IBM Journal of Research and Development article on checkers opens "Two machine-learning procedures have been investigated in some detail using the game of checkers", and frames the work as "the programming of a digital computer to behave in a way which, if done by human beings or animals, would be described as involving the process of learning". The famous sentence circulates without a locatable primary source. Mitchell's 1997 definition is checkable, so cite that one.
Beer and diapers. The founding anecdote of market-basket analysis is usually told as a retailer discovering that men buy beer and nappies together and moving the shelves. The primary account is an interview with Thomas Blischok, who ran the study, published in Daniel Power's DSS News on 10 November 2002. The analysis was real: about 1.2 million market baskets from roughly 25 Osco Drug stores in 1992, and it did surface a beer and diaper co-occurrence between 5 and 7 pm. Blischok's own summary of what followed is that "in reality they never did anything with beer and diapers relationships". The most-cited success story in data mining is a finding nobody acted on.
"Ninety per cent of the world's data was created in the last two years." This traces to a SINTEF press release dated 22 May 2013 and has been recopied with the same wording every year since. A statistic that has been reported as current for thirteen consecutive years is not a measurement, it is a slogan. If you need a defensible number about growth, cite a dated vendor telemetry figure and say whose it is.
"Data mining is a subset of machine learning." Neither contains the other, and the containment people are reaching for runs the other way: Fayyad's 1996 framing puts data mining inside KDD as one step of a larger process. Both sit under data science, they share methods, and they answer different questions. The related mistake is crediting Gartner with the three Vs, when the note was written at META Group in 2001 by an author Gartner acquired along with the company.
The input, which is where projects actually fail
Mining and modelling both assume a large, clean, well-structured dataset already exists. Almost nothing arrives that way, and the assumption is where schedules go to die.
Treat the preparation percentages as folklore and the direction as correct. Every widely quoted figure for how much of a data scientist's time goes on cleaning comes from vendor questionnaires rather than instrumented measurement, so the specific number is not worth arguing about. The ordering is not in dispute by anyone who has done the work.
Valuable datasets are assembled rather than received. Teams build them by scraping public web data for prices, listings, reviews and company records, by pulling from internal systems that were designed for transactions and not for analysis, and by buying third-party feeds that arrive in whatever shape the vendor felt like. Then comes the unglamorous half: normalisation, deduplication and enrichment before a single model runs. Sites that fight back with rate limits, fingerprinting and challenges are where a managed extraction pipeline earns its keep, and teams that would rather not run collection at all buy the finished, deduplicated table as a data-as-a-service feed.
The failure mode is specific and it is not obvious from a notebook. A field that silently changed meaning halfway through your history will produce a clean model, good validation scores and a wrong answer, because the model learned the change rather than the phenomenon. Nothing in the training loop reports this. It shows up as a segment that behaves oddly, or a feature with high importance and no business meaning anyone can explain. That is when somebody goes back and mines the raw data.
Getting the words right in practice
Which to learn first. Statistics, SQL, clustering and the habit of looking at distributions, before gradient boosting. Not because mining outranks modelling, but because most modelling failures are data failures in costume, and whoever spots a leaking feature is worth more than whoever can name six boosting libraries.
You do not need machine learning to mine data. A great deal of high-value work is GROUP BY, a scatter plot and an argument, with no predictive model anywhere. Reach for a model when you need a decision on a record that does not exist yet.
A heuristic that survives contact with a meeting. If you know the question and roughly where the answer lives, you are doing analytics: you query and you measure. If you do not know the question and are hunting for structure you did not anticipate, you are mining: you explore and you discover. The moment somebody asks for it to run automatically on tomorrow's records, it has become machine learning, whatever the ticket says.
The bottom line
Mining discovers patterns in the data you have. Machine learning predicts on the data you do not have yet. They share algorithms, they chain together in one pipeline, and the difference that matters is whether a person reads the output or a program consumes it. Big data is the environment, and it now means a scan bill rather than a row count. Analytics is how findings get packaged. Data science is the umbrella over all of it.
Get the vocabulary right and you stop arguing past people in planning meetings. Get the input data right and the argument becomes worth having, because no amount of modelling recovers a field whose meaning changed in 2023.