Search Results - candidate ((generation algorithm) OR (pollination algorithm))

Search alternatives:

Refine Results
  1. 1
    An improved Levenshtein algorithm for spelling correction word candidate list generation

    An improved Levenshtein algorithm for spelling correction word candidate list generation by Abdulkhudhur, Hanan Najm

    Published 2016
    “…The most widely used algorithm for generating candidates’ list for incorrect words is based on Levenshtein distance. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Implementation of improved Levenshtein algorithm for spelling correction word candidate list generation

    Implementation of improved Levenshtein algorithm for spelling correction word candidate list generation by Abdulkhudur, Hanan Najm, Habeeb, Imad Q., Yusof, Yuhanis, Mohd Yusof, Shahrul Azmi

    Published 2016
    “…The most widely used algorithm to generate the candidate list is the Levenshtein algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Application of Shuffled Frog Leaping Algorithm (SFLA) to long term generation expansion planning / Nurul Ulya Ibrahim

    Application of Shuffled Frog Leaping Algorithm (SFLA) to long term generation expansion planning / Nurul Ulya Ibrahim by Ibrahim, Nurul Ulya

    Published 2016
    “…This method is tested for 15 existing power plant and five generation candidates within 10 years of planning. The simulation results obtained using the proposed algorithm show that the minimum cost can be obtained for types of candidate.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Using unique-prime-factorization theorem to mine frequent patterns without generating tree

    Using unique-prime-factorization theorem to mine frequent patterns without generating tree by Tohidi, Hossein, Ibrahim, Hamidah

    Published 2011
    “…For huge database it may need to generate a huge number of candidate sets. An interest solution is to design an approach that without generating candidate is able to mine frequent patterns. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Direct approach for mining association rules from structured XML data

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

    Published 2012
    “…Another aim of this study is to do an enhancement on the current structure of FLEX algorithm in terms of elimination of the candidate generation step. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    3D face candidate region detection using background subtraction / Zulfikri Paidi and Nurzaid Muhd Zain

    3D face candidate region detection using background subtraction / Zulfikri Paidi and Nurzaid Muhd Zain by Paidi, Zulfikri, Muhd Zain, Nurzaid

    Published 2016
    “…From the experiment, it shows some promising results related to using background subtraction in face candidate region detection algorithm. Firstly, we have succeeded in generating an oval shape for boundary region detection. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Optimizing S-box generation based on the Adaptive Agent Heroes and Cowards Algorithm

    Optimizing S-box generation based on the Adaptive Agent Heroes and Cowards Algorithm by Kamal Z., Zamli

    Published 2021
    “…This paper introduces a new variant of a metaheuristic algorithm based on Agent Heroes and Cowards Algorithm (AHC), called Adaptive Agent Heroes and Cowards Algorithm (AAHC). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    PMT : opposition based learning technique for enhancing metaheuristic algorithms performance

    PMT : opposition based learning technique for enhancing metaheuristic algorithms performance by Hammoudeh, S. Alamri

    Published 2020
    “…Unlike existing OBL-based techniques, the PMT generates more than one candidate in multiple solution-space directions. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    A frequent pattern mining algorithm based on FP-growth without generating tree

    A frequent pattern mining algorithm based on FP-growth without generating tree by Tohidi, Hossein, Ibrahim, Hamidah

    Published 2010
    “…In this paper we introduce an algorithm to generate frequent patterns without generating a tree and therefore improve the time complexity and memory complexity as well. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    A frequent pattern mining algorithm based on FP-growth without generating tree

    A frequent pattern mining algorithm based on FP-growth without generating tree by Tohid, Hossein, Ibrahim, Hamidah

    Published 2010
    “…It then divides the compressed database into a set of conditional databases (a special kind of projected database), each associated with one frequent item or pattern fragment, and mines each such database separately.For a large database, constructing a large tree in the memory is a time consuming task and increase the time of execution.In this paper we introduce an algorithm to generate frequent patterns without generating a tree and therefore improve the time complexity and memory complexity as well.Our algorithm works based on prime factorization, and is called Frequent Pattern- Prime Factorization (FPPF).…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  11. 11
    PMT: opposition-based learning technique for enhancing meta-heuristic performance

    PMT: opposition-based learning technique for enhancing meta-heuristic performance by Alamri, Hammoudeh S., Kamal Z., Zamli

    Published 2019
    “…Unlike existing OBL-based techniques, the PMT generates more than one candidate in multiple solution-space directions. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    A generalized laser simulator algorithm for optimal path planning in constraints environment

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Study and Designing of Digital Three-Dimension Space Visualizer for Centralize Drone Performance

    Study and Designing of Digital Three-Dimension Space Visualizer for Centralize Drone Performance by Kiun, Sie Suai [

    Published 2019
    “…Method and algorithm to generate flexible paths of UAVs has been very crucial research area since recent years. …”
    Get full text
    Get full text
    Final Year Project Report / IMRAD
    Save to List
    Saved in:
  14. 14
    Static code analysis of permission-based features for android malware classification using apriori algorithm with particle swarm optimization

    Static code analysis of permission-based features for android malware classification using apriori algorithm with particle swarm optimization by Adebayo, Olawale Surajudeen, Abdul Aziz, Normaziah

    Published 2015
    “…This paper presents a classification approach on android malware using candidate detectors generated from an unsupervised association rule of Apriori Algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Optimal Location And Sizing Of Distrubuted Generator Using PSO And GA Algorithms In Power Systems

    Optimal Location And Sizing Of Distrubuted Generator Using PSO And GA Algorithms In Power Systems by Hassan, Ayat Saleh

    Published 2019
    “…The multi-objective function, which represents the summation of product three indices by corresponding weights was utilized to identify the candidate buses to reduce the search space of the algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    New Parameter Reduction of Soft Sets

    New Parameter Reduction of Soft Sets by Ma, Xiuqin

    Published 2012
    “…The related heuristic algorithms are given. In order to show the high efficiency of the proposed four algorithms, comparisons and analysis for decision making between OCCPR, IRDCCPR, ASPR, SPR and directly Interval-Valued Fuzzy Soft Sets based Fuzzy Decision Making algorithm (IVFSS-FDM) with three real-life datasets and ten synthetic generated datasets are made. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Android Malware classification using static code analysis and Apriori algorithm improved with particle swarm optimization

    Android Malware classification using static code analysis and Apriori algorithm improved with particle swarm optimization by Adebayo, Olawale Surajudeen, Abdul Aziz, Normaziah

    Published 2014
    “…This paper presents a classification of android malware using candidate detectors generated from an unsupervised association rule of Apriori algorithm improved with particle swarm optimization to train three different supervised classifiers. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  18. 18
    Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems

    Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems by Yasear, Shaymah Akram

    Published 2020
    “…The algorithm includes (i) a population update strategy which improves the movement of hawks in the search space, (ii) a parameter adjusting strategy to control the transition between exploration and exploitation, and (iii) a population generating method in producing the initial candidate solutions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Comparative study of apriori-variant algorithms

    Comparative study of apriori-variant algorithms by Mutalib, Sofianita, Abdul Subar, Ammar Azri, Abdul Rahman, Shuzlina, Mohamed, Azlinah

    Published 2016
    “…However, the algorithm suffers from scanning time problem while generating candidates of frequent itemsets.This study presents a comparative study between several Apriori-variant algorithms and examines their scanning time.We performed experiments using several sets of different transactional data.The result shows that the improved Apriori algorithm manage to produce itemsets faster than the original Apriori algorithm.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    Improved Malware detection model with Apriori Association rule and particle swarm optimization

    Improved Malware detection model with Apriori Association rule and particle swarm optimization by Adebayo, Olawale Surajudeen, Abdul Aziz, Normaziah

    Published 2019
    “…Particle swarm optimization (PSO) is used to optimize the random generation of candidate detectors and parameters associated with apriori algorithm (AA) for features selection. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: