liveBook · Manning

SPADE

As explained in Data Without Labels

SPADE is a sequential-pattern-mining algorithm that discovers frequent event sequences using a vertical database representation and equivalence-class joins.

SPADE (Sequential Pattern Discovery Using Equivalence classes) discovers frequent event sequences by analyzing ordered transactions. It extends transaction-based pattern mining to reveal what occurs next, supporting applications such as customer behavior, online searches, DNA sequencing, marketing, and user interaction analysis. section 4.7 section 4.7.1

An item is an element of the item universe; an event is a collection of items in one transaction; and a sequence orders events, such as (Milk, Cheese) -> (Bread, Eggs). A k-item sequence contains k items across its events. section 4.7.1

Python execution

A Python implementation can read a prepared sequence file, mine patterns with a support threshold of 0.6, and print the results: spade_result = spade(filename='SPADE_dataset.txt', support=0.6, parse=True); print_result(spade_result).

How Data Without Labels covers it

How deep it goes
Explains item, event, sequence, vertical representation, occurrence joins, and Python execution, while leaving broader implementation details implicit.
Examples
Demonstrates grocery and customer purchases, vertical occurrence tables, sequence joins, and a pycspade Python listing.
What it assumes
Assumes association-rule and mathematical foundations while defining sequence-mining terminology and its transaction-based data model.
What you can do after
Apply SPADE via pycspade or pyspade to mine sequential patterns from a prepared sequence dataset.
How it connects
Connects sequence rule mining with association rules, support thresholds, Apriori, ECLAT, FP-growth, and time-series analysis.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Data Without Labels. The section links point to the parts of the book it draws on.