A dynamic bit-vector approach for efficiently mining inter-sequence patterns
2012 Third International Conference on Innovations in Bio-Inspired …, 2012•ieeexplore.ieee.org
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 …
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 …
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.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果