An efficient algorithm for mining closed inter-transaction itemsets

Mining inter-sequence patterns

“…First, inter-sequence mining algorithms usually generate a large number of frequent patterns. To reduce the number of frequent patterns, we could consider other pattern structures, such as the closed patterns discussed in Lee, Wang, Weng, Chen, and Wu (2008), Yan, Han, and Afshar (2003), Wang and Han (2004), Zaki and Hsiao (2005)). We could also extend our proposed algorithm from two-dimensional transaction databases to higher dimension databases.…”

Mining frequent closed patterns in pointset databases

“…Entrance: (0, 9) Exit: (17,18) Visible region larger and larger, it may not be able to be loaded into main memory. Thus, how to develop a disk-based mining algorithm is worth further study in the future.…”

“…Moreover, the frequent closed itemsets mined can be used to generate a complete set of frequent itemsets. Generally speaking, the algorithms of mining frequent closed itemsets are more efficient than those of mining frequent itemsets [6][7][8][9][10][11]. Boley et al [12] introduced the concept of strongly accessible sets and proposed a theoretical framework (SASMiner for short) to mine frequent closed patterns.…”

A tree structure for event-based sequence mining

“…This concept basically consists of finding frequent patterns composed of elements where the distance belongs to a relative temporal interval. And finally, we would like to highlight later algorithms based on the inter-transactional scheme, such as PROWL [20], Closed-PROWL [21], PREVENT [8], or the ITP À Miner and ICMiner algorithms [22,23], among others. In the last two, the authors present two efficient algorithms for mining (closed) inter-transactional associations.…”