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

Search alternatives:

Refine Results
  1. 1
    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:
  2. 2
    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:
  3. 3
    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:
  4. 4
    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:
  5. 5
    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:
  6. 6
    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:
  7. 7
    Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study

    Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

    Published 2018
    “…This paper investigated the efficiency of six heuristic algorithms from prior studies in the attempt to solve issues related to waste collection, namely: (i) Nearest Greedy (NG), (ii) Further from Depot (FFD), (iii) Different Initial Customer (DIC), (iv) Savings Approach, (v) Sweep Algorithm, and (vi) Different Initial Customer based on Sweep Algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study

    Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

    Published 2018
    “…This paper investigated the efficiency of six heuristic algorithms from prior studies in the attempt to solve issues related to waste collection, namely: (i) Nearest Greedy (NG), (ii) Further from Depot (FFD), (iii) Different Initial Customer (DIC), (iv) Savings Approach, (v) Sweep Algorithm, and (vi) Different Initial Customer based on Sweep Algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Simulated annealing algorithm for solving chambering student-case assignment problem

    Simulated annealing algorithm for solving chambering student-case assignment problem by Ghazali, Saadiah, Abdul Rahman, Syariza

    Published 2015
    “…The objective of the study is to minimize the total completion time for all students in solving the given cases.This study employed a minimum cost greedy heuristic in order to construct a feasible initial solution.The search then is preceded with a simulated annealing algorithm for further improvement of solution quality.The analysis of the obtained result has shown that the proposed simulated annealing algorithm has greatly improved the solution constructed by the minimum cost greedy heuristic. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    Comparison between Newton’s Method and a new Scaling Newton Method / Ramizah Baharuddin

    Comparison between Newton’s Method and a new Scaling Newton Method / Ramizah Baharuddin by Baharuddin, Ramizah

    Published 2021
    “…This initial value is often called the “initial guess”. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Formulating and solving stochastic truck and trailer routing problems using meta-heuristic algorithms / Seyedmehdi Mirmohammadsadeghi

    Formulating and solving stochastic truck and trailer routing problems using meta-heuristic algorithms / Seyedmehdi Mirmohammadsadeghi by Seyedmehdi, Mirmohammadsadeghi

    Published 2015
    “…Moreover, fifty four benchmark instances have been modified for this case. The initial feasible solutions have been generated for this purpose. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Selecting quality initial random seed for metaheuristic pproaches: a case of timetabling problem

    Selecting quality initial random seed for metaheuristic pproaches: a case of timetabling problem by Md Sultan, Abu Bakar, Mahmod, Ramlan, Sulaiman, Md. Nasir, Abu Bakar, Mohd Rizam

    Published 2008
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Modified Sumudu Transform Analytical Approximate Methods For Solving Boundary Value Problems

    Modified Sumudu Transform Analytical Approximate Methods For Solving Boundary Value Problems by Al-Nemrat, Asem Mustafa Moh’ad

    Published 2019
    “…For the proposed methods, the trial function was employed as an initial approximation to provide more accurate approximate solutions for the considered problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Modified Sumudu Transform Analytical Approximate Methods For Solving Boundary Value Problems

    Modified Sumudu Transform Analytical Approximate Methods For Solving Boundary Value Problems by Al-Nemrat, Asem Mustafa Moh’ad

    Published 2019
    “…For the proposed methods, the trial function was employed as an initial approximation to provide more accurate approximate solutions for the considered problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    A Hybrid ant colony optimization algorithm for solving a highly constrained nurse rostering problem

    A Hybrid ant colony optimization algorithm for solving a highly constrained nurse rostering problem by Ramli, Razamin, Abd Rahman, Rosshairy, Rohim, Nurdalila

    Published 2019
    “…Specifically, three main phases were involved in developing the hybrid model, which are generating an initial roster, updating the roster through the ACO algorithm, and implementing the hill climbing to further search for a refined solution. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Simulated Kalman Filter algorithms for solving optimization problems

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…However, the HKA algorithm has its own flaws. Although it was introduced as a population-based stochastic optimization algorithm, HKA is not exactly a population-based algorithm because it initializes and updates only a single solution. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Direct solutions of N-th order initial value problems in decomposition series

    Direct solutions of N-th order initial value problems in decomposition series by Yahaya F., Hashim I., Ismail E.S., Zulkifle A.K.

    Published 2023
    “…In this paper, a class of linear and non-linear nth-order initial value problems (IVPs) is considered. The solutions of these IVPs are obtained by adapting the modified Adomian decomposition method (MADM) as an algorithm for approximating the solutions of the equations in a sequence of time intervals (i.e. time steps). …”
    Article
    Save to List
    Saved in:
  18. 18
    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:
  19. 19
    Power system network splitting and load frequency control optimization using ABC based algorithms / Kanendra Naidu a/l Vijyakumar

    Power system network splitting and load frequency control optimization using ABC based algorithms / Kanendra Naidu a/l Vijyakumar by Vijyakumar, Kanendra Naidu

    Published 2015
    “…The graph theory is used to represent the power system based on interconnection between the buses through the adjacency matrix. The edge reduction algorithm is initially applied to reduce the search space to obtain the initial solution. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    A Preliminary Study On Firefly Algorithm Approach For Travelling Salesman Problem

    A Preliminary Study On Firefly Algorithm Approach For Travelling Salesman Problem by Ismail, Mohd Muzafar, Che Hasan, Mohd Hanif, Mohamad @ Ab Rahman, Syahrul Hisham, Jaafar, Hazriq Izzuan

    Published 2013
    “…Each firefly in Firefly Algorithm represents a candidate solution of the Travelling Salesman Problem. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: