完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Gau, Rung-Hung | en_US |
dc.contributor.author | Hsieh, Tzu-Chiang | en_US |
dc.contributor.author | Tsai, Sheng-Wen | en_US |
dc.contributor.author | Cheng, Ching-Pei | en_US |
dc.date.accessioned | 2014-12-08T15:23:05Z | - |
dc.date.available | 2014-12-08T15:23:05Z | - |
dc.date.issued | 2011 | en_US |
dc.identifier.isbn | 978-1-4503-0903-5 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/16239 | - |
dc.description.abstract | In this paper, we introduce our own implementation of Map Reduce graph-theoretic algorithms for Email social network analysis on the Hadoop platform. Graph theory is a powerful tool for social network analysis and Map Reduce is a well-known paradigm for distributed parallel computing. However, based on our own experience, unlike writing conventional Java/C++ programs, writing Java programs to implement Map Reduce graph-theoretic algorithms is not straight-forward, even for some fundamental graph-theoretic algorithms. In this paper, for the problem of Email social network analysis, we compare the performance of cloud computing programs with that of conventional computer programs. We show that as long as the size of the input data exceeds a threshold, the cloud computing programs outperform their conventional counterparts. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Cloud computing | en_US |
dc.subject | MapReduce | en_US |
dc.subject | graph theory | en_US |
dc.subject | social network analysis | en_US |
dc.title | An Implementation Framework of MapReduce Email Social Network Analysis | en_US |
dc.type | Proceedings Paper | en_US |
dc.identifier.journal | WMUNEP 11: PROCEEDINGS OF THE SEVENTH ACM WORKSHOP ON WIRELESS MULTIMEDIA NETWORKING AND COMPUTING | en_US |
dc.citation.epage | 67 | en_US |
dc.contributor.department | 電機工程學系 | zh_TW |
dc.contributor.department | Department of Electrical and Computer Engineering | en_US |
dc.identifier.wosnumber | WOS:000304071400011 | - |
顯示於類別: | 會議論文 |