earticle

논문검색

Large-Scale Text Similarity Computing with Spark

초록

영어

Text understanding is a hot research in Natural Language Processing and Information Retrieval. In recent years, it has received wide attention and research. In the era of big data, Understanding text in large-scale datasets is a challenge. Although the earliest systems designed for these workloads, such as MapReduce, gave users a powerful, but low-level, procedural programming interface. So, MapReduce doesn’t compose well for lager text applications. Recently, Spark, an in-memory cluster-computing platform, has been proposed. It has emerged as a popular framework for large-scale data processing and analytics. It provides a general-purpose efficient cluster computing engine and simpler for the end users. In this work, we consider using Vector Space Model (VSM) and TF-IDF weighting schema and feature hashing feature extraction techniques in order to solve the problem of large-scale text data similarity computing by Spark. As a result, Experimental results that using Spark in order to solve document similarity computation problems as soon as quickly by 20Newsgroups. In additions, It is more benefit from document classification and clustering of machine learning tasks.

목차

Abstract
 1. Introduction
 2. Apache Spark
  2.1. Resilient Distributed Datasets
  2.2. Broadcast Variables and Accumulators
  2.3. Lineage and Fault Tolerance of Spark
 3. Vector Space Model and Similarity Computing Techniques
  3.1. Text Representation
  3.2. Similarity Computing Techniques
 4. Experimental Results
 5. Conclusion
 Acknowledgements
 References

저자정보

  • Xiaoan Bao The institute of software of Zhejiang Sci-Tech university
  • Shichao Dai The institute of software of Zhejiang Sci-Tech university
  • Na Zhang The institute of software of Zhejiang Sci-Tech university
  • Chenghai Yu The institute of software of Zhejiang Sci-Tech university

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.