An Application of Improved Gap-BIDE Algorithm for Discovering Access Patterns

Algorithm 1

Improved Gap-BIDE algorithm.

ALGORITHM: gap-Bide (SDB, 𝑡_session, min_sup_les,

min_sup, M, N)

INPUT: (1) SDB: An input sequence database with time, (2)

𝑡_session: the time user session, (3) min_sup_les: the

minimum support threshold of getting large event set, (4)

min_sup: the minimum support threshold of getting closed

sequential pattern, (5) 𝑀 and 𝑁: the parame-ters of a gap

constraint.

OUTPUT: the set of gap-constrained closed sequential patterns.

(1)call getLargeEventSet (SDB, 𝑡_session, min_sup_les);

(2)select sequence from input database only contained in LES

(3)find the set of length-1 frequent sequential patterns, 𝐿1;

(4)for each item 𝑖 in 𝐿1

(5)call patternGrowth(𝑖);

(6)return