The Bloom Filter in Mining: Using a Probabilistic Data Structure to Quickly Test Membership in Large Sets
Introduction Frequent itemset mining and association analysis often involve checking whether a candidate pattern belongs to a very large set of “known” patterns. For example, after generating candidate pairs or higher-order itemsets, you may repeatedly ask: “Is this candidate in the list we decided to track?” If that list contains millions of elements, traditional membership…







