Search Results - (( _ constructability tree algorithm ) OR ( java application optimisation algorithm ))

Refine Results
  1. 1

    Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

    Published 2019
    “…The system is essentially a three-part development, utilising Android, Java Servlets, and Arduino platforms to create an optimised and automated urban-gardening system. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    A Scalable Algorithm for Constructing Frequent Pattern Tree by Noraziah, Ahmad, Herawan, Tutut, Zailani, Abdullah, Mustafa, Mat Deris

    Published 2014
    “…The construction of FP-Tree is very important prior to frequent patterns mining. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Hyper-Heuristic Evolutionary Approach for Constructing Decision Tree Classifiers by Kumar, Sunil, Ratnoo, Saroj, Vashishtha, Jyoti

    Published 2021
    “…Finding optimal values for the hyper parameters of a decision tree construction algorithm is a challenging issue. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    A comparative analysis of Prim, Kruskal, and Reverse-Delete algorithms in optimizing routes within Terengganu’s and Pahang’s attraction road network / Munashahira Mohammad Zahid... by Mohammad Zahid, Munashahira

    Published 2024
    “…The goal is to determine the most effective algorithm for constructing the minimum spanning tree (MST) that minimizes total travel distance. …”
    Get full text
    Get full text
    Thesis
  5. 5

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

    Published 2011
    “…Empirical result demonstrates that the proposed algorithm can be used to join two spatial objects in constructing spatial decision trees on small spatial dataset. …”
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6
  7. 7
  8. 8

    Classification model for hotspot occurrences using spatial decision tree algorithm by Sitanggang, Imas Sukaesih, Yaakob, Razali, Mustapha, Norwati, Nuruddin, Ahmad Ainuddin

    Published 2013
    “…Empirical result demonstrates that the proposed algorithm can be used to join two spatial objects in constructing a spatial decision tree from a spatial dataset. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

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

    Constructing routing tree for centralized scheduling using multi-channel single transceiver system in 802.16 mesh mode by Al-Hemyari, Ali, Ng, Chee Kyun, Noordin, Nor Kamariah, Ismail, Alyani, Khatun, Sabira

    Published 2008
    “…This paper proposes a centralized scheduling algorithm that can reduce interferences by constructing routing tree with multi-channel single transceiver system in WiMAX mesh networks. …”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11
  12. 12

    The stopping rules for winsorized tree by Chee, Keong Ch’ng, Mahat, Nor Idayu

    Published 2017
    “…Winsorized tree is a modified tree-based classifier that is able to investigate and to handle all outliers in all nodes along the process of constructing the tree.It overcomes the tedious process of constructing a classical tree where the splitting of branches and pruning go concurrently so that the constructed tree would not grow bushy. …”
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13
  14. 14

    Constructing routing tree centralized scheduling using multi-channel system in 802.16 by Al-Hemyari, Ali, Ng, Chee Kyun, Noordin, Nor Kamariah, Ismail, Alyani, Khatun, Sabira

    Published 2008
    “…This paper proposes a centralized scheduling algorithm by constructing routing tree in WiMax mesh network, which introduces the cross-layer concept between the media access controller (MAC) and the network layers. …”
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

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

    A genetic algorithm approach to VLSI macro cell non-slicing floorplans using binary tree by Rahim At Samsuddin, H. A., Ab. Rahman, A. A. H., Andaljayalakshmi, G., Ahmad, R. B.

    Published 2008
    “…This paper proposes an optimization approach for macro-cell placement which minimizes the chip area size. A binary tree method for non-slicing tree construction process is utilized for the placement and area optimization of macro-cell layout in very large scaled integrated (VLSI) design. …”
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

    Speeding up index construction with GPU for DNA data sequences by Rahmaddiansyah, , Abdul Rashid, Nur’aini

    Published 2011
    “…The advancement of technology in scientific community has produced terabytes of biological data.This datum includes DNA sequences.String matching algorithm which is traditionally used to match DNA sequences now takes much longer time to execute because of the large size of DNA data and also the small number of alphabets.To overcome this problem, the indexing methods such as suffix arrays or suffix trees have been introduced.In this study we used suffix arrays as indexing algorithm because it is more applicable, not complex and used less space compared to suffix trees.The parallel method is then introduced to speed up the index construction process. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18
  19. 19
  20. 20