Search Results - (( java implementation 5s algorithm ) OR ( program selection mining algorithm ))

Refine Results
  1. 1

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

    Published 2004
    “…CST was compared to other selected classification methods based on feature subset selection such as Induction of Decision Tree Algorithm (ID3), Base Learning Algorithm K-Nearest Nighbour Algorithm (k-NN) and NaYve Bay~sA lgorithm (NB). …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

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

    Published 2005
    “…The first task is to introduce a new rough model for minimum reduct selection and default rules generation, which is known as a Twofold Integer Programming (TIP). …”
    Get full text
    Get full text
    Thesis
  4. 4

    Genetic Algorithm for Web Data Mining by Loo, Kevin Teow Aik

    Published 2001
    “…By doing so, it could assist the process of data mining for information in the World Wide Web. This study used a prototype program based on genetic algorithm to manipulate the initial set of data. …”
    Get full text
    Get full text
    Project Paper Report
  5. 5

    IP algorithms in compact rough classification modeling by Bakar, Azuraliza Abu, Sulaiman, Md Nasir, Othman, Mohamed, Selamat, Mohd Hasan

    Published 2001
    “…The paper presents the Integer Programming (IP) algorithms in mining a compact rough classification model. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6
  7. 7
  8. 8

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

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

    Published 2016
    “…First proposed algorithm is the combination of momentum algorithm with adaptive learning rate (ALR) algorithm, and second proposed algorithm is the combination of momentum algorithm with automatic learning rate selection (ALRS) algorithm. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Exploring frogeye leaf spot disease severity in soybean through hyperspectral data analysis and machine learning with Orange Data Mining by Ang, Yuhao, Mohd Shafri, Helmi Zulhaidi, Al-Habshi, Mohammed Mustafa

    Published 2025
    “…No previous study has investigated Orange mining tool as visual programming approach in analysing hyperspectral reflectance data, especially in crop disease detection. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13
  14. 14
  15. 15
  16. 16

    Long-term electrical energy consumption: Formulating and forecasting via optimized gene expression programming / Seyed Hamidreza Aghay Kaboli by Seyed Hamidreza , Aghay Kaboli

    Published 2018
    “…In the developed feature selection approach, multi-objective binary-valued backtracking search algorithm (MOBBSA) is used as an efficient evolutionary search algorithm to search within different combinations of input variables and selects the non-dominated feature subsets, which minimize simultaneously both the estimation error and the number of features. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18

    An efficient and effective case classification method based on slicing by Shiba, Omar A. A., Sulaiman, Md. Nasir, Mamat, Ali, Ahmad, Fatimah

    Published 2006
    “…This paper introduces a new classification method based on slicing techniques that was proposed for procedural programming languages. The paper also discusses two of common classification algorithms that are used either in data mining or in general AI. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…In creating this application, NetBeans IDE 6.5and Java Micro Edition (Java ME) are used. This application can be installing into the mobile phone.…”
    Get full text
    Get full text
    Thesis
  20. 20

    Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde by Ogunfolajin Maruff , Tunde

    Published 2022
    “…The support vector machines (SVM) algorithm obtained the overall best results of 94.5% accuracy, 91.8% precision, 91.7% recall, and 91.1% f-Measure while the naïve bayes (NB) algorithm obtained the best AUC score of 0.944 with the tweet data of Dato Seri Anwar. …”
    Get full text
    Get full text
    Get full text
    Thesis