東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

A MapReduce Algorithm for Finding Ho...

Ashokan, Ashwathy P.

FindBook

Google Book

Amazon

博客來

A MapReduce Algorithm for Finding Hotspots of Topics from Time Stamped Documents.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	A MapReduce Algorithm for Finding Hotspots of Topics from Time Stamped Documents./
作者:	Ashokan, Ashwathy P.
面頁冊數:	67 p.
附註:	Source: Masters Abstracts International, Volume: 51-05.
Contained By:	Masters Abstracts International51-05(E).
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1535875
ISBN:	9781303030451

A MapReduce Algorithm for Finding Hotspots of Topics from Time Stamped Documents.
Ashokan, Ashwathy P.

A MapReduce Algorithm for Finding Hotspots of Topics from Time Stamped Documents. - 67 p.

Source: Masters Abstracts International, Volume: 51-05.

Thesis (M.S.)--University of Nebraska at Omaha, 2013.

Hotspots of a word/topic are time periods with a burst of activities in a time stamped document set. Identifying and analyzing hot spots of topics has been an important area of research. Finding hot spots of topics requires processing of contents of documents which is often time consuming. In this thesis, we explore MapReduce style algorithms for computing hot spots of topics. MapReduce is a distributed parallel programming model and an associated implementation for processing and analyzing large datasets. User specifies 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. Many real world tasks are expressible in this model and this thesis explores the feasibility of implementing the hotspot algorithm using MapReduce. We design map and reduce functions appropriate for preprocessing of documents, and the hot spot computation. We implement the functions in Hadoop (a MapReduce framework for Apache Foundation) and conduct several experiments to assess the benefits of MapReduce style implementation versus simple sequential implementation.

ISBN: 9781303030451Subjects--Topical Terms:

626642
Computer Science.

A MapReduce Algorithm for Finding Hotspots of Topics from Time Stamped Documents.
LDR:02144nam a2200301 4500 001 1959440
005 20140520124311.5
008 150210s2013 ||||||||||||||||| ||eng d
020 $a 9781303030451
035 $a (MiAaPQ)AAI1535875
035 $a AAI1535875
040 $a MiAaPQ $c MiAaPQ
100 1 $a Ashokan, Ashwathy P. $3 2094864
245 1 2 $a A MapReduce Algorithm for Finding Hotspots of Topics from Time Stamped Documents.
300 $a 67 p.
500 $a Source: Masters Abstracts International, Volume: 51-05.
500 $a Adviser: Parvathi Chundi.
502 $a Thesis (M.S.)--University of Nebraska at Omaha, 2013.
520 $a Hotspots of a word/topic are time periods with a burst of activities in a time stamped document set. Identifying and analyzing hot spots of topics has been an important area of research. Finding hot spots of topics requires processing of contents of documents which is often time consuming. In this thesis, we explore MapReduce style algorithms for computing hot spots of topics. MapReduce is a distributed parallel programming model and an associated implementation for processing and analyzing large datasets. User specifies 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. Many real world tasks are expressible in this model and this thesis explores the feasibility of implementing the hotspot algorithm using MapReduce. We design map and reduce functions appropriate for preprocessing of documents, and the hot spot computation. We implement the functions in Hadoop (a MapReduce framework for Apache Foundation) and conduct several experiments to assess the benefits of MapReduce style implementation versus simple sequential implementation.
520 $a Keywords: Hotspots, MapReduce, Hadoop, Temporal Index.
590 $a School code: 1060.
650 4 $a Computer Science. $3 626642
650 4 $a Information Technology. $3 1030799
650 4 $a Engineering, Computer. $3 1669061
690 $a 0984
690 $a 0489
690 $a 0464
710 2 $a University of Nebraska at Omaha. $b Computer Science. $3 1020791
773 0 $t Masters Abstracts International $g 51-05(E).
790 $a 1060
791 $a M.S.
792 $a 2013
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1535875