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

	Freenet: A Distributed Anonymous Information Storage and Retrieval System Ian Clarke1 , Oskar Sandberg2 , Brandon Wiley3 , and Theodore W. Hong4? 1 4 DocID: 1xU1S - View Document
	Translation Term Weighting and Combining Translation Resources in Cross-Language Retrieval Aitao Chen, and Fredric Gey School of Information Management and Systems DocID: 1voyg - View Document
	Proceedings on Privacy Enhancing Technologies ; ):184–201 Raphael R. Toledo, George Danezis, and Ian Goldberg Lower-Cost -Private Information Retrieval Abstract: Private Information Retrieval (PIR), despite be DocID: 1vkX2 - View Document
	Modeling Latent Topic Interactions using Quantum Interference for Information Retrieval Alessandro Sordoni Jing He DocID: 1vklT - View Document
	Information Retrieval Ein Überblick Ingo Frommholz Universität Duisburg-Essen DocID: 1vhAi - View Document