Search Results - (( based construction 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
  3. 3

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

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

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

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

    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
  11. 11
  12. 12

    A coalition model for efficient indexing in wireless sensor network with random mobility / Hazem Jihad Ali Badarneh by Hazem Jihad , Ali Badarneh

    Published 2021
    “…The second and third scenarios evaluate the performance of Coalition-Based Index-Tree by examining the effects of Dynamic-Coalition framework and Static-Coalition algorithm on Coalition-Based Index-Tree framework. …”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

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

    Amtree Protocol Enhancement by Multicast Tree Modification and Incorporation of Multiple Sources by Al‐Sharafi, Ali Mohammed Ali

    Published 2008
    “…It is separated into three phases: 1) construction of multicast tree. 2) Handoff process. 3) Optimization Process. …”
    Get full text
    Get full text
    Thesis
  15. 15

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

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

    Published 2010
    “…The PC-tree is a well-organized tree structure, which is systematically built based on descendant making introduced in this study. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Parsing algorithms for grammars with regulated rewriting by Turaev, Sherzod, Othman, Mohamed, Selamat, Mohd Hasan, Krassovitskiy, Alexander

    Published 2011
    “…In this paper, we show that the parsing problem for regulated grammars can be solved by means of Petri net derivation trees constructed using the net unfolding. Moreover, we present a parsing algorithm for the deterministic restriction of Petri net controlled grammars based on the well-known Earley parsing algorithm.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  18. 18

    A novel steganography algorithm using edge detection and MPC algorithm by Aref Rezaei, Leili Farzinvash, Ali Farzamnia

    Published 2019
    “…Next, a full tree is constructed per group using the LSBs of its pixels. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    A proactive energy awareness traffic routing for wireless sensor networks against energy sink-holes by Mustafa, Mayada Salih Abdalla

    Published 2019
    “…In this thesis, cooperative communication based on tree topology construction is proposed to address energy and routing decision challenges in WSNs with single and multiple sinks. …”
    Get full text
    Get full text
    Thesis
  20. 20

    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