Finding Highly Correlated Pairs Efficiently with Powerful Pruning ∗ Joan Feigenbaum

First Page		Document Content
Date: 2006-08-31 13:51:39 Information science Information retrieval Search algorithms Hashing Information MinHash Hash table Hash function Association rule learning Pearson product-moment correlation coefficient Apriori algorithm Bloom filter		Finding Highly Correlated Pairs Efficiently with Powerful Pruning ∗ Joan Feigenbaum Add to Reading List Source URL: cs-www.cs.yale.edu Download Document from Source Website File Size: 184,04 KB Share Document on Facebook

	Fast estimation of the pattern frequency spectrum Matthijs van Leeuwen1 and Antti Ukkonen2 1 2 DocID: 1rjts - View Document
	A Comparison of Techniques for Selecting and Combining Class Association Rules Jan-Nikolas Sulzmann and Johannes F¨ urnkranz Department of Computer Science, TU Darmstadt Hochschulstr. 10, DDarmstadt, Germany DocID: 1re1r - View Document
	Finding Highly Correlated Pairs Efficiently with Powerful Pruning ∗ Joan Feigenbaum DocID: 1qQRL - View Document
	1 Association Discovery in Two-View Data Matthijs van Leeuwen and Esther Galbrun Abstract—Two-view datasets are datasets whose attributes are naturally split into two sets, each providing a different view on the same DocID: 1qcnj - View Document
	Data Min Knowl Disc:169–214 DOIs10618x K RIMP: mining itemsets that compress Jilles Vreeken · Matthijs van Leeuwen · Arno Siebes DocID: 1pIJJ - View Document