Search Results - (( basic permutation generation algorithm ) OR ( java application mining algorithm ))

Search alternatives:

  • Showing 1 - 11 results of 11
Refine Results
  1. 1
    Numerical assessment on makespan minimization by adopting NEH heuristics in permutation flow shop

    Numerical assessment on makespan minimization by adopting NEH heuristics in permutation flow shop by Ziao, C.Z., Kamaruddin, S.

    Published 2015
    “…Throughout the last 30 years, the NEH heuristic developed by Nawaz, Enscore and Ham has been commonly regarded as the best heuristic for minimizing the makespan in permutation flow shops. This heuristic is basically divided into two main stages: generate an initial sequence with decreasing total processing time and insert into the schedule accordingly. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  2. 2
    Direct approach for mining association rules from structured XML data

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

    Published 2012
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection

    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
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Study and Implementation of Data Mining in Urban Gardening

    Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

    Published 2019
    “…Attached sensors generate data and send these data to the Java Servlet application through a WIFI module. These data are processed and stored in appropriate formats in a MySQL server database. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Mining Sequential Patterns Using I-PrefixSpan

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

    Published 2007
    “…Sequential pattern mining is a relatively new data-mining problem with many areas of application. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  6. 6
    A web-based implementation of k-means algorithms

    A web-based implementation of k-means algorithms by Lee, Quan

    Published 2022
    “…This stinginess of proximity measures in data mining tools is stifling the performance of the algorithm. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  7. 7
    Mining Sequential Patterns using I-PrefixSpan

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

    Published 2008
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  8. 8
    A new 128-bit block cipher

    A new 128-bit block cipher by Mohd Ali, Fakariah Hani

    Published 2009
    “…It is an involution substitution and permutation encryption network (SPN). This block cipher uses only basic operations, key dependent S-box and XOR IS together so that it can be efficiently implemented on various platforms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Features selection for intrusion detection system using hybridize PSO-SVM

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…The simulation will be carried on WEKA tool, which allows us to call some data mining methods under JAVA environment. The proposed model will be tested and evaluated on both NSL-KDD and KDD-CUP 99 using several performance metrics.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling

    Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

    Published 2022
    “…This research first proposes an improved continuous MOPSO to address the rapid clustering problem that exists in the basic PSO algorithm using three improvement strategies: re-initialization of particles, systematic switch of best solutions and mutation on global best selection. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem

    Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem by Sh Ahmad, Sh Salleh

    Published 2009
    “…Third, bottleneck approach was utilised in the study and the analysis using Visual Basic macro programming indicated that this method produced good results. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: