Search Results - (( _ generating tree algorithm ) OR ( based optimization means algorithm ))*

Refine Results
  1. 1

    Support Vector Machines (SVM) in Test Extraction by Ghazali, Nadirah

    Published 2006
    “…This project's objective is to create a summarizer, or extractor, based on machine learning algorithms, which are namely SVM and K-Means. …”
    Get full text
    Get full text
    Final Year Project
  2. 2

    Support Vector Machines (SVM) in Test Extraction by Ghazali, Nadirah

    Published 2006
    “…This project's objective is to create a summarizer, or extractor, based on machine learning algorithms, which are namely SVM and K-Means. …”
    Get full text
    Get full text
    Final Year Project
  3. 3

    Fast clock tree generation using exact zero skew clock routing algorithm by Reaz, Mamun Ibn, Ibrahimy, Muhammad Ibn, Amin, Nowshad

    Published 2009
    “…The methodology has been tested using a real design database and resulting in a significant improvement in the through put time required to complete the clock tree generation. This improvement is attributed to the ability to generate clock tree on much smaller portions of clock nets that supports of speeding up the clock tree generation process in IC design. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

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

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

    Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

    Published 2021
    “…Among the techniques, the k-means algorithm is the most commonly used technique for determining optimal number of clusters (k). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    Predictive models for hotspots occurrence using decision tree algorithms and logistic regression. by Sitanggang, Imas Sukaesih, Yaakob, Razali, Mustapha, Norwati, Nuruddin, Ahmad Ainuddin

    Published 2013
    “…The results show that the C4.5 algorithm has better performance than the ID3 algorithm in terms of accuracy and the number of generated rules. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9
  10. 10
  11. 11

    Breast cancer disease classification using fuzzy-ID3 algorithm with FUZZYDBD method: automatic fuzzy database definition by Nur Farahaina, Idris, Mohd Arfian, Ismail

    Published 2021
    “…FID3 algorithm combined the fuzzy system and decision tree techniques with ID3 algorithm as the decision tree learning. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Impact of evolutionary algorithm on optimization of nonconventional machining process parameters by B V, Raghavendra, R Annigiri, Anandkumar, Srikatamurthy, JS

    Published 2025
    “…This paper presents the optimization of laser beam machining in additive manufacturing of polymer-based material parameters, specifically focusing on cutting speed, gas pressure of nitrogen, and focal point locations, to achieve optimal mean surface roughness. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Zero skew clock routing for fast clock tree generation by Reaz, Mamun Ibn, Amin, Nowshad, Ibrahimy, Muhammad Ibn, Mohamad-Yasin, F., Mohammad, A.

    Published 2008
    “…The methodology has been tested using a real design database and resulting in a significant improvement in the through put time required to complete the clock tree generation. This improvement is attributed to the ability to generate clock tree on much smaller portions of clock nets that supports of speeding up the clock tree generation process in IC design. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  14. 14

    Document clustering based on firefly algorithm by Mohammed, Athraa Jasim, Yusof, Yuhanis, Husni, Husniza

    Published 2015
    “…Document clustering is widely used in Information Retrieval however, existing clustering techniques suffer from local optima problem in determining the k number of clusters.Various efforts have been put to address such drawback and this includes the utilization of swarm-based algorithms such as particle swarm optimization and Ant Colony Optimization.This study explores the adaptation of another swarm algorithm which is the Firefly Algorithm (FA) in text clustering.We present two variants of FA; Weight- based Firefly Algorithm (WFA) and Weight-based Firefly Algorithm II (WFAII).The difference between the two algorithms is that the WFAII, includes a more restricted condition in determining members of a cluster.The proposed FA methods are later evaluated using the 20Newsgroups dataset.Experimental results on the quality of clustering between the two FA variants are presented and are later compared against the one produced by particle swarm optimization, K-means and the hybrid of FA and -K-means. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Fuzzy C-Mean And Genetic Algorithms Based Scheduling For Independent Jobs In Computational Grid by Lorpunmanee, Siriluck, Md Sap, Mohd Noor, Abdullah, Abdul Hanan

    Published 2006
    “…Our model presents the method of the jobs classifications based mainly on Fuzzy C-Mean algorithm and mapping the jobs to the appropriate resources based mainly on Genetic algorithm. …”
    Get full text
    Get full text
    Article
  16. 16

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

    Published 2011
    “…In this study 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
    Get full text
    Article
  17. 17

    Modified archive update mechanism of multi-objective particle swarm optimization in fuzzy classification and clustering by Rashed, Alwatben Batoul

    Published 2022
    “…Among multi-objective evolutionary algorithms proposed in the literature, particle swarm optimization (PSO)-based multi-objective (MOPSO) algorithm has been cited to be the most representative. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Determination of tree height based on tree crown using algorithm derived from UAV imagery / Suzanah Abdullah ... [et al.] by Abdullah, Suzanah, Tahar, Khairul Nizam, Abdul Rashid, Mohd Fadzil, Osoman, Muhammad Ariffin

    Published 2021
    “…In this study, UAV technology has been taking a look at several algorithms for estimating tree height value of a single tree crown. …”
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Cluster optimization in VANET using MFO algorithm and K-Means clustering by Ramlee, Sham Rizal, Hasan, Sazlinah, K. Subramaniam, Shamala

    Published 2023
    “…Proven to be an effective and efficient method for solving optimization problem. To design K-Means algorithm that portion nodes based on their proximities by optimize the distance between nodes within same cluster by assigning them to the closet cluster center. …”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

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

    Published 2019
    “…Adopting the medoid instead of the mean can enhance the efficiency. However, the complexity of the kmedoid based algorithms in general is more than the complexity of the k-means based algorithms. …”
    Get full text
    Get full text
    Thesis