A Dynamic Bit-vector Approach for Efficiently Mining Inter-sequence Patterns
The inter-sequence pattern (ISP) mining method can be used to mine sequential patterns inside a transaction and inter-transaction patterns in several transactions. Consequently, the ISP mining method is more general than two traditional sequence mining methods. This paper proposes an algorithm that uses a dynamic bit-vector (DBV) data structure to efficiently mine ISPs. The DBV-ISP algorithm uses the divide-and-conquer method to reduce the required storage space and execution time. Experimental results show that DBV-ISP is more efficient than the EISP-Miner algorithm in terms of execution time and memory usage.