The conventional procedures of clustering algorithms are incapable of overcoming the difficulty of managing and analyzing the rapid growth of generated data from different sources. Using the concept of parallel clustering is one of the robust solutions to this problem. Apache Hadoop architecture is one of the assortment ecosystems that provide the capability to store and process the data in a distributed and parallel fashion. In this paper, a parallel model is designed to process the k-means clustering algorithm in the Apache Hadoop ecosystem by connecting three nodes, one is for server (name) nodes and the other two are for clients (data) nodes. The aim is to speed up the time of managing the massive scale of healthcare insurance dataset with the size of 11 GB and also using machine learning algorithms, which are provided by the Mahout Framework. The experimental results depict that the proposed model can efficiently process large datasets. The parallel k-means algorithm outperforms the sequential k-means algorithm based on the execution time of the algorithm, where the required time to execute a data size of 11 GB is around 1.847 hours using the parallel k-means algorithm, while it equals 68.567 hours using the sequential k-means algorithm. As a result, we deduce that when the nodes number in the parallel system increases, the computation time of the proposed algorithm decreases.
In recent years, Wireless Sensor Networks (WSNs) are attracting more attention in many fields as they are extensively used in a wide range of applications, such as environment monitoring, the Internet of Things, industrial operation control, electric distribution, and the oil industry. One of the major concerns in these networks is the limited energy sources. Clustering and routing algorithms represent one of the critical issues that directly contribute to power consumption in WSNs. Therefore, optimization techniques and routing protocols for such networks have to be studied and developed. This paper focuses on the most recent studies and algorithms that handle energy-efficiency clustering and routing in WSNs. In addition, the prime
... Show MoreScience, technology and many other fields are use clustering algorithm widely for many applications, this paper presents a new hybrid algorithm called KDBSCAN that work on improving k-mean algorithm and solve two of its
problems, the first problem is number of cluster, when it`s must be entered by user, this problem solved by using DBSCAN algorithm for estimating number of cluster, and the second problem is randomly initial centroid problem that has been dealt with by choosing the centroid in steady method and removing randomly choosing for a better results, this work used DUC 2002 dataset to obtain the results of KDBSCAN algorithm, it`s work in many application fields such as electronics libraries,
tock markets changed up and down during time. Some companies’ affect others due to dependency on each other . In this work, the network model of the stock market is discribed as a complete weighted graph. This paper aims to investigate the Iraqi stock markets using graph theory tools. The vertices of this graph correspond to the Iraqi markets companies, and the weights of the edges are set ulrametric distance of minimum spanning tree.
the study considers the optical classification of cervical nodal lymph cells and is based on research into the development of a Computer Aid Diagnosis (CAD) to detect the malignancy cases of diseases. We consider 2 sets of features one of them is the statistical features; included Mode, Median, Mean, Standard Deviation and Maximum Probability Density and the second set are the features that consist of Euclidian geometrical features like the Object Perimeter, Area and Infill Coefficient. The segmentation method is based on following up the cell and its background regions as ranges in the minimum-maximum of pixel values. The decision making approach is based on applying of Minimum Dista
Analysis system of sports players is very important for individuals in weightlifting. Assessment of player and strength is important for the performance of weightlifting. This paper proposes an analytical method for weightlifters with check-by-frame video. This analysis system can compute the major steps of seven positions in both snatch and clean and jerk methods in frame-video weightlifting monitoring of movements. Each user can compute the major steps of the seven positions of Hu moments among two frames in the video during training, and the Euclidian distance can be computed for the Hu moment values and lifting moment values in the snatch and clean and jerk methods during training. The outcome of the proposed system shows on efficien
... Show More