A tree projection algorithm for generation of frequent item sets
From MaRDI portal
Publication:5943114
DOI10.1006/jpdc.2000.1693zbMath0990.68058OpenAlexW2032226242MaRDI QIDQ5943114
V. V. V. Prasad, Ramesh C. Agarwal, Charu C. Aggarwal
Publication date: 9 September 2001
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jpdc.2000.1693
Related Items
Mining maximal hyperclique pattern: a hybrid search strategy, An integrated cuckoo search-genetic algorithm for mining frequent itemsets, Opportunistic mining of top-\(n\) high utility patterns, Maintaining discovered frequent itemsets: Cases for changeable database and support, Applying frequent itemset mining to identify a small itemset that satisfies a large percentage of orders in a warehouse, TCOM, an innovative data structure for mining association rules among infrequent items