Search Results - (( parallel distribution mining algorithm ) OR ( probable distribution sensor algorithm ))

Parallel execution of distributed SVM using MPI (CoDLib) by Salleh N.S.M., Suliman A., Ahmad A.R.

Subjects:

Energy Efficient LEACH (EE-LEACH) Routing Algorithm for Wireless Sensor Networks by Pillay, Kosheila Sundram

“…Therefore, this research work proposes an energy-efficient LEACH (EE-LEACH) algorithm to elect CHs based on residual energy, RSSI, and random probability to distribute the load evenly among the CHs. …”
Get full text
Get full text

Recent Efficient Iterative Algorithms on Cognitive Radio Cooperative Spectrum Sensing to Improve Reliability and Performance by Akbari, M., Reza, A.W., Noordin, K.A., Dimyati, K., Manesh, M.R., Hindia, M.N.

Get full text
Get full text

Energy efficient cluster head distribution in wireless sensor networks by Siew, Zhan Wei

“…For network clustering, the distribution of CH selection directly influences the networks lifetime. …”
Get full text
Get full text
Get full text

Random sampling method of large-scale graph data classification by Rashed Mustafa, Mohammad Sultan Mahmud, Mahir Shadid

“…Mining a large number of graphs becomes a challenging task because state-of-the-art methods are not scalable due to the memory limit. …”
Get full text
Get full text
Get full text

Class binarization with self-adaptive algorithm to improve human activity recognition by Zainudin, Muhammad Noorazlan Shah

“…In comparison, WISDM utilizes an accelerometer sensor embedded in Android smartphone. Meanwhile, PAMAP2 utilizes an accelerometer sensor equipped with three Inertial Measurement Unit (IMU) devices attached to three different placements. …”
Get full text
Get full text

K Nearest Neighbor Joins And Mapreduce Process Enforcement For The Cluster Of Data Sets In Bigdata by Md Shah, Wahidah, Othman, Mohd Fairuz Iskandar, Hussian Hassan, Ali Abdul, Talib, Mohammed Saad, Mohammed, Ali Abdul Jabbar

“…K Nearest Neighbor Joins (KNN join) are regarded as highly primitive and expensive operations in the data mining.The efficient use of KNN join has proven good results in finding the objects from two data sets prevailed in the huge databases.This has been achieved with the combination of K-Nearest Neighbor query and join operation to find the distinct objects from different data sets.MapReduce is a newly introduced program with the combination of Map Procedure method and Reduce Method widely used in BigData.MapReduce is enriched with parallel distributed algorithm to find the results on a cluster of data sets in BigData.In this paper,the combination of KNN join and MapReduce methods are utilized on the cluster of data sets in BigData for knowledge discovery.Exploring the pinpoint data from huge data sets stored in Big Data demands the distributed large scale data processing.The present research paper is focusing on generic steps for KNN joins exploration operations on MapReduce.The operations of KNN Join are targeted to perform the data partitioning and data pre-processing and necessary calculations.By utilizing the combination of KNN joins with MapReduce methods on BigData data sets will demonstrate a solution for complex computational analysis. …”
Get full text
Get full text
Get full text

EFFICIENT DYNAMIC ADDRESSING BASED ROUTING FOR UNDERWATER WIRELESS SENSOR NETWORKS by ARSHAD, MUHAMMAD AYAZ ARSHAD

“…Besides long propagation delays and high error probability, continuous node movement also makes it difficult to manage the routing information during the process of data forwarding. …”
Get full text
Get full text

Prediction of rice biomass using machine learning algorithms by Radhwane, Derraz

“…The Q-TESI, C-TESI, and L-TESI overcame the LN-TESI in retaining the features’ original probability distribution, minimising the augmentation loss, reducing the VIF, increasing the rs, and decreasing the DNN under- and overfitting. …”
Get full text
Get full text