A Challenge to Data Protection: the Privacy Implications of Data Mining and Machine Learning Artifacts
Bibliographic record
Abstract
This paper considers some difficulties posed by data mining. While the legal implications of data mining have been considered by numerous scholars, this article differs in that it examines issues from a private-sector perspective. Much of the existing literature examines the implications of data mining when used to further state-sponsored surveillance programs. In contrast, this article focuses on several issues concerning data mining that arise in the course of commercial activity. In particular, I examine the issues that arise in the course of commercial data processing, where a data custodian sends data to a data processor. I argue that data mining poses a unique challenge, in that the intermediate work products developed during the data mining process can retain significant amounts of information about the data sets from which they were created, while at the same time eluding restrictions set by digital rights management, copyright and data protection (privacy) law. As a result, data mining may provide a means for data processors to legally obtain copies of confidential business information, as well as personal information. While some of these issues can be addressed by contract, the mechanisms involved are of general applicability, and have important ramifications for privacy and copyright law.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.069 | 0.104 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.003 | 0.004 |
| Science and technology studies | 0.011 | 0.076 |
| Scholarly communication | 0.020 | 0.034 |
| Open science | 0.005 | 0.010 |
| Research integrity | 0.019 | 0.021 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".