Data-intensive text processing with MapReduce

著者

    • Lin, Jimmy
    • Dyer, Chris

書誌事項

Data-intensive text processing with MapReduce

Jimmy Lin, Chris Dyer

(Synthesis lectures on human language technologies, 7)

Morgan & Claypool, c2010

  • : pbk

大学図書館所蔵 件 / 13

この図書・雑誌をさがす

注記

Includes bibliographical references (p. 149-163)

内容説明・目次

内容説明

Our world is being revolutionized by data-driven methods: access to large amounts of data has generated new insights and opened exciting new opportunities in commerce, science, and computing applications. Processing the enormous quantities of data necessary for these advances requires large clusters, making distributed computing paradigms more crucial than ever. MapReduce is a programming model for expressing distributed computations on massive datasets and an execution framework for large-scale data processing on clusters of commodity servers. The programming model provides an easy-to-understand abstraction for designing scalable algorithms, while the execution framework transparently handles many system-level details, ranging from scheduling to synchronization to fault tolerance. This book focuses on MapReduce algorithm design, with an emphasis on text processing algorithms common in natural language processing, information retrieval, and machine learning. We introduce the notion of MapReduce design patterns, which represent general reusable solutions to commonly occurring problems across a variety of problem domains. This book not only intends to help the reader ""think in MapReduce"", but also discusses limitations of the programming model as well.

目次

Introduction MapReduce Basics MapReduce Algorithm Design Inverted Indexing for Text Retrieval Graph Algorithms EM Algorithms for Text Processing Closing Remarks

「Nielsen BookData」 より

関連文献: 1件中  1-1を表示

詳細情報

  • NII書誌ID(NCID)
    BB03047125
  • ISBN
    • 9781608453429
  • 出版国コード
    us
  • タイトル言語コード
    eng
  • 本文言語コード
    eng
  • 出版地
    [San Rafael, Calif]
  • ページ数/冊数
    ix, 165 p.
  • 大きさ
    24 cm
  • 親書誌ID
ページトップへ