Search Results - (( integer implementation case algorithm ) OR ( java implementation mining algorithm ))

Refine Results
  1. 1

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

    Published 2012
    “…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
    Get full text
    Get full text
    Thesis
  2. 2

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

    Published 2019
    “…Using the J48 tree algorithm implemented through WEKA API on a Java Servlet, data provided is processed to derive a health index of the plant, with the possible outcomes set to “Good,” “Okay”, or “Bad”. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Scalable approach for mining association rules from structured XML data by Abazeed, Ashraf Riad, Mamat, Ali, Sulaiman, Md. Nasir, Ibrahim, Hamidah

    Published 2009
    “…Many techniques have been proposed to tackle the problem of mining XML data we study the various techniques to mine XML data and yet We presented a java based implementation of FLEX algorithm for mining XML data.…”
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    Mining association rules from structured XML data by Abazeed, Ashraf Riad, Mamat, Ali, Sulaiman, Md. Nasir, Ibrahim, Hamidah

    Published 2009
    “…Many techniques have been proposed to tackle the problem of mining XML data. We study the various techniques to mine XML data and yet We presented a java based implementation of FLEX algorithm for mining XML data.…”
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

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

    Case Slicing Technique for Feature Selection by A. Shiba, Omar A.

    Published 2004
    “…Case Slicing Technique (CST) helps in identifying the subset of features used in computing the similarity measures needed by classification algorithms. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Development of symbolic algorithms for certain algebraic processes by Abd. Rahman, Ali, Aris, Nor'Aini

    Published 2007
    “…In the case of dense Legendre basis polynomials with a big GCD solution, the modular algorithm is significantly superior to the nonmodular algorithms in higher degree polynomials. …”
    Get full text
    Get full text
    Get full text
    Monograph
  8. 8

    Development of symbolic algorithms for certain algebraic processes by Abd. Rahman, Ali, Aris, Nor'aini

    Published 2007
    “…In the case of dense Legendre basis polynomials with a big GCD solution, the modular algorithm is significantly superior to the nonmodular algorithms in higher degree polynomials. …”
    Get full text
    Get full text
    Get full text
    Monograph
  9. 9

    Image clustering comparison of two color segmentation techniques by Subramaniam, Kavitha Pichaiyan

    Published 2010
    “…The clustering research is regarding the area of data mining and implementation of the clustering algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Reverse logistics network optimizing by genetic algorithm: a case study of automotive wiring harnesses by Sadrnia, Abdolhossein, Ismail, Napsiah, Mohd Ariffin, Mohd Khairol Anuar, Zulkifli, Norzima, Boyer, Omid

    Published 2014
    “…With regards to the complexity of the reverse logistics network, traditional method cannot be implemented for solving them. Thus, an evolutionary algorithm based genetic algorithm (GA) is applied as a solution methodology to solve mixed integer linear programming model and find the optimum solution. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

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

    Published 2016
    “…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems by Uvaraja, Vikneswary

    Published 2018
    “…Additionally, the MTS algorithm is also implemented in parallel computing to produce parallel MTS for generating comparable solutions in shorter computational times. …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15
  16. 16
  17. 17

    A study on the significance of backlash width values to the performance of the MIQP-based design of MPC by H., Zabiri, Y., Samyudia

    Published 2005
    “…Simulation results via an industrial Fluidized Catalytic Cracking Unit (FCCU) case study are presented to show the significance of precise estimation of the backlash width in ensuring successful implementation of the MIQP-based design of MPC.…”
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18
  19. 19

    Propositional satisfiability method in rough classification modeling for data mining by Abu Bakar, Azuraliza

    Published 2002
    “…Two models, Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) to represent the minimal reduct computation problem were proposed. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Energy-aware task scheduling for streaming applications on NoC-based MPSoCs by Abd Ishak, Suhaimi Abd Ishak, Wu, Hui, Tariq, Umair Ullah

    Published 2024
    “…Our approach is supported by a set of novel techniques, which include constructing an initial schedule based on a list scheduling where the priority of each task is its approximate successor-tree-consistent deadline such that the workload across all the processors is balanced, a retiming heuristic to transform intraperiod dependencies into inter-period dependencies for enhancing parallelism, assigning an optimal discrete frequency for each task and each message using a Non-Linear Programming (NLP)-based algorithm and an Integer-Linear Programming (ILP)-based algorithm, and an incremental approach to reduce the memory usage of the retimed schedule in case of memory size violations. …”
    Get full text
    Get full text
    Get full text
    Article