MapReduce Minimum Spanning Tree Based Data With Mapreduce Implementation
نویسنده
چکیده
منابع مشابه
Spanning Tree Method for Minimum Communication Costs In Grouped Virtual MapReduce Cluster
Today, MapReduce and virtual cluster are sharp swords for this big data and cloud computing era. To combine these two emerging technologies, it brings feasible-scalability, easy-management, fast-deployment and high-efficiency with the system. As every sword has two sides, the I/O bottleneck of virtualization technologies may seriously impacts on the performance of MapReduce cluster which deals ...
متن کاملNotes on MapReduce Algorithms
Set k = N c 2 . Partition V into k parts of equal size: V1, V2, ...., Vk with Vi ∩ Vj = φ for i 6= j and |Vi| = Nk for all i. . Let Ei,j ⊆ E be the set of edges induced by the vertex set Vi ∪ Vj , that is Ei,j = {(u, v) ∈ E | u, v ∈ Vi ∪ Vj}. Distribute Gi,j = {Vi ∪ Vj , Ei,j} to each server and compute its minimum spanning tree Mi,j . Distribute H = ∪Mi,j to a single server and compute the fin...
متن کاملIncremental, distributed single-linkage hierarchical clustering algorithm using mapreduce
Single-linkage hierarchical clustering is one of the prominent and widely-used data mining techniques for its informative representation of clustering results. However, the parallelization of this algorithm is challenging as it exhibits inherent data dependency during the hierarchical tree construction. Moreover, in many modern applications, new data is continuously added into the already huge ...
متن کاملAdaptive Dynamic Data Placement Algorithm for Hadoop in Heterogeneous Environments
Hadoop MapReduce framework is an important distributed processing model for large-scale data intensive applications. The current Hadoop and the existing Hadoop distributed file system’s rack-aware data placement strategy in MapReduce in the homogeneous Hadoop cluster assume that each node in a cluster has the same computing capacity and a same workload is assigned to each node. Default Hadoop d...
متن کاملResearch of Decision Tree on YARN Using MapReduce and Spark
Decision tree is one of the most widely used classification methods. For massive data processing, MapReduce is a good choice. Whereas, MapReduce is not suitable for iterative algorithms. The programming model of Spark is proposed as a memory-based framework that is fit for iterative algorithms and interactive data mining. In this paper, C4.5 is implemented on both MapReduce and Spark. The resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012