
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
Chapter 4 of DataIntensive Text Processing with Map Reduce introduce the efficiently mapreduce algorithm, pairs and stripes. It show how to use these two algorithm to contrust the cooccurrence matrix. It compare the time complexity between pairs and stripes algorithms. According to the experiments, the stripes algorithm have the better efficiency than pairs algorithm.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment