Mining top-k co-occurrence items with sequential pattern

Tung Kieu, Bay Vo, Tuong Le, Zhi-Hong Deng, Bac Le

Abstract: Highlights•The problem of mining top-k co-occurrence items with sequential pattern is defined.•Sid-set and Sid-sets with an index are used to reduce the scanning time.•Three algorithms including NAM, VAM, and VIAM for mining top-k co-occurrence items with sequential pattern are proposed.•Two pruning techniques are proposed and used in VAM and VIAM algorithms to improve the processing time.