Search Results - (( java implementation path algorithm ) OR ( pattern navigation mining algorithm ))

  • Showing 1 - 13 results of 13
Refine Results
  1. 1
  2. 2

    A Web-Based Recommendation System To Predict User Movements Through Web Usage Mining by Jalali, Mehrdad

    Published 2009
    “…The approach in the offline phase is based on the new graph partitioning algorithm to model user navigation patterns for the navigation patterns mining. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Expectation maximization clustering algorithm for user modeling in web usage mining system by Mustapha, Norwati, Jalali, Manijeh, Jalali, Mehrdad

    Published 2009
    “…The results also indicate that kind of behavior given by EM clustering algorithm has improved the visit-coherence (accuracy) of navigation pattern mining.…”
    Get full text
    Get full text
    Article
  4. 4

    A recommender system approach for classifying user navigation patterns using longest common subsequence algorithm. by Jalali, Mehrdad, Mustapha, Norwati, Sulaiman, Md. Nasir, Mamat, Ali

    Published 2009
    “…In this paper, to provide online predicting effectively, we develop a model for online predicting through web usage mining system and propose a novel approach for classifying user navigation patterns to predict users’ future intentions. …”
    Get full text
    Get full text
    Article
  5. 5

    A new classification model for online predicting users' future movements by Jalali, Mehrdad, Mustapha, Norwati, Mamat, Ali, Sulaiman, Md. Nasir

    Published 2008
    “…The WUM can model user behavior and, therefore, to forecast their future movements by mining user navigation patterns. To provide online prediction efficiently, we advance architecture for online predicting in web usage mining system by proposing novel model based on Longest Common Subsequence algorithm for classifying user navigation patterns. …”
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    WebPUM : a web-based recommendation system to predict user future movements. by Jalali, Mehrdad, Mustapha, Norwati, Sulaiman, Md. Nasir, Mamat, Ali

    Published 2010
    “…The approach is based on the new graph partitioning algorithm to model user navigation patterns for the navigation patterns mining phase. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    A web usage mining approach based on LCS algorithm in online predicting recommendation systems by Jalali, Mehrdad, Mustapha, Norwati, Sulaiman, Md. Nasir, Mamat, Ali

    Published 2008
    “…To provide online prediction efficiently, we advance an architecture for online predicting in Web Usage Mining system and propose a novel approach based on LCS algorithm for classifying user navigation patterns for predicting users' future requests. …”
    Get full text
    Get full text
    Article
  8. 8

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

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

    Sequential pattern mining using personalized minimum support threshold with minimum items by Alias, Suraya, Razali, Mohd Norhisham, Tan, Soo Fun, Sainin, Mohd Shamrie

    Published 2011
    “…One of the challenges of Sequential Pattern Mining is finding frequent sequential patterns in a huge click stream data (web logs) since the data has the issue of a very low support distribution.By applying a Frequent Pattern Discovery technique, a sequence is considered as frequent if it occurs more than the minimum support (min sup) threshold value.The conventional method of assuming one min sup value is valid for all levels of k-sequence, may have an impact on the overall results or pattern generation. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

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

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

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
    Get full text
    Get full text
    Thesis