Search Results - (( data construction tree algorithm ) OR ( java implication based algorithm ))

Refine Results
  1. 1

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

    Published 2014
    “…Thus, twice database scanning is a key and major limitation in completing the construction of FP-Tree. Therefore, this paper suggests scalable Trie Transformation Technique Algorithm (T3A) to convert our predefined tree data structure, Disorder Support Trie Itemset (DOSTrieIT) into FP-Tree. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

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

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

    Published 2013
    “…We improved the ID3 decision tree algorithm such that it can be utilized on spatial data in order to develop a classification model for hotspots occurrence. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

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

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

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

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

    Published 2019
    “…In this paper, we propose an efficient steganography algorithm which applies edge detection and MPC algorithm for data concealment in digital images. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

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

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

    Published 2010
    “…In the mining model construction, the content of relevant data is captured by a novel tree structure called PC-tree with one database scan and mining materials are consequently formed. …”
    Get full text
    Get full text
    Thesis
  14. 14

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

    Published 2011
    “…However, for a large database, constructing a large tree in the memory is a time consuming task and increase the time of execution. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Data Analysis and Rating Prediction on Google Play Store Using Data-Mining Techniques by Kayalvily, Tabianan, Denis, Arputharaj, Mohd Norshahriel, Abd Rani, Sarasvathi, Nahalingham

    Published 2022
    “…This study aims to predict the ratings of Google Play Store apps using decision trees for classification in machine learning algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    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 proposed model consists of Dynamic-Coalition framework, Static-Coalition algorithm, and Coalition-Based Index-Tree framework. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Classification of stock market index based on predictive fuzzy decision tree by Khokhar, Arashid Hafeez

    Published 2005
    “…In this research, another modification of Fuzzy Decision Tree (FDT) classification techniques called predictive FDT is presented that aims to combine symbolic decision trees in data classification with approximate reasoning offered by fuzzy representation. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Three dimension reconstruction of coronary artery tree using single-view cineangiogram by Khaleel, Hasan Hadi, O. K. Rahmat, Rahmita Wirza, Dimon, Mohd Zamrin, Mahmod, Ramlan, Mustapha, Norwati

    Published 2010
    “…Results: Experimental evaluation has been done to clinical raw data sets where the experimental results revealed that the proposed algorithm has a robust 3D output. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Enhance efficiency of answering XML keyword query using incompact structure of MCCTree by Sazaly, Ummu Sulaim

    Published 2012
    “…If the result cannot be used directly by the ranking method, the algorithm has an ineffective process. Moreover, if the ineffective process requires re-examining the original tree, the efficiency of the process of the algorithm will be reduced. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Improved tree routing protocol in zigbee networks by Al-Harbawi, Mostafa Kamil Abdulhusain

    Published 2010
    “…ImpTR protocol uses an approach to select next hope depending on new algorithm and uses the same tree topology construction for distributing address to all sensor nodes in the network. …”
    Get full text
    Get full text
    Thesis