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

	POIsketch: Semantic Place Labeling over User Activity Streams 1 Dingqi Yang1 , Bin Li2 , Philippe Cudr´e-Mauroux1 eXascale Infolab, University of Fribourg, 1700 Fribourg, Switzerland 2 DocID: 1roz3 - View Document
	Real-Time Community Detection in Large Social Networks on a Laptop Ben Chamberlain Clive Humby DocID: 1rfef - View Document
	Finding Highly Correlated Pairs Efficiently with Powerful Pruning ∗ Joan Feigenbaum DocID: 1qQRL - View Document
	The Power of Comparative Reasoning Jay Yagnik, Dennis Strelow, David A. Ross, Ruei-sung Lin {jyagnik, strelow, dross, rslin}@google.com Abstract beddings on multiple partial order statistics rather than total DocID: 1qNAS - View Document
	The Migration of the Field Code Kellen Funk and Lincoln Mullen This paper describes our work in progress for the Digital Humanities Working Group at George Mason University on February 17, 2016. E-mail: lincoln@lincolnmu DocID: 1pcE4 - View Document