scholarly journals COVID 19 Data Clustering a nd Testing with K Means Mapper and Reducer

2021 ◽  
Vol 11 (2) ◽  
pp. 23-25
Author(s):  
A. Anusha ◽  
◽  
Dr. K. Kishore Raju ◽  
Keyword(s):  
Infectious Disease ◽  
Distributed Computing ◽  
Large Volume ◽  
Data Clustering ◽  
Experimental Results ◽  
High Rate ◽  
Computing Environment ◽  
Data Volume ◽  
Very High

Due to the emergence of a new infectious disease (COVID-19), the worldwide data volume has been quickly increasing at a very high rate during the last two years. Due its infectious, and importance, in this paper, K-Means clustering procedure is applied on COVID data in MapReduce based distributed computing environment. The proposed system is store, process and tests the large volume of COVID-19 data. Experimental results had been proved that this process is adaptable to COVID-19 data in the formation of trusted clusters.

scholarly journals IoT-enabled directed acyclic graph in spark cluster

2020 ◽  
Vol 9 (1) ◽  
Author(s):  
Jahwan Koo ◽  
Nawab Muhammad Faseeh Qureshi ◽  
Isma Farah Siddiqui ◽  
Asad Abbas ◽  
Ali Kashif Bashir
Keyword(s):  
Distributed Computing ◽  
Real Time ◽  
Directed Acyclic Graph ◽  
Random Access ◽  
Heterogeneous Data ◽  
The Body ◽  
Computing Environment ◽  
Time Data ◽  
Acyclic Graph ◽  
Sensory Data

Abstract Real-time data streaming fetches live sensory segments of the dataset in the heterogeneous distributed computing environment. This process assembles data chunks at a rapid encapsulation rate through a streaming technique that bundles sensor segments into multiple micro-batches and extracts into a repository, respectively. Recently, the acquisition process is enhanced with an additional feature of exchanging IoT devices’ dataset comprised of two components: (i) sensory data and (ii) metadata. The body of sensory data includes record information, and the metadata part consists of logs, heterogeneous events, and routing path tables to transmit micro-batch streams into the repository. Real-time acquisition procedure uses the Directed Acyclic Graph (DAG) to extract live query outcomes from in-place micro-batches through MapReduce stages and returns a result set. However, few bottlenecks affect the performance during the execution process, such as (i) homogeneous micro-batches formation only, (ii) complexity of dataset diversification, (iii) heterogeneous data tuples processing, and (iv) linear DAG workflow only. As a result, it produces huge processing latency and the additional cost of extracting event-enabled IoT datasets. Thus, the Spark cluster that processes Resilient Distributed Dataset (RDD) in a fast-pace using Random access memory (RAM) defies expected robustness in processing IoT streams in the distributed computing environment. This paper presents an IoT-enabled Directed Acyclic Graph (I-DAG) technique that labels micro-batches at the stage of building a stream event and arranges stream elements with event labels. In the next step, heterogeneous stream events are processed through the I-DAG workflow, which has non-linear DAG operation for extracting queries’ results in a Spark cluster. The performance evaluation shows that I-DAG resolves homogeneous IoT-enabled stream event issues and provides an effective stream event heterogeneous solution for IoT-enabled datasets in spark clusters.

Algorithm of Text Categorization Based on Cloud Computing

2013 ◽  
Vol 311 ◽  
pp. 158-163 ◽  
Author(s):  
Li Qin Huang ◽  
Li Qun Lin ◽  
Yan Huang Liu
Keyword(s):  
Cloud Computing ◽  
Text Categorization ◽  
Experimental Results ◽  
Support Vector ◽  
Computing Environment ◽  
Mapreduce Framework ◽  
Cloud Computing Environment ◽  
Environment Map ◽  
Vector Machines ◽  
Parallel Text

MapReduce framework of cloud computing has an effective way to achieve massive text categorization. In this paper a distributed parallel text training algorithm in cloud computing environment based on multi-class Support Vector Machines(SVM) is designed. In cloud computing environment Map tasks realize distributing various types of samples and Reduce tasks realize the specific SVM training. Experimental results show that the execution time of text training decreases with the number of Reduce tasks increasing. Also a parallel text classifying based on cloud computing is designed and implemented, which classify the unknown type texts. Experimental results show that the speed of text classifying increases with the number of Map tasks increasing.

Sign in / Sign up

Export Citation Format

Share Document