Search Results - (( java execution tree algorithm ) OR ( program implementation clustering algorithm ))

  • Showing 1 - 17 results of 17
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
  6. 6
  7. 7

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

    Implementation of Hybrid Indexing, Clustering and Classification Methods to Enhance Rural Development Programme in South Sulawesi by Muhammad, Faisal

    Published 2024
    “…Village development and assistance program is a strategy implemented to accelerate socio cultural development to increase the capacity of village governance and more organized administration. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Parallel Implementation of Two Level Barotropic Models Applied to the Weather Prediction Problem by Bahri, Susila

    Published 2004
    “…Then the parallel algorithms are constructed and run using the Beowulf Cluster machine. …”
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12

    Mathematical simulation for 3-dimensional temperature visualization on open source-based grid computing platform by Alias, Norma, Satam, Noriza, Abd. Ghaffar, Zarith Safiza, Darwis, Roziha, Hamzah, Norhafiza, Islam, Md. Rajibul

    Published 2009
    “…The development of this architecture is based on several programming language as it involves algorithm implementation on C, parallelization using Parallel Virtual Machine (PVM) and Java for web services development. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13

    Feature clustering for pso-based feature construction on high-dimensional data by Swesi, Idheba Mohamad Ali Omer, Abu Bakar, Azuraliza

    Published 2019
    “…The Redundancy-Based Feature Clustering (RFC) algorithm was applied to choose the most informative features from the original data, while PSO was used to construct new features from those selected by RFC. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    An evaluation of Monte Carlo-based hyper-heuristic for interaction testing of industrial embedded software applications. by S. Ahmed, Bestoun, Enoiu, Eduard, Afzal, Wasif, Kamal Z., Zamli

    Published 2020
    “…Hyper-heuristic is a new methodology for the adaptive hybridization of meta-heuristic algorithms to derive a general algorithm for solving optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…In order to develop a new algorithm for the course scheduling problem, this research follows the experimental research methodology that consist of problem analysis, designing algorithm, implementing algorithm as a computer program in order to examine the results, analyzing the results, and if necessary improving the algorithm by doing all those activities over and over again. …”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    A Framework for Green Energy Resources Identification and Integration Supported by Real-Time Monitoring, Control, and Automation Applications by Far Chen, Jong

    Published 2025
    “…Following site identification, an improved Geographical Information System-driven fuzzy Traveling Salesman Problem-Binary Integer Programming algorithm was proposed to integrate these sites into a reliable ring-based system topology, aiming to achieve a zero-carbon footprint. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Adaptive persistence layer for synchronous replication (PLSR) in heterogeneous system by Beg, Abul Hashem

    Published 2011
    “…The PLSR architecture model, workflow and algorithms are described. The PLSR has been developed using Java Programming language. …”
    Get full text
    Get full text
    Thesis