Search Results - (( using case problem algorithm ) OR ( java application mining algorithm ))

Search alternatives:

Refine Results
  1. 1
    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
    “…A comprehensive performance study has been reported that PrefixSpan, one of the sequential pattern mining algorithms, outperforms GSP, SPADE, as well as FreeSpan in most cases, and PrefixSpan integrated with pseudoprojection technique is the fastest among those tested algorithms. …”
    Get full text
    Get full text
    Thesis
    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
    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
    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…The algorithms are used to generate test cases for nine different Boolean expressions of different size and complexities. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    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 challenge of solving the problem raise whenever the complexity related to preferences, the existence of real-world constraints and problem size increased.This study focuses on solving a chambering student-case assignment problem by using a simulated annealing algorithm where this problem is classified under project assignment problem.The project assignment problem is considered as hard combinatorial optimization problem and solving it using a metaheuristic approach is an advantage because it could return a good solution in a reasonable time. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    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
    An interactive analytics approach for sustainable and resilient case studies: a machine learning perspective

    An interactive analytics approach for sustainable and resilient case studies: a machine learning perspective by Mousavi, Seyed Mohsen, Sadeghi R., Kiarash, Lee, Lai Soon

    Published 2023
    “…To show the methods applicability, this paper uses the proposed algorithm in three sustainable and resilient case studies. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    A combinatorial optimization technique using genetic algorithm :a case study in machine layout problem

    A combinatorial optimization technique using genetic algorithm :a case study in machine layout problem by Lau, Yung Siew.

    Published 2007
    “…Genetic Algorithms (GAs) are a powerful stochastic search in solving optimization problems. …”
    Get full text
    Get full text
    Get full text
    Final Year Project Report / IMRAD
    Save to List
    Saved in:
  12. 12
    Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms

    Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms by Alomoush, Alaa A., Alsewari, Abdulrahman A., Alamri, Hammoudeh S., Kamal Z., Zamli

    Published 2018
    “…The new hybrid algorithm has been applied on different cases of Knapsack problem with different dimensions. 20 case studies have been evaluated by the new hybrid algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Optimisation of energy efficient Assembly Sequence Planning using Moth-Flame Optimisation alghorithm

    Optimisation of energy efficient Assembly Sequence Planning using Moth-Flame Optimisation alghorithm by Muhammad Arif, Abdullah

    Published 2019
    “…All of the results were then analysed by using the Analysis of Variance (ANOVA) method. The P-value was found to be lower than the significant level α (P ≤ 0.10) in all test and case study problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Maintaining diversity for genetic algorithm : a case of timetabling problem.

    Maintaining diversity for genetic algorithm : a case of timetabling problem. by Md Sultan, Abu Bakar, Mahmod, Ramlan, Sulaiman, Md. Nasir, Abu Bakar, Mohd Rizam

    Published 2006
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem

    Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem by Hasan, Mohammad Khatim

    Published 2008
    “…Complexity reduction approach concept is used to develop these algorithms. This approach split the solution domain into 1 3 and 2 3 compartments in 1D case and 1 9 and 8 9 compartments in 2D cases. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    A prototype for driving school instructor timetabling using case-based heuristics selection algorithm / CT Munnirah Niesha Mohd Shafee

    A prototype for driving school instructor timetabling using case-based heuristics selection algorithm / CT Munnirah Niesha Mohd Shafee by Mohd Shafee, CT Munnirah Niesha

    Published 2010
    “…The specification with both hard constraints which must be satisfied and soft constraint which should satisfied. This problem can be solved using Case-Based Heuristics Selection approaches. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Hybrid Artificial Bees Colony Algorithms For Optimizing Carbon Nanotubes Characteristics

    Hybrid Artificial Bees Colony Algorithms For Optimizing Carbon Nanotubes Characteristics by Mohammad Jarrah, Mu'ath Ibrahim

    Published 2018
    “…Optimization is a crucial process to select the best parameters in single and multi-objective problems for manufacturing process.However,it is difficult to find an optimization algorithm that obtain the global optimum for every optimization problem.Artificial Bees Colony (ABC) is a well-known swarm intelligence algorithm in solving optimization problems.It has noticeably shown better performance compared to the state-of-art algorithms.This study proposes a novel hybrid ABC algorithm with β-Hill Climbing (βHC) technique (ABC-βHC) in order to enhance the exploitation and exploration process of the ABC in optimizing carbon nanotubes (CNTs) characteristics.CNTs are widely used in electronic and mechanical products due to its fascinating material with extraordinary mechanical,thermal,physical and electrical properties. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Disparity between theory & practice beyond the worst-case competitive analysis

    Disparity between theory & practice beyond the worst-case competitive analysis by Iqbal, Javeria, Ahmad, Iftikhar, Shah, Asadullah

    Published 2019
    “…For instance, in case of forex, the online algorithm is presented daily exchange rates. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  19. 19
    Thalassaemia detection using CBR Algorithm via mobile device

    Thalassaemia detection using CBR Algorithm via mobile device by Nur Faezah, Omar

    Published 2011
    “…CBR Algorithm is an algorithm that can solve a new problem by remembering a previous similar situation and by reusing information and knowledge of that situation in a new situation.CBR is suit for solving the problem in Thalassaemia cases.The model is designed and prototype is developed to test the diagnosis accuracy of the model.T his application is focus on Beta Thalassaemia and Haemoglobin E Trait only.For platform, this application will be using the mobile device such as PDA. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  20. 20
    A trade-off criterion for bi-objective problem in solving hybrid flow shop scheduling with energy efficient (EE-HFS) using multi-objective dragonfly algorithm (MODA)

    A trade-off criterion for bi-objective problem in solving hybrid flow shop scheduling with energy efficient (EE-HFS) using multi-objective dragonfly algorithm (MODA) by Muhammad Ammar, Nik Mu’tasim, Mohd Fadzil Faisae, Ab Rashid

    Published 2024
    “…The (EE-HFS) optimization has been carried out using the Multi-Objective Dragonfly Algorithm (MODA). …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: