Dataset Curation and Data Quality
"Garbage in, garbage out" is the oldest axiom in computing, and nowhere is it more true than in machine learning. OpenAI spent an estimated 10 million on data curation for GPT-4 — not on compute, but on hiring 1,000+ contractors to label, filter, and quality-check training data. Andrew Ng's "data-centric AI" movement argues that for most applications, improving the data yields more gains than improving the model. This chapter covers the science of dataset construction: collection, cleaning, labeling, decontamination, and quality assurance at scale.
1. The Data Quality Hierarchy
| Level | Quality Dimension | Definition | Measurement |
|---|---|---|---|
| 1 | Completeness | No missing values in critical fields | % null per column; rows with any null |
| 2 | Consistency | Same entity has same representation | Deduplication rate; format standardization |
| 3 | Accuracy | Values match ground truth | Cross-validation with authoritative source |
| 4 | Timeliness | Data is current enough for use case | Staleness (time since last update) |
| 5 | Relevance | Data represents the target distribution | Domain match score; distribution shift metrics |
| 6 | Label Quality | Annotations are correct and consistent | Inter-annotator agreement (Cohen's kappa) |
2. Data Collection Strategies
Web Scraping:
Scale: 100B+ tokens (Common Crawl, 2024)
Quality: LOW (noisy, duplicated, biased toward English)
Cost: ~0.001 per 1M tokens
Risk: Copyright issues, PII leakage, toxic content
Common Crawl composition:
English: 46%
German: 6%
French: 5%
Hindi: 0.3% ← Massively underrepresented!
Tamil: 0.02%
→ Indian language models face a 100× data disadvantage
Human Annotation:
Scale: 1M-100M labeled examples
Quality: HIGH (with proper QA)
Cost: 0.10-10 per label (depending on complexity)
Risk: Annotator bias, fatigue, inconsistency
Labeling cost examples:
Sentiment (binary): ₹2 per label × 100K = ₹2 lakh
Named Entity (per token): ₹10 per sentence × 50K = ₹5 lakh
Medical imaging (per scan): ₹500 per label × 10K = ₹50 lakh
Preference pairs (RLHF): ₹50 per pair × 100K = ₹50 lakh
Synthetic Data:
Scale: Unlimited
Quality: MEDIUM (depends on generator quality)
Cost: ~0.01 per 1M tokens (LLM generation)
Risk: Distribution mismatch, mode collapse
Use cases:
- Code: Generate training data from type signatures
- Math: Programmatically generate equation-solution pairs
- Multilingual: Translate high-quality English data to Indian languages
3. Data Cleaning Pipeline
Stage 1: Deduplication
Exact dedup: Hash each document → remove exact matches
~30% of Common Crawl is exact duplicates
Near-dedup: MinHash + LSH (Locality-Sensitive Hashing)
Finds ~20% additional near-duplicates (>80% Jaccard similarity)
Impact: Removing duplicates improves model quality by 2-5% on benchmarks
Stage 2: Quality Filtering
Heuristic filters:
- Remove documents with >50% non-alphanumeric characters
- Remove documents with <50 words (too short)
- Remove documents with >100K words (data dumps)
- Remove documents where >30% of lines end with "..." (scraping artifacts)
- Perplexity filter: use small LM → remove text with perplexity > 1000
Stage 3: Toxicity and PII Removal
Toxicity: Perspective API or custom classifier → remove documents scoring > 0.8
PII: Regex for emails, phone numbers, Aadhaar numbers (12-digit pattern)
Indian-specific PII: PAN (XXXPXXXXXC), Aadhaar (XXXX XXXX XXXX)
NSFW: CLIP-based classifier for images
Stage 4: Decontamination
Remove any text that overlaps with evaluation benchmarks
13-gram overlap check: if 13+ consecutive tokens match a benchmark question
→ remove the entire document
Critical for honest evaluation — even 1% contamination inflates scores by 5-8%
4. Label Quality: Inter-Annotator Agreement
Cohen's Kappa (2 annotators):
kappa = (p_observed - p_expected) / (1 - p_expected)
where:
p_observed = fraction of items both annotators agree on
p_expected = expected agreement by chance
Example: Sentiment labeling (positive/negative)
Annotator A: [+, +, -, +, -, -, +, +, -, +]
Annotator B: [+, +, -, -, -, -, +, +, +, +]
Agree on: items 1,2,3,6,7,8,10 → p_observed = 7/10 = 0.70
A labels 6/10 positive, B labels 6/10 positive
p_expected = 0.6×0.6 + 0.4×0.4 = 0.36 + 0.16 = 0.52
kappa = (0.70 - 0.52) / (1 - 0.52) = 0.18 / 0.48 = 0.375
Interpretation:
kappa < 0.20: Poor agreement → task definition is ambiguous
0.20-0.40: Fair → need clearer guidelines
0.40-0.60: Moderate → acceptable for many tasks
0.60-0.80: Substantial → good quality
0.80-1.00: Almost perfect → excellent
Krippendorff's Alpha (>2 annotators, handles missing data):
Preferred for production annotation projects
Industry standard threshold: alpha >= 0.67 for tentative, >= 0.80 for reliable
5. Python: Data Quality Audit Pipeline
import numpy as np
import hashlib
from collections import Counter
class DataQualityAuditor:
def __init__(self, documents):
self.docs = documents
self.report = {}
def run_full_audit(self):
self.check_completeness()
self.check_duplicates()
self.check_quality_heuristics()
self.check_pii()
self.check_language_distribution()
return self.report
def check_completeness(self):
total = len(self.docs)
empty = sum(1 for d in self.docs if not d.get('text', '').strip())
no_label = sum(1 for d in self.docs if 'label' not in d)
self.report['completeness'] = {
'total': total,
'empty_text': empty,
'missing_labels': no_label,
'complete_rate': (total - empty - no_label) / total
}
def check_duplicates(self):
hashes = [hashlib.md5(d['text'].encode()).hexdigest() for d in self.docs]
unique = len(set(hashes))
self.report['duplicates'] = {
'total': len(hashes),
'unique': unique,
'duplicate_rate': 1 - unique / len(hashes)
}
def check_quality_heuristics(self):
issues = {'too_short': 0, 'too_long': 0, 'high_special_char': 0}
for d in self.docs:
text = d.get('text', '')
words = text.split()
if len(words) < 50: issues['too_short'] += 1
if len(words) > 100000: issues['too_long'] += 1
special = sum(1 for c in text if not c.isalnum() and c != ' ')
if len(text) > 0 and special / len(text) > 0.5:
issues['high_special_char'] += 1
self.report['quality'] = issues
def check_pii(self):
import re
pii_count = 0
patterns = {
'email': r'[a-zA-Z0-9._%+-]+@[a-zA-Z0-9.-]+.[a-zA-Z]{2,}',
'aadhaar': r'd{4}s?d{4}s?d{4}',
'pan': r'[A-Z]{5}d{4}[A-Z]',
'phone': r'(?:+91|0)[- ]?d{10}'
}
for d in self.docs:
text = d.get('text', '')
for name, pattern in patterns.items():
if re.search(pattern, text):
pii_count += 1
break
self.report['pii'] = {'documents_with_pii': pii_count,
'pii_rate': pii_count / len(self.docs)}
def check_language_distribution(self):
# Simple heuristic: count Devanagari, Tamil, etc. characters
lang_counts = Counter()
for d in self.docs:
text = d.get('text', '')
if any('ऀ' <= c <= 'ॿ' for c in text): lang_counts['Hindi'] += 1
elif any('' <= c <= '' for c in text): lang_counts['Tamil'] += 1
else: lang_counts['English/Other'] += 1
self.report['languages'] = dict(lang_counts)
# Usage:
# auditor = DataQualityAuditor(my_documents)
# report = auditor.run_full_audit()
# print(f'Completeness: {report['completeness']['complete_rate']:.1%}")
# print(f'Duplicate rate: {report['duplicates']['duplicate_rate']:.1%}")
# print(f'PII contamination: {report['pii']['pii_rate']:.1%}")
Key Takeaways
- Data quality hierarchy: completeness → consistency → accuracy → timeliness → relevance → label quality
- Common Crawl is 46% English, 0.3% Hindi, 0.02% Tamil — Indian language models face 100× data disadvantage
- Deduplication removes 30-50% of web-crawled data and improves model quality by 2-5% on benchmarks
- Inter-annotator agreement (Cohen's kappa > 0.60) is essential for reliable labels — below 0.40 signals ambiguous task definition
- Decontamination (13-gram overlap check with benchmarks) prevents evaluation inflation — even 1% leakage biases scores 5-8%
Deep Dive: Dataset Curation and Data Quality
At this level, we stop simplifying and start engaging with the real complexity of Dataset Curation and Data Quality. In production systems at companies like Flipkart, Razorpay, or Swiggy — all Indian companies processing millions of transactions daily — the concepts in this chapter are not academic exercises. They are engineering decisions that affect system reliability, user experience, and ultimately, business success.
The Indian tech ecosystem is at an inflection point. With initiatives like Digital India and India Stack (Aadhaar, UPI, DigiLocker), the country has built technology infrastructure that is genuinely world-leading. Understanding the technical foundations behind these systems — which is what this chapter covers — positions you to contribute to the next generation of Indian technology innovation.
Whether you are preparing for JEE, GATE, campus placements, or building your own products, the depth of understanding we develop here will serve you well. Let us go beyond surface-level knowledge.
Distributed Databases and CAP Theorem
At scale, a single database server cannot handle the load. Consider UPI processing 10 billion transactions per month — no single machine can handle that. You need distributed databases, which introduces the CAP theorem:
CAP Theorem: Pick TWO of three (you cannot have all three)
┌─────────────────────────────────────────┐
│ Consistency (C) │
│ Every read gets the latest write │
│ ▲ │
│ / │
│ / │
│ CP Systems/ CA Systems │
│ (MongoDB, / (PostgreSQL, │
│ HBase) / MySQL) │
│ / ✗ │
│ / All Three │
│ / Impossible │
│ ▼ ▼ │
│ Availability (A)───────Partition │
│ Every request gets Tolerance (P) │
│ a response System works │
│ AP Systems despite network│
│ (Cassandra, DynamoDB) failures │
└─────────────────────────────────────────┘
Real-world choices:
- Banking (UPI/NEFT): CP — consistency is critical
- Social media feed: AP — availability matters more
- E-commerce cart: Tunable — eventual consistency is OKIn practice, modern systems use tunable consistency. Apache Cassandra (used by Hotstar for IPL streaming) lets you configure consistency per query: write to 3 replicas, read from 2, and you get strong consistency. Write to 1, read from 1, and you get high availability but eventual consistency. This is the engineering tradeoff at the heart of distributed systems.
Did You Know?
🔬 India is becoming a hub for AI research. IIT-Bombay, IIT-Delhi, IIIT Hyderabad, and IISc Bangalore are producing cutting-edge research in deep learning, natural language processing, and computer vision. Papers from these institutions are published in top-tier venues like NeurIPS, ICML, and ICLR. India is not just consuming AI — India is CREATING it.
🛡️ India's cybersecurity industry is booming. With digital payments, online healthcare, and cloud infrastructure expanding rapidly, the need for cybersecurity experts is enormous. Indian companies like NetSweeper and K7 Computing are leading in cybersecurity innovation. The regulatory environment (data protection laws, critical infrastructure protection) is creating thousands of high-paying jobs for security engineers.
⚡ Quantum computing research at Indian institutions. IISc Bangalore and IISER are conducting research in quantum computing and quantum cryptography. Google's quantum labs have partnerships with Indian researchers. This is the frontier of computer science, and Indian minds are at the cutting edge.
💡 The startup ecosystem is exponentially growing. India now has over 100,000 registered startups, with 75+ unicorns (companies worth over $1 billion). In the last 5 years, Indian founders have launched companies in AI, robotics, drones, biotech, and space technology. The founders of tomorrow are students in classrooms like yours today. What will you build?
India's Scale Challenges: Engineering for 1.4 Billion
Building technology for India presents unique engineering challenges that make it one of the most interesting markets in the world. UPI handles 10 billion transactions per month — more than all credit card transactions in the US combined. Aadhaar authenticates 100 million identities daily. Jio's network serves 400 million subscribers across 22 telecom circles. Hotstar streamed IPL to 50 million concurrent viewers — a world record. Each of these systems must handle India's diversity: 22 official languages, 28 states with different regulations, massive urban-rural connectivity gaps, and price-sensitive users expecting everything to work on ₹7,000 smartphones over patchy 4G connections. This is why Indian engineers are globally respected — if you can build systems that work in India, they will work anywhere.
Engineering Implementation of Dataset Curation and Data Quality
Implementing dataset curation and data quality at the level of production systems involves deep technical decisions and tradeoffs:
Step 1: Formal Specification and Correctness Proof
In safety-critical systems (aerospace, healthcare, finance), engineers prove correctness mathematically. They write formal specifications using logic and mathematics, then verify that their implementation satisfies the specification. Theorem provers like Coq are used for this. For UPI and Aadhaar (systems handling India's financial and identity infrastructure), formal methods ensure that bugs cannot exist in critical paths.
Step 2: Distributed Systems Design with Consensus Protocols
When a system spans multiple servers (which is always the case for scale), you need consensus protocols ensuring all servers agree on the state. RAFT, Paxos, and newer protocols like Hotstuff are used. Each has tradeoffs: RAFT is easier to understand but slower. Hotstuff is faster but more complex. Engineers choose based on requirements.
Step 3: Performance Optimization via Algorithmic and Architectural Improvements
At this level, you consider: Is there a fundamentally better algorithm? Could we use GPUs for parallel processing? Should we cache aggressively? Can we process data in batches rather than one-by-one? Optimizing 10% improvement might require weeks of work, but at scale, that 10% saves millions in hardware costs and improves user experience for millions of users.
Step 4: Resilience Engineering and Chaos Testing
Assume things will fail. Design systems to degrade gracefully. Use techniques like circuit breakers (failing fast rather than hanging), bulkheads (isolating failures to prevent cascade), and timeouts (preventing eternal hangs). Then run chaos experiments: deliberately kill servers, introduce network delays, corrupt data — and verify the system survives.
Step 5: Observability at Scale — Metrics, Logs, Traces
With thousands of servers and millions of requests, you cannot debug by looking at code. You need observability: detailed metrics (request rates, latencies, error rates), structured logs (searchable records of events), and distributed traces (tracking a single request across 20 servers). Tools like Prometheus, ELK, and Jaeger are standard. The goal: if something goes wrong, you can see it in a dashboard within seconds and drill down to the root cause.
Advanced Algorithms: Dynamic Programming and Graph Theory
Dynamic Programming (DP) solves complex problems by breaking them into overlapping subproblems. This is a favourite in competitive programming and interviews:
# Longest Common Subsequence — classic DP problem
# Used in: diff tools, DNA sequence alignment, version control
def lcs(s1, s2):
m, n = len(s1), len(s2)
dp = [[0] * (n + 1) for _ in range(m + 1)]
for i in range(1, m + 1):
for j in range(1, n + 1):
if s1[i-1] == s2[j-1]:
dp[i][j] = dp[i-1][j-1] + 1
else:
dp[i][j] = max(dp[i-1][j], dp[i][j-1])
return dp[m][n]
# Dijkstra's Shortest Path — used by Google Maps!
import heapq
def dijkstra(graph, start):
dist = {node: float('inf') for node in graph}
dist[start] = 0
pq = [(0, start)] # (distance, node)
while pq:
d, u = heapq.heappop(pq)
if d > dist[u]:
continue
for v, weight in graph[u]:
if dist[u] + weight < dist[v]:
dist[v] = dist[u] + weight
heapq.heappush(pq, (dist[v], v))
return dist
# Real use: Google Maps finding shortest route from
# Connaught Place to India Gate, considering traffic weightsDijkstra's algorithm is how mapping applications find optimal routes. When you ask Google Maps to navigate from Mumbai to Pune, it models the road network as a weighted graph (intersections are nodes, roads are edges, travel time is weight) and runs a variant of Dijkstra's algorithm. Indian highways, city roads, and even railway networks can all be modelled this way. IRCTC's route optimisation for trains across 13,000+ stations uses graph algorithms at its core.
Real Story from India
ISRO's Mars Mission and the Software That Made It Possible
In 2013, India's space agency ISRO attempted something that had never been done before: send a spacecraft to Mars with a budget smaller than the movie "Gravity." The software engineering challenge was immense.
The Mangalyaan (Mars Orbiter Mission) spacecraft had to fly 680 million kilometres, survive extreme temperatures, and achieve precise orbital mechanics. If the software had even tiny bugs, the mission would fail and India's reputation in space technology would be damaged.
ISRO's engineers wrote hundreds of thousands of lines of code. They simulated the entire mission virtually before launching. They used formal verification (mathematical proof that code is correct) for critical systems. They built redundancy into every system — if one computer fails, another takes over automatically.
On September 24, 2014, Mangalyaan successfully entered Mars orbit. India became the first country ever to reach Mars on the first attempt. The software team was celebrated as heroes. One engineer, a woman from a small town in Karnataka, was interviewed and said: "I learned programming in school, went to IIT, and now I have sent a spacecraft to Mars. This is what computer science makes possible."
Today, Chandrayaan-3 has successfully landed on the Moon's South Pole — another first for India. The software engineering behind these missions is taught in universities worldwide as an example of excellence under constraints. And it all started with engineers learning basics, then building on that knowledge year after year.
Research Frontiers and Open Problems in Dataset Curation and Data Quality
Beyond production engineering, dataset curation and data quality connects to active research frontiers where fundamental questions remain open. These are problems where your generation of computer scientists will make breakthroughs.
Quantum computing threatens to upend many of our assumptions. Shor's algorithm can factor large numbers efficiently on a quantum computer, which would break RSA encryption — the foundation of internet security. Post-quantum cryptography is an active research area, with NIST standardising new algorithms (CRYSTALS-Kyber, CRYSTALS-Dilithium) that resist quantum attacks. Indian researchers at IISER, IISc, and TIFR are contributing to both quantum computing hardware and post-quantum cryptographic algorithms.
AI safety and alignment is another frontier with direct connections to dataset curation and data quality. As AI systems become more capable, ensuring they behave as intended becomes critical. This involves formal verification (mathematically proving system properties), interpretability (understanding WHY a model makes certain decisions), and robustness (ensuring models do not fail catastrophically on edge cases). The Alignment Research Center and organisations like Anthropic are working on these problems, and Indian researchers are increasingly contributing.
Edge computing and the Internet of Things present new challenges: billions of devices with limited compute and connectivity. India's smart city initiatives and agricultural IoT deployments (soil sensors, weather stations, drone imaging) require algorithms that work with intermittent connectivity, limited battery, and constrained memory. This is fundamentally different from cloud computing and requires rethinking many assumptions.
Finally, the ethical dimensions: facial recognition in public spaces (deployed in several Indian cities), algorithmic bias in loan approvals and hiring, deepfakes in political campaigns, and data sovereignty questions about where Indian citizens' data should be stored. These are not just technical problems — they require CS expertise combined with ethics, law, and social science. The best engineers of the future will be those who understand both the technical implementation AND the societal implications. Your study of dataset curation and data quality is one step on that path.
Syllabus Mastery 🎯
Verify your exam readiness — these align with CBSE board and competitive exam expectations:
Question 1: Explain dataset curation and data quality in your own words. What problem does it solve, and why is it better than the alternatives?
Answer: Focus on the core purpose, the input/output, and the advantage over simpler approaches. This is exactly what board exams test.
Question 2: Walk through a concrete example of dataset curation and data quality step by step. What are the inputs, what happens at each stage, and what is the output?
Answer: Trace through with actual numbers or data. Competitive exams (IIT-JEE, BITSAT) reward step-by-step worked solutions.
Question 3: What are the limitations or failure cases of dataset curation and data quality? When should you NOT use it?
Answer: Knowing when something fails is as important as knowing how it works. This separates good answers from great ones on competitive exams.
🔬 Beyond Syllabus — Research-Level Extension (click to expand)
These are stretch questions for students aiming beyond board exams — IIT research track, KVPY, or IOAI preparation.
Research Q1: What are the theoretical guarantees and limitations of dataset curation and data quality? Under what assumptions does it work, and when do those assumptions break down?
Hint: Every technique has boundary conditions. Think about edge cases, adversarial inputs, or data distributions where the method fails.
Research Q2: How does dataset curation and data quality compare to its alternatives in terms of accuracy, efficiency, and interpretability? What tradeoffs exist between these dimensions?
Hint: Compare at least 2-3 alternative approaches. Consider when you would choose each one.
Research Q3: If you were writing a research paper on dataset curation and data quality, what open problem would you investigate? What experiment would you design to test your hypothesis?
Hint: Think about what current implementations cannot do well. That gap is where research happens.
Key Vocabulary
Here are important terms from this chapter that you should know:
🏗️ Architecture Challenge
Design the backend for India's election results system. Requirements: 10 lakh (1 million) polling booths reporting simultaneously, results must be accurate (no double-counting), real-time aggregation at constituency and state levels, public dashboard handling 100 million concurrent users, and complete audit trail. Consider: How do you ensure exactly-once delivery of results? (idempotency keys) How do you aggregate in real-time? (stream processing with Apache Flink) How do you serve 100M users? (CDN + read replicas + edge computing) How do you prevent tampering? (digital signatures + blockchain audit log) This is the kind of system design problem that separates senior engineers from staff engineers.
The Frontier
You now have a deep understanding of dataset curation and data quality — deep enough to apply it in production systems, discuss tradeoffs in system design interviews, and build upon it for research or entrepreneurship. But technology never stands still. The concepts in this chapter will evolve: quantum computing may change our assumptions about complexity, new architectures may replace current paradigms, and AI may automate parts of what engineers do today.
What will NOT change is the ability to think clearly about complex systems, to reason about tradeoffs, to learn quickly and adapt. These meta-skills are what truly matter. India's position in global technology is only growing stronger — from the India Stack to ISRO to the startup ecosystem to open-source contributions. You are part of this story. What you build next is up to you.
Crafted for Class 10–12 • MLOps • Aligned with NEP 2020 & CBSE Curriculum