Search Results - (( based constructive mining algorithm ) OR ( java applications optimized algorithm ))

Refine Results
  1. 1

    A data mining approach to construct graduates employability model in Malaysia by Sapaat, Myzatul Akmam, Mustapha, Aida, Ahmad, Johanna, Chamili, Khadijah, Muhamad, Rahamirzam

    Published 2011
    “…The performance of Bayes algorithms are also compared against a number of tree-based algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Prime-based method for interactive mining of frequent patterns by Nadimi-Shahraki, Mohammad-Hossein

    Published 2010
    “…Then, the proposed method is developed based on the architecture such that the mining model is constructed once, and it can be frequently mined by various minsup. …”
    Get full text
    Get full text
    Thesis
  3. 3
  4. 4

    Efficient prime-based method for interactive mining of frequent patterns. by Mohammad Hossein, Nadimi Shahraki, Mustapha, Norwati, Sulaiman, Md. Nasir, Mamat, Ali

    Published 2011
    “…Our method isolates the mining model from the mining process such that once the mining model is constructed; it can be frequently used by mining process with various minimum support thresholds. …”
    Get full text
    Get full text
    Article
  5. 5
  6. 6

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    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 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
  8. 8

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

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  10. 10

    Frequent itemset mining using graph theory / Mohammad Arsyad Mohd Yakop by Mohd Yakop, Mohammad Arsyad

    Published 2017
    “…The Directed Acyclic Graph in High Dimensional Dataset Mining (DAGHDDM) is a graph-based mining algorithm that represents itemsets in complete graph before FIM takes place. …”
    Get full text
    Get full text
    Thesis
  11. 11

    An extended ID3 decision tree algorithm for spatial data by Sitanggang, Imas Sukaesih, Yaakob, Razali, Mustapha, Norwati, Nuruddin, Ahmad Ainuddin

    Published 2011
    “…The objective of this paper is to propose a new spatial decision tree algorithm based on the ID3 algorithm for discrete features represented in points, lines and polygons. …”
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12
  13. 13
  14. 14
  15. 15

    Finding objects with segmentation strategy based multi robot exploration in unknown environment by Arezoumand, Reza, Mashohor, Syamsiah, Marhaban, Mohammad Hamiruce

    Published 2013
    “…Two algorithms were investigated in this paper one is frontier based random search algorithm and the second is efficient algorithm based on segmentation strategy. …”
    Get full text
    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
    “…Our algorithm works based on prime factorization and is called Prime Factor Miner (PFM). …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17
  18. 18
  19. 19

    Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT by Abdullah, Amran

    Published 2006
    “…Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Mining Sequential Patterns Using I-PrefixSpan by Dhany , Saputra, Rambli Dayang, R.A., Foong, Oi Mean

    Published 2007
    “…Most of the previous works explore Apriori approach which is not efficient in mining plentiful and long patterns. In this paper, we propose an improvement of pattern growth-based PrefixSpan algorithm, called I-PrefixSpan. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item