This paper presents a MapReduce algorithm for computing pairwise document similarity in large document collections. MapReduce is an attractive framework because it allows us to decompose the inner products involved in computing document similarity into separate multiplication and summation stages in a way that is well matched to efficient disk access patterns across several machines. On a collection consisting of approximately 900,000 newswire articles, our algorithm exhibits linear growth in running time and space in terms of the number of documents.
Initially, in REF , a method that focuses on a MapReduce algorithm for computing pairwise document similarity in large document collections is introduced.
Pairwise Document Similarity in Large Collections with MapReduce
Annual Meeting Of The Association For Computational Linguistics
Computer Science