Lee A.J.T.Wang C.-S.2019-07-242019-07-24200700200255https://scholars.lib.ntu.edu.tw/handle/123456789/415127In this paper, we propose an efficient method for mining all frequent inter-transaction patterns. The method consists of two phases. First, we devise two data structures: a dat-list, which stores the item information used to find frequent inter-transaction patterns; and an ITP-tree, which stores the discovered frequent inter-transaction patterns. In the second phase, we apply an algorithm, called ITP-Miner (Inter-Transaction Patterns Miner), to mine all frequent inter-transaction patterns. By using the ITP-tree, the algorithm requires only one database scan and can localize joining, pruning, and support counting to a small number of dat-lists. The experiment results show that the ITP-Miner algorithm outperforms the FITI (First Intra Then Inter) algorithm by one order of magnitude. ? 2007 Elsevier Inc. All rights reserved.Association rulesData miningInter-transaction patternsjournal article10.1016/j.ins.2007.03.0072-s2.0-34250336422https://www.scopus.com/inward/record.uri?eid=2-s2.0-34250336422&doi=10.1016%2fj.ins.2007.03.007&partnerID=40&md5=6393f9a3f19222ca4585b0cd25dfc74d