Skip to Main content Skip to Navigation
Conference papers

CSMR: A Scalable Algorithm for Text Clustering with Cosine Similarity and MapReduce

Abstract : As Internet develops rapidly huge amounts of texts need to be processed in a short time. This entails the necessity of fast, scalable methods for text processing. In this paper a method for pairwise text similarity on massive data-sets, using the Cosine Similarity metric and the tf-idf (Term Frequency-Inverse Document Frequency) normalization method is proposed. The research approach is mainly focused on the MapReduce paradigm, a model for processing large data-sets in parallel manner, with a distributed algorithm on computer clusters. Through MapReduce model application on each step of the proposed method, text processing speed and scalability is enhanced in reference to other traditional methods. The CSMR (Cosine Similarity with MapReduce) method’s implementation is currently at the implementation stage. Precise and analytical conclusions concerning the efficiency of the proposed method are to be reached upon completion and review of the overall project phases.
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Wednesday, November 2, 2016 - 5:17:19 PM
Last modification on : Thursday, March 5, 2020 - 5:41:11 PM
Long-term archiving on: : Friday, February 3, 2017 - 2:53:54 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Giannakouris-Salalidis Victor, Plerou Antonia, Sioutas Spyros. CSMR: A Scalable Algorithm for Text Clustering with Cosine Similarity and MapReduce. 10th IFIP International Conference on Artificial Intelligence Applications and Innovations (AIAI), Sep 2014, Rhodes, Greece. pp.211-220, ⟨10.1007/978-3-662-44722-2_23⟩. ⟨hal-01391048⟩



Record views


Files downloads