Search Results - (( java execution tree algorithm ) OR ( program segmentation mining algorithm ))

  • Showing 1 - 6 results of 6
Refine Results
  1. 1

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

    Published 2008
    “…Moreover,improper management of intermediate databases may adversely affect the execution time and memory utilization. In the present work, Separator Database is proposed to improve PrefixSpan with pseudoprojection through early removal of uneconomical in-memory sequenced database, whilst SPM-Tree framework is proposed to build the intermediated databases. …”
    Get full text
    Thesis
  2. 2

    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
    “…Moreover,improper management of intermediate databases may adversely affect the execution time and memory utilization. In the present work, Separator Database is proposed to improve PrefixSpan with pseudoprojection through early removal of uneconomical in-memory sequenced database, whilst SPM-Tree framework is proposed to build the intermediated databases. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Mining Sequential Patterns using I-PrefixSpan by Saputra , Dhany, Dayang R.A. Rambli, Foong, Oi Mean

    Published 2008
    “…In this paper, we propose an improvement of pattern growth-based PrefixSpan algorithm, called I-PrefixSpan. The general idea of I-PrefixSpan is to use sufficient data structure for Seq-Tree Framework and separator database to reduce the execution time and memory usage. …”
    Get full text
    Get full text
    Citation Index Journal
  4. 4
  5. 5

    Mining Sequential Patterns Using I-PrefixSpan by Dhany , Saputra, Rambli Dayang, R.A., Foong, Oi Mean

    Published 2007
    “…In this paper, we propose an improvement of pattern growth-based PrefixSpan algorithm, called I-PrefixSpan. The general idea of I-PrefixSpan is to use the efficient data structure for general tree-like framework and separator database to reduce the execution time and memory usage. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    Validation of deep convolutional neural network for age estimation in children using mandibular premolars on digital panoramic dental imaging / Norhasmira Mohammad by Mohammad, Norhasmira

    Published 2022
    “…The semi-automated dental staging system developed in this study is based on the Malay children’s population and uses a brain-inspired learning algorithm termed "deep learning". The methodology is comprised of four major steps: image preprocessing, which adheres to the inclusion criteria for panoramic dental radiographs, segmentation, and classification of mandibular premolars according to Demirjian's staging system using the Dynamic Programming-Active Contour (DP-AC) method and Deep Convolutional Neural Network (DCNN), respectively, and statistical analysis. …”
    Get full text
    Get full text
    Thesis