算法2：准反常项集挖掘算法

输入：数据集D的垂直数据表示形式 $D_{\text{vert}}\left[P\right]$ ，提升度阈值 $\lambda$ ，更正操作数量k

输出：准反常项集QAbNI

1

procedure $\text{QAbNIMiner}\left(D_{\text{vert}}\left[P\right],P\subseteq \mathcal{I},\lambda \right)$

2

$\text{QAbNI}\Leftarrow \varnothing$

3

for all $m\in \mathcal{I}$ occurring in $D_{\text{vert}}\left[P\right]$ in reverse order do//depth-first search

4

$N\Leftarrow P\cup \left\{n\right\}$ //expanding the itemset N

5

if $k\le \left|D\right|\left({\lambda }^{-\frac{1}{2}}-1\right)$ then

6

if not isGenerator(N) then

7

continue

8

storeGenerator(N)

9

if $\left|N\right|>1$ and $\text{wSup}\left(N,D_{\text{clean}}\right)\le \frac{\lambda }{2-\lambda }$ then

10

if a subset of N has been pruned then

11

continue

12

if $\text{mpwHlift}\left(N,D\right)<\lambda$ then

13

$\text{QAbNI}\Leftarrow \text{QAbNI}\cup \left\{N\right\}$

14

If $\frac{1}{\lambda }>\underset{S\subset N}{\min }\left\{\sqrt{\text{wSupCnt}\left(S,D_{\text{clean}}\right)+k}\ast \sqrt{\text{wSupCnt}\left(N\backslash S,D_{\text{clean}}\right)+k}\right\}$ then