Search Results - (( initial solution based algorithm ) OR ( java application mining algorithm ))

Refine Results
  1. 1
  2. 2
  3. 3

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

    Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2017
    “…To produce a population of initial solution require algorithm that can produce multiple feasible solutions and these solutions must be diverse. …”
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

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

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

    Clustering ensemble learning method based on incremental genetic algorithms by Ghaemi, Reza

    Published 2012
    “…Firstly, an architecture for the clustering ensemble based on incremental genetic-based algorithms is proposed consisting of two phases: (i) to produce cluster partitions as initial populations, (ii) to combine cluster partitions and to generate final clustering solution by incremental genetic based clustering ensemble learning algorithm. …”
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10
  11. 11

    Enhancing the Sorting Layers in the Initial Stage of High School Timetabling by Arbaoui, Billel, Wahid, Juliana, Abdul-Rahman, Syariza

    Published 2020
    “…KHE is an algorithm that generates initial solution of HSTP. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems by Yasear, Shaymah Akram

    Published 2020
    “…Harris’s hawk multi-objective optimizer (HHMO) algorithm is a MOSIbased algorithm that was developed based on the reference point approach. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

    Optimizing S-box generation based on the Adaptive Agent Heroes and Cowards Algorithm by Kamal Z., Zamli

    Published 2021
    “…This paper introduces a new variant of a metaheuristic algorithm based on Agent Heroes and Cowards Algorithm (AHC), called Adaptive Agent Heroes and Cowards Algorithm (AAHC). …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2016
    “…The construction of population of initial solution is a crucial task in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it can affect the convergence speed and also the quality of the final solution.This paper presents an exploration on combination of graph heuristics in construction approach in curriculum based course timetabling problem to produce a population of initial solutions.The graph heuristics were set as single and combination of two heuristics.In addition, several ways of assigning courses into room and timeslot are implemented.All settings of heuristics are then tested on the same curriculum based course timetabling problem instances and are compared with each other in terms of number of population produced.The result shows that combination of largest degree followed by saturation degree heuristic produce the highest number of population of initial solutions.The results from this study can be used in the improvement phase of algorithm that uses population of initial solutions…”
    Get full text
    Get full text
    Get full text
    Article
  15. 15
  16. 16

    Vehicle Routing Problem with Simultaneous Pickup and Delivery by Sze, San Nah, Sek, Siaw Ying Doreen, Sze, Jeeu Fong, Cheah, Wai Shiang, Chiew, Kang Leng

    Published 2020
    “…A simple heuristic is used to generate the initial solution in the first phase. Then, the feasible solution obtained in the first phase will become the initial input for the improvement phase, which applied the VNS algorithm. …”
    Get full text
    Get full text
    Article
  17. 17

    Study on numerical solution of a variable order fractional differential equation based on symmetric algorithm by Liu, Jingrui, Pan, Dongyang

    Published 2019
    “…As the class of fractional differential equations with changing order has attracted more attention and attention in the fields of research and engineering, it is important to study its numerical solutions. Numerical solution algorithm for a class of fractional differential equations with transformed arrays based on the proposed symmetry algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18
  19. 19

    Constructing population of initial solutions for curriculum – based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2012
    “…Future work will use the best settings of heuristics to the improvement phase in population-based improvement algorithm.…”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20