Search Results - (( java implementation mining algorithm ) OR ( program classification issues 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

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

    Twofold Integer Programming Model for Improving Rough Set Classification Accuracy in Data Mining. by Saeed, Walid

    Published 2005
    “…The accuracy for rules and classification resulted from the TIP method are compared with other methods such as Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) from Rough Set, Genetic Algorithm (GA), Johnson reducer, HoltelR method, Multiple Regression (MR), Neural Network (NN), Induction of Decision Tree Algorithm (ID3) and Base Learning Algorithm (C4.5); all other classifiers that are mostly used in the classification tasks. …”
    Get full text
    Get full text
    Thesis
  8. 8

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

    A new classifier based on combination of genetic programming and support vector machine in solving imbalanced classification problem by Mohd Pozi, Muhammad Syafiq

    Published 2016
    “…There are two methods in dealing with imbalanced classification problem, which are based on data or algorithmic level. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11
  12. 12

    Poverty Classification of Central Perak Population Using Machine Learning by P.Rajendran, Kumaran

    Published 2019
    “…In this study, back propagation algorithm and other machine learning algorithm will be used to build models via anaconda using python programming language that can classify each poor household appropriate their poverty status. …”
    Get full text
    Get full text
    Final Year Project
  13. 13

    Particle swarm optimization for neural network learning enhancement by Abdull Hamed, Haza Nuzly

    Published 2006
    “…Two programs have been developed; Particle Swarm Optimization Feedforward Neural Network (PSONN) and Genetic Algorithm Backpropagation Neural Network (GANN). …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

    Study Of Modified Training Algorithm For Optimized Convergence Speed Of Neural Network by Kang, Miew How

    Published 2016
    “…Back-propagation is the most common artificial neural training algorithm, however it is suffering with the slow convergence rate issue. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17
  18. 18

    Framework for pedestrian walking behaviour recognition to minimize road accident by Hashim Kareem, Zahraa

    Published 2021
    “…However, wireless communication has critical issues with network failure, and these issues significantly affect the communication system. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Framework for pedestrian walking behaviour recognition to minimize road accident by Hashim Kareem, Zahraa

    Published 2021
    “…However, wireless communication has critical issues with network failure, and these issues significantly affect the communication system. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    Towards a better feature subset selection approach by Shiba, Omar A. A.

    Published 2010
    “…The selection of the optimal features subset and the classification has become an important issue in the data mining field.We propose a feature selection scheme based on slicing technique which was originally proposed for programming languages.The proposed approach called Case Slicing Technique (CST).Slicing means that we are interested in automatically obtaining that portion 'features' of the case responsible for specific parts of the solution of the case at hand.We show that our goal should be to eliminate the number of features by removing irrelevant once.Choosing a subset of the features may increase accuracy and reduce complexity of the acquired knowledge.Our experimental results indicate that the performance of CST as a method of feature subset selection is better than the performance of the other approaches which are RELIEF with Base Learning Algorithm (C4.5), RELIEF with K-Nearest Neighbour (K-NN), RELIEF with Induction of Decision Tree Algorithm (ID3) and RELIEF with Naïve Bayes (NB), which are mostly used in the feature selection task.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item