TY - GEN
T1 - Mining frequent intra-sequence and inter-sequence patterns using bitmap with a maximal span
AU - Liao, Wenzhe
AU - Wang, Qian
AU - Yang, Luqun
AU - Ren, Jiadong
AU - Davis, Darryl N.
AU - Hu, Changzhen
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/2
Y1 - 2017/7/2
N2 - Frequent intra-sequence pattern mining and inter-sequence pattern mining are both important ways of association rule mining for different applications. However, most algorithms focus on just one of them, as attempting both is usually inefficient. To address this deficiency, FIIP-BM, a Frequent Intra-sequence and Inter-sequence Pattern mining algorithm using Bitmap with a maxSpan is proposed. FIIP-BM transforms each transaction to a bit vector, adjusts the maximal span according to user's demand and obtains the frequent sequences by logic And-operation. For candidate 2-pattern generation, the subscripts of the joining items should be checked first; the bit vector of the joining item will be left-shifted before calculation if the subscript is not 0. Left alignment rule is used for different bit vector length problems. FIIP-BM can mine both intra-sequence and inter-sequence patterns. Experiments are conducted to demonstrate the computational speed and memory efficiency of the FIIP-BM algorithm.
AB - Frequent intra-sequence pattern mining and inter-sequence pattern mining are both important ways of association rule mining for different applications. However, most algorithms focus on just one of them, as attempting both is usually inefficient. To address this deficiency, FIIP-BM, a Frequent Intra-sequence and Inter-sequence Pattern mining algorithm using Bitmap with a maxSpan is proposed. FIIP-BM transforms each transaction to a bit vector, adjusts the maximal span according to user's demand and obtains the frequent sequences by logic And-operation. For candidate 2-pattern generation, the subscripts of the joining items should be checked first; the bit vector of the joining item will be left-shifted before calculation if the subscript is not 0. Left alignment rule is used for different bit vector length problems. FIIP-BM can mine both intra-sequence and inter-sequence patterns. Experiments are conducted to demonstrate the computational speed and memory efficiency of the FIIP-BM algorithm.
KW - Frequent intra-sequence pattern
KW - bit vector
KW - frequent inter-sequence pattern
KW - maximal span
UR - http://www.scopus.com/inward/record.url?scp=85049621550&partnerID=8YFLogxK
U2 - 10.1109/WISA.2017.70
DO - 10.1109/WISA.2017.70
M3 - Conference contribution
AN - SCOPUS:85049621550
T3 - Proceedings - 2017 14th Web Information Systems and Applications Conference, WISA 2017
SP - 56
EP - 61
BT - Proceedings - 2017 14th Web Information Systems and Applications Conference, WISA 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 14th Web Information Systems and Applications Conference, WISA 2017
Y2 - 11 November 2017 through 12 November 2017
ER -