Search Results - (( java implementation path algorithm ) OR ( pattern using tree algorithm ))

Refine Results
  1. 1

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    A numerical method for frequent pattern mining by Mustapha, Norwati, Nadimi-Shahraki, Mohammad-Hossein, Mamat, Ali, Sulaiman, Md. Nasir

    Published 2009
    “…The PC_Miner algorithm traverses the PC_Tree by using an efficient pruning technique. …”
    Get full text
    Get full text
    Article
  5. 5
  6. 6

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8

    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Dhany, Saputra

    Published 2008
    “…Future research includes exploring the use of separator Database in PrefixSpan with pseudoprojection to improve mining generalized sequential patterns, particularly in handling mining constrained sequential patterns.…”
    Get full text
    Thesis
  9. 9
  10. 10

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

    Published 2010
    “…Since rerunning the mining algorithms from scratch can be very time consuming, researchers have introduced interactive mining to find proper patterns by using the current mining model with various minsup. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Saputra , Dhany, Rambli, Dayang R.A., Foong, Oi Mean

    Published 2008
    “…Future research includes exploring the use of separator Database in PrefixSpan with pseudoprojection to improve mining generalized sequential patterns, particularly in handling mining constrained sequential patterns.…”
    Get full text
    Get full text
    Thesis
  12. 12

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

    Compact structure representation in discovering frequent patterns for association rules by Mustapha, N., Sulaiman, M.N., Othman, M., Selamat, M.H.

    Published 2002
    “…Flex-tree structure is a lexicographic tree which finds frequent patterns by using depth first search strategy. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Fast discovery of long patterns for association rules by Mustapha, N., Sulaiman, M.N., Othman, M., Selamat, M.H.

    Published 2003
    “…An algorithm called Flex for identifying frequent patterns especially efficient when the patterns are long is proposed by successive construction of the nodes lexicographic tree. …”
    Get full text
    Get full text
    Article
  15. 15

    Compact structure representation in discovering frequent patterns for association rules by Mustapha, Norwati, Sulaiman, Md. Nasir, Othman, Mohamed, Selamat, Mohd Hasan

    Published 2002
    “…Flex-tree structure is a lexicographic tree which finds frequent patterns by using depth first search strategy. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Disparity map algorithm using hierarchical of bitwise pixel differences and segment-tree from stereo image by Zainal Azali, Muhammad Nazmi

    Published 2024
    “…The adaptability of the algorithm is demonstrated through a 3D surface reconstruction using a final disparity map. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18

    Pattern generation through feature values modification and decision tree ensemble construction by Akhand, M. A. H, Rahman, M.M. Hafizur, Murase, K.

    Published 2013
    “…The method modifies feature values of some patterns with the values of other patterns to generate different patterns for different classifiers. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Frequent Lexicographic Algorithm for Mining Association Rules by Mustapha, Norwati

    Published 2005
    “…The algorithm involved the construction of the nodes of a lexicographic tree that represent frequent patterns. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Discovering Pattern in Medical Audiology Data with FP-Growth Algorithm by G. Noma, Nasir, Mohd Khanapi, Abd Ghani

    Published 2012
    “…In this paper we propose a five step knowledge discovery model to discover patterns in medical audiology records. We use frequent pattern growth (FP-Growth) algorithm in the data processing step to build the FP-tree data structure and mine it for frequents itemsets. …”
    Get full text
    Get full text
    Conference or Workshop Item