Search Results - (( parallel optimization method algorithm ) OR ( features solution mining algorithm ))

Refine Results
  1. 1

    A partition based feature selection approach for mixed data clustering / Ashish Dutt by Ashish , Dutt

    Published 2020
    “…In this thesis, a novel weighted feature selection approach on nominal features is proposed, for a partition. clustering algorithm that can handle mixed data. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

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

    Published 2011
    “…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
    Thesis
  3. 3

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

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

    Tree-based contrast subspace mining method by Florence Sia Fui Sze

    Published 2020
    “…Genetic algorithm has been widely used to find global solution to optimization and search problem. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    A multi-layer dimension reduction algorithm for text mining of news in forex / Arman Khadjeh Nassirtoussi by Nassirtoussi, Arman Khadjeh

    Published 2015
    “…The major finding of this review is that context-specific text mining algorithms are lacking. The main underlying text-mining challenge that seems to deserve immediate attention is the sparse and high dimensional nature of the feature-space. …”
    Get full text
    Get full text
    Thesis
  6. 6

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

    Published 2015
    “…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
    Article
  7. 7

    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

    Published 2007
    “…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
    Research Report
  8. 8

    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

    Published 2024
    “…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
    Article
  9. 9

    Semi-supervised learning for feature selection and classification of data / Ganesh Krishnasamy by Ganesh , Krishnasamy

    Published 2019
    “…The proposed algorithm is compared with the state-of-the-art feature selection algorithms using three different datasets. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

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

    Published 2018
    “…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
    Thesis
  11. 11

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

    Published 2014
    “…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
    Thesis
  12. 12

    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

    Published 2022
    “…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
    Article
  13. 13

    Ideal combination feature selection model for classification problem based on bio-inspired approach by Basir, Mohammad Aizat, Hussin, Mohamed Saifullah, Yusof, Yuhanis

    Published 2020
    “…The important step is to idealize the combined feature selection models by finding the best combination of search method and feature selection algorithms. …”
    Get full text
    Get full text
    Book Section
  14. 14

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

    Published 2016
    “…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
    Conference or Workshop Item
  15. 15

    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
    Article
  16. 16

    Towards a better feature subset selection approach by Shiba, Omar A. A.

    Published 2010
    “…The selection of the optimal features subset and the classification has become an important issue in the data mining field.We propose a feature selection scheme based on slicing technique which was originally proposed for programming languages.The proposed approach called Case Slicing Technique (CST).Slicing means that we are interested in automatically obtaining that portion 'features' of the case responsible for specific parts of the solution of the case at hand.We show that our goal should be to eliminate the number of features by removing irrelevant once.Choosing a subset of the features may increase accuracy and reduce complexity of the acquired knowledge.Our experimental results indicate that the performance of CST as a method of feature subset selection is better than the performance of the other approaches which are RELIEF with Base Learning Algorithm (C4.5), RELIEF with K-Nearest Neighbour (K-NN), RELIEF with Induction of Decision Tree Algorithm (ID3) and RELIEF with Naïve Bayes (NB), which are mostly used in the feature selection task.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

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

    Published 2010
    “…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
    Thesis
  18. 18
  19. 19

    Feature and Instances Selection for Nearest Neighbor Classification via Cooperative PSO by Sharifah Sakinah, Syed Ahmad

    Published 2014
    “…Data reduction is an essential task in the data preparation phase of knowledge discovery and data mining (KDD). The reduction method contains two techniques, namely features reduction and data reduction which are commonly applied to a classification problem. …”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    Application Of Genetic Algorithms For Robust Parameter Optimization by Belavendram, N.

    Published 2010
    “…Genetic algorithms (GA) are fairly recent in this respect but afford a novel method of parameter optimization. …”
    Get full text
    Get full text
    Article