15

continue

16

if wSupCnt ( N , D clean ) | D | ( wSupCnt N , D clean max + k ) 2 λ 2 k then

17

continue

18

D vert [ N ] //generating the next layer of the searching tree

19

for all m I in such that m > n do

20

C cov ( { n } , D ) cov ( { m } , D )

21

M N { m }

22

wSupCnt ( M , D ) ω C | C |

23

wSupCnt ( M , D clean ) wSupCnt ( M , D ) wSupCnt ( M , D dirty )

24

if wSupCnt ( N , D ) wSupCnt ( M , D ) λ 1 2 wSupCnt M max k | D | then

25

D vert [ N ] D vert [ N ] { ( m , C ) }

26

QAbNI QAbNI QAbNIMiner ( D vert [ N ] , N , λ , k )

27

return QAbNI