Search Results - (( knowledge utilization clustering algorithm ) OR ( parallel optimization method algorithm ))

Document clustering for knowledge discovery using nature-inspired algorithm by Mohammed, Athraa Jasim, Yusof, Yuhanis, Husni, Husniza

“…As the internet is overload with information, various knowledge based systems are now equipped with data analytics features that facilitate knowledge discovery.This includes the utilization of optimization algorithms that mimics the behavior of insects or animals.This paper presents an experiment on document clustering utilizing the Gravitation Firefly algorithm (GFA).The advantage of GFA is that clustering can be performed without a pre-defined value of k clusters.GFA determines the center of clusters by identifying documents with high force.Upon identification of the centers, clusters are created based on cosine similarity measurement.Experimental results demonstrated that GFA utilizing a random positioning of documents outperforms existing clustering algorithm such as Particles Swarm Optimization (PSO) and K-means.…”
Get full text
Get full text
Get full text

Voting algorithms for large scale fault-tolerant systems by Karimi, Abbas

“…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
Get full text
Get full text

Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures by Koohi, Sina Zangbari

“…Any optimization algorithm is suitable for only a specific domain of optimization problems. …”
Get full text
Get full text

Determining number of clusters using firefly algorithm with cluster merging for text clustering by Mohammed, Athraa Jasim, Yusof, Yuhanis, Husni, Husniza

“…Such a scenario requires a dynamic text clustering method that operates without initial knowledge on a data collection.In this paper, a dynamic text clustering that utilizes Firefly algorithm is introduced.The proposed, aFAmerge, clustering algorithm automatically groups text documents into the appropriate number of clusters based on the behavior of firefly and cluster merging process. …”
Get full text
Get full text

Probabilistic ensemble fuzzy ARTMAP optimization using hierarchical parallel genetic algorithms by Loo, C.K., Liew, W.S., Seera, M., Lim, Einly

“…This was achieved by mitigating convergence in the genetic algorithms by employing a hierarchical parallel architecture. …”
Get full text
Get full text
Get full text

Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

“…These algorithms mostly built upon the partitioning k-means clustering algorithm. …”
Get full text
Get full text

Comparison of clustering algorithms on air quality substances in Peninsular Malaysia / Sitti Sufiah Atirah Rosly, Balkiah Moktar and Muhamad Hasbullah Mohd Razali by Rosly, Sitti Sufiah Atirah, Moktar, Balkiah, Mohd Razali, Muhamad Hasbullah

“…Monthly data from 37 monitoring stations in Peninsular Malaysia from the year 2013 to 2015 were used in this study. K-Means (KM) clustering algorithm, Expectation Maximization (EM) clustering algorithm and Density Based (DB) clustering algorithm have been chosen as the techniques to analyze the cluster analysis by utilizing the Waikato Environment for Knowledge Analysis (WEKA) tools. …”
Get full text
Get full text
Get full text

Big data clustering using grid computing and ant-based algorithm by Ku-Mahamud, Ku Ruhana

“…This paper presents a framework for big data clustering which utilizes grid technology and ant-based algorithm.…”
Get full text
Get full text
Get full text

Investigation on the dynamic of computation of semi autonomous evolutionary computation for syntactic optimization of a set of programming codes by Mohammad Sigit Arifianto, Tze, Kenneth Kin Teo, Liau, Chung Fan, Liawas Barukang, Zaturrawiah Ali Omar

“…Genetic Algorithm as one of the Evolutionary Computation method improve the execution of parallel programming codes by optimizing the number of processors and the distribution of data. …”
Get full text
Get full text

Improved black-winged kite algorithm and finite element analysis for robot parallel gripper design by Haohao, Ma, As’arry, Azizan, Yanwei, Feng, Lulu, Cheng, Delgoshaei, Aidin, Ismail, Mohd Idris Shah, Ramli, Hafiz Rashidi

“…This paper presents a comprehensive study on the design optimization of a robotic gripper, focusing on both the gripper modeling and the optimization of its parallel mechanism structure. …”
Get full text
Get full text
Get full text

Evaluation on rapid profiling with clustering algorithms for plantation stocks on Bursa Malaysia by Keng, Hoong Ng, Kok, Chin Khor

“…In this study, we utilized Expectation Maximization (EM), K-Means (KM), and Hierarchical Clustering (HC) algorithms to cluster the 38 plantation stocks listed on Bursa Malaysia using 14 financial ratios derived from the fundamental analysis.The clustering allows investors to profile each resulted cluster statistically and assists them in selecting stocks for their stock portfolios rapidly.The performance of each cluster was then assessed using 1-year stock price movement.The result showed that a cluster resulted from EM had a better profile and obtained a higher average capital gain as compared with the other clusters.…”
Get full text
Get full text
Get full text

Cluster identification and separation in the growing self-organizing map: Application in protein sequence classification by Ahmad, N.

“…Growing self-organizing map (GSOM) has been introduced as an improvement to the self-organizing map (SOM) algorithm in clustering and knowledge discovery. Unlike the traditional SOM, GSOM has a dynamic structure which allows nodes to grow reflecting the knowledge discovered from the input data as learning progresses. …”
Get full text
Get full text
Get full text

Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems by Uvaraja, Vikneswary

“…Additionally, the MTS algorithm is also implemented in parallel computing to produce parallel MTS for generating comparable solutions in shorter computational times. …”
Get full text
Get full text

Analysis of evolutionary computing performance via mapreduce parallel processing architecture / Ahmad Firdaus Ahmad Fadzil by Ahmad, Ahmad Firdaus

“…Examples of EC such as Genetic Algorithm (GA) and PSO (Particle Swarm Optimization) are prevalent due to their efficiency and effectiveness. …”
Get full text
Get full text

Distributed parallel deep learning with a hybrid backpropagation-particle swarm optimization for community detection in large complex networks by Shing, Chiang Ta, Mohammed Al-Andoli, Mohammed Nasser, Wooi, Ping Cheah

“…Next, the method is integrated with two optimization algorithms: (1) backpropagation (BP), which optimizes deep learning locally within each local chunk of the CN; (2) particle swarm optimization (PSO), which is used to improve the BP optimization involving all CN chunks. …”
Get full text
Get full text
Get full text
Get full text

Towards lowering computational power in IoT systems: Clustering algorithm for high-dimensional data stream using entropy window reduction by Alkawsi G., Al-amri R., Baashar Y., Ghorashi S., Alabdulkreem E., Kiong Tiong S.

“…The findings of the experiments are compared to the outcomes of BOCEDS, CEDAS, and MuDi-Stream algorithms. The outcomes indicate that the EWR algorithm outperformed the baseline clustering algorithms. …”

PID Parameters Improvement for AGC in Three Parallel-Connected Power Systems by Mushtaq, Najeeb, Ramdan, Razali, K. G., Mohammed, Hamdan, Daniyal, Ali, M. Humada

“…The AGC loop is used to minimize the frequency deviation and control the power exchange in order to maintain them at their scheduled values due to the changes of the step-load disturbance. The optimal parameters of the PID scheme optimized by the proposed MS algorithm are compared with that one’s obtained by GA algorithm, and the proposed method has proven that its performance is more efficient and improved as well. …”
Get full text
Get full text
Get full text

Biological-based semi-supervised clustering algorithm to improve gene function prediction by Kasim, Shahreen, Deris, Safaai, M. Othman, Razib, Hashim, Rathiah

“…However, commonclustering algorithms do not provide a comprehensive approach that look into the three categories of annotations; biologicalprocess, molecular function, and cellular component, and were not tested with different functional annotation database formats.Furthermore, the traditional clustering algorithms use random initialization which causes inconsistent cluster generation and areunable to determine the number of clusters involved. …”
Get full text
Get full text

Design and analysis of high performance matrix filling for DNA sequence alignment accelerator using asic design flow: article / Nurzaima Mahmod by Mahmod, Nurzaima

“…The scope of this paper is to optimize the DNA sequences alignment on the matrix rilling module by implementing a parallel method of the Smith-Waterman algorithm. …”
Get full text
Get full text

Design and analysis of high performance matrix filling for DNA sequence alignment accelerator using ASIC design flow / Nurzaima Mahmod by Mahmod, Nurzaima

“…The scope of this paper is to optimize the DNA sequences alignment on the matrix filling module by implementing a parallel method of the SmithWaterman algorithm. …”
Get full text
Get full text