Search Results - (( based constructive method algorithm ) OR ( set generation method algorithm ))

Refine Results
  1. 1

    Ant system-based feature set partitioning algorithm for classifier ensemble construction by Abdullah, , Ku-Mahamud, Ku Ruhana

    Published 2016
    “…In this study, Ant system-based feature set partitioning algorithm for classifier ensemble construction is proposed.The Ant System Algorithm is used to form an optimal feature set partition of the original training set which represents the number of classifiers.Experiments were carried out to construct several homogeneous classifier ensembles using nearest mean classifier, naive Bayes classifier, k-nearest neighbor and linear discriminant analysis as base classifier and majority voting technique as combiner. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    An evolutionary based features construction methods for data summarization approach by Rayner Alfred, Suraya Alias, Chin, Kim On

    Published 2015
    “…Here, feature construction methods are applied in order to improve the descriptive accuracy of the DARA algorithm.This research proposes novel feature construction methods, called Variable Length Feature Construction without Substitution (VLFCWOS) and Variable Length Feature Construction with Substitution(VLFCWS), in order to construct a set of relevant features in learning relational data. …”
    Get full text
    Get full text
    Research Report
  3. 3
  4. 4

    A new starter sets generation method by fixing any element under exchange restriction by Karim, Sharmila, Ibrahim, Haslinda, Omar, Zurni, Sapiri, Hasimah

    Published 2016
    “…A new method is developed for starter sets generation namely STARSET2 based on exchange where any element can be selected randomly to be fixed.The result showed that no redundancy of starter sets is occurring and no equivalence starter sets are obtained.…”
    Get full text
    Get full text
    Article
  5. 5

    A new method for starter sets generation by fixing any element by Karim, Sharmila, Ibrahim, Haslinda, Sapiri, Hasimah

    Published 2015
    “…a new permutation technique based on distinct starter sets was introduced by employing circular and reversing operations.The crucial task is to generate the distinct starter sets by eliminating the equivalence starter sets.Meanwhile new strategies for starter sets generation without generating its equivalence starter sets were developed and more efficient in terms of computation time compared to old method.However all these algorithms have limitations in terms of fixing element to construct the first set (starter set) to begin with.It would be interesting to derive new strategy by fixing an element in any position. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

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

    Published 2010
    “…Our algorithm works based on prime factorization, and is called Frequent Pattern-Prime Factorization (FPPF).…”
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

    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
  8. 8

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

    Published 2022
    “…A statistical test was used to demonstrate the efficiency of the proposed algorithm over the compared methods. The GLS is 7.8 and 5.5 times faster than A* and LS, respectively, generating a path 1.2 and 1.5 times shorter than A* and LS. …”
    Get full text
    Thesis
  9. 9

    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 aim of this paper is to exploit the capability of bio-inspired search algorithms, together with wrapper and filtered methods in generating optimal set of features. …”
    Get full text
    Get full text
    Book Section
  10. 10

    Non-fiducial based electrocardiogram biometrics with kernel methods by Hejazi, Maryamsadat

    Published 2017
    “…The effectiveness of this algorithm is investigated by comparing with other AC based feature extraction algorithms involving AC/LDA (Linear Discriminant Analysis) and AC/PCA (Principal Component Analysis). …”
    Get full text
    Get full text
    Thesis
  11. 11

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

    Published 2011
    “…Our algorithm works based on prime factorization and is called Prime Factor Miner (PFM). …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Efficient dynamic DNA-based block cipher algorithm by Chng, Chern Wei

    Published 2023
    “…The proposed method involves utilising DNA-based components consisting of the nucleotides {A, T, G, C} to generate a novel Dynamic DNA-based S-Box. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems by Bashar AbedAl Mohdi Talal AlDeeb

    Published 2024
    “…(iii) It is a constructive-based meta-heuristic algorithm which means, the solution is incrementally constructed (step by step) until the complete solution is obtained (Noferesti and Shah-Hosseini, 2012). …”
    thesis::doctoral thesis
  14. 14
  15. 15

    A hybrid approach for personalized news recommendation with ordered clustering algorithm, rich user and news metadata by Darvishy, Asghar

    Published 2019
    “…In recent years, there has been much focus on the design and development of personalized news recommendation systems that observe and learn user behavior and generate news set based on this behavior. Commonly, the current news recommendation systems employ the collaborative filtering-based (CF-based), Content-based filtering (Content-based) or hybrid methods. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Machine learning in botda fibre sensor for distributed temperature measurement by Nur Dalilla binti Nordin

    Published 2023
    “…An alternative method is proposed, utilizing machine learning algorithms. …”
    text::Thesis
  17. 17

    Solving an application of university course timetabling problem by using genetic algorithm by Norhana, Shaibatul Khadri

    Published 2022
    “…Many efforts have been made using various computational heuristic methods to acquire the best solutions. Among the approaches, genetic algorithm (GA), constructed based on Darwin's theory of evolution, becomes the renowned approach to solve various types of timetabling problems. …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    New Sequential and Parallel Division Free Methods for Determinant of Matrices by Sharmila, Karim

    Published 2013
    “…The computation times in the newly developed sequential methods were dominated by generating starter sets. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Generating mutually unbiased bases and discrete Wigner functions for three-qubit system by Aliakbarzadeh, Mojtaba, Zainuddin, Hishamuddin

    Published 2014
    “…It is known that there exists 2N+ 1 mutually unbiased bases for N qubits system. Between the different MUB construction algorithms of the three-qubit case, we focus on Wootters method with discrete phase space that leads naturally to a complete set of 2N+ 1 mutually unbiased bases for the state space. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Global Algorithms for Nonlinear Discrete Optimization and Discrete-Valued Optimal Control Problems by Woon, Siew Fang

    Published 2009
    “…Most practical discrete-valued optimal control problems have multiple local minima and thus require global optimization methods to generate practically useful solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis