Data mining in a market basket database is used to find all association rules
that satisfy user-specified minimum support and minimum confidence
constraints. This problem can be conceptually viewed as finding all associa-
tions among the “1” values in a relational table in which all the attribute
values are Boolean. The value “1” for the value of an attribute for a given
record means that the item corresponding to the attribute is present in the
transaction corresponding to the record. The value “0” means exactly the
opposite. This problem, often referred to as
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.