TABLE 1.

Summary of Notations and Definitions

Notation/Name	Defined in	Definition
M	Section 2	transactional database in the form of (0,1)-matrix
$\mathcal{T}$	Section 2	complete set of transactions (rows) of M
$\mathcal{I}$	Section 2	complete set of items (columns) of M
M(i, j)	Section 2	value of entry (either 0 or 1) at row i and column j of M
pattern (Cartesian product)	Section 2	P = T × I = {(x, y) : x ∈ T, y ∈ I} where $T\subseteq \mathcal{T}$ and $I\subseteq \mathcal{I}$
supporting pattern P for entry (i, j)	Section 2	Pattern P covers (i, j) and, M(x, y) = 1 for any entry (x, y) ∈ P\{(i, j)}
maximal supporting pattern P for entry (i, j)	Section 2	There does not exist another supporting pattern P′ for (i, j) such that $P\subset P^{\prime }$
S(i, j) (independent evidence for hypothesis M(i, j) == 1)	Section 2	the set of all maximal supporting patterns for entry (i, j)
$\mathcal{F}(i,j)$ (feature extracted from S(i, j))	Section 2	maxT × I ∈ S(i,j)(|T| – 1) * (|I| – 1)
M[X; Y] (submatrix of M)	Section 3.1	a matrix formed by selecting rows in X and columns in Y from M, where $X\subseteq \mathcal{T}$ and $Y\subseteq \mathcal{I}$
supporting biclique for entry (i, j)	Section 3.1	biclique in M[X;Y] where $X=\{x:x\in \mathcal{T}\backslash \left\{i\right\},M(x,j)=1\}$, $Y=\{y:y\in \mathcal{I}\backslash \left\{j\right\},M(i,y)=1\}$.
maximal supporting biclique for entry (i, j)	Section 3.1	maximal biclique in M[X;Y] where $X=\{x:x\in \mathcal{T}\backslash \left\{i\right\},M(x,j)=1\}$, $Y=\{y:y\in \mathcal{I}\backslash \left\{j\right\},M(i,y)=1\}$.
maximum supporting biclique for entry (i, j)	Section 3.1	maximum edge biclique in M[X;Y] where $X=\{x:x\in \mathcal{T}\backslash \left\{i\right\},M(x,j)=1\}$, $Y=\{y:y\in \mathcal{I}\backslash \left\{j\right\},M(i,y)=1\}$.