Maps 06–09
Map 6 — Services-based layers
Recall: BATCH = complete history | SPEED = recent/real-time | SERVING = merged consumer view.
Rebuild: two upstream lanes feed serving; label completeness–latency–complexity trade-off.
Answer check: serving exposes/merges, not a third independent source.
Source: pp. 479–480.
Map 7 — Machine-learning branch tree
Recall: LABELED TARGET? yes → SUPERVISED | no + hidden patterns → UNSUPERVISED | goal + reward/feedback → REINFORCEMENT.
Rebuild: decision branch based on learning signal.
Answer check: spam labels / natural segments / goal-feedback learner.
Source: pp. 480–481.
Map 8 — Mining-method selector
Recall: PROFILE=understand | REDUCE=simplify | ASSOCIATE=co-occurrence | CLUSTER=similar groups | SOM=map complex similarity.
Answer check: association relates elements; clustering groups cases; profiling is not prediction.
Source: pp. 481–482.
Map 9 — Source decision filter
Recall: BUSINESS RELEVANCE → ORIGIN/MEANING → GRAIN/TIMING → CONSISTENCY/RELIABILITY → PRIVACY/BIAS → FEASIBLE VALUE → INGEST.
Rebuild: draw as a funnel; sources can exit at any failed gate.
Answer check: cheap, large, or novel data can still fail the filter.
Source: pp. 485–487.