Back to search

North Dakota State University

Study of Similarity Coefficients Using MapReduce Programming Model

Abstract

dc:description.abstract

MapReduce is a programming model for processing and generating large data sets. Users specify a map function that processes a key/value pair to generate a set of intermediate key/value pairs, and a reduce function that merges all intermediate values associated with the same intermediate key. Similarity metric is the basic measurement used by a number of data mining algorithms. It is used to measure similarity between data objects. These objects may have one or more than one attributes related to them. In this paper, for a given input data of users and their page entity pairs we calculate the similarity index between the users with respect to the page edits. We consider four different algorithms for the calculation of similarity coefficients. They are Jaccard, Cosine, Tanimoto and Dice’s coefficient. We implement these algorithms using MapReduce Programming structure, and study their behavior with respect to different input sizes and cluster sizes.

Degree

thesis:*
Grantor dc:publisher
North Dakota State University
Year dc:date.issued
2013

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Nayakam, GhanaShyam Nath

Subjects

dc:subject × 4

Rights

dc:rights
Statement dc:rights
  • NDSU Policy 190.6.2

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10365/22599

Chain of custody

source
Harvested from
North Dakota State University
Base URL
library.ndsu.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Nayakam, GhanaShyam Nath. Study of Similarity Coefficients Using MapReduce Programming Model. North Dakota State University, 2013. https://hdl.handle.net/10365/22599