Search Results - (( feature solution mining algorithm ) OR ( java implementation path algorithm ))

Refine Results
  1. 1

    A partition based feature selection approach for mixed data clustering / Ashish Dutt by Ashish , Dutt

    Published 2020
    “…In this thesis, a novel weighted feature selection approach on nominal features is proposed, for a partition. clustering algorithm that can handle mixed data. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Tree-based contrast subspace mining method by Florence Sia Fui Sze

    Published 2020
    “…Genetic algorithm has been widely used to find global solution to optimization and search problem. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    A multi-layer dimension reduction algorithm for text mining of news in forex / Arman Khadjeh Nassirtoussi by Nassirtoussi, Arman Khadjeh

    Published 2015
    “…The major finding of this review is that context-specific text mining algorithms are lacking. The main underlying text-mining challenge that seems to deserve immediate attention is the sparse and high dimensional nature of the feature-space. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  7. 7

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

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Semi-supervised learning for feature selection and classification of data / Ganesh Krishnasamy by Ganesh , Krishnasamy

    Published 2019
    “…The proposed algorithm is compared with the state-of-the-art feature selection algorithms using three different datasets. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Ideal combination feature selection model for classification problem based on bio-inspired approach by Basir, Mohammad Aizat, Hussin, Mohamed Saifullah, Yusof, Yuhanis

    Published 2020
    “…The important step is to idealize the combined feature selection models by finding the best combination of search method and feature selection algorithms. …”
    Get full text
    Get full text
    Book Section
  10. 10

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

    Feature and Instances Selection for Nearest Neighbor Classification via Cooperative PSO by Sharifah Sakinah, Syed Ahmad

    Published 2014
    “…Data reduction is an essential task in the data preparation phase of knowledge discovery and data mining (KDD). The reduction method contains two techniques, namely features reduction and data reduction which are commonly applied to a classification problem. …”
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13

    A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

    Published 2022
    “…This algorithm focuses on generating promising solutions in different areas of the solution space using the problem search history. …”
    Get full text
    Get full text
    Article
  14. 14

    A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

    Published 2022
    “…This algorithm focuses on generating promising solutions in different areas of the solution space using the problem search history. …”
    Get full text
    Get full text
    Article
  15. 15
  16. 16

    An Efficient IDS Using Hybrid Magnetic Swarm Optimization in WANETs by Sadiq, Ali Safaa, Alkazemi, Basem, Mirjalili, Seyedali, Ahmed, Noraziah, Khan, Suleman, Ali, Ihsan, Pathan, Al-Sakib Khan, Ghafoor, Kayhan Zrar

    Published 2018
    “…Our developed algorithm works in extracting the most relevant features that can assist in accurately detecting the network attacks. …”
    Get full text
    Get full text
    Article
  17. 17

    An efficient IDS using hybrid Magnetic swarm optimization in WANETs by Sadiq, Ali Safa, Alkazemi, Basem Y., Mirjalili, Seyedali, Noraziah, Ahmad, Khan, Suleman, Ihsan, Ali, Pathan, Al-Sakib Khan, Ghafoor, Kayhan Zrar

    Published 2018
    “…Our developed algorithm works in extracting the most relevant features that can assist in accurately detecting the network attacks. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  18. 18
  19. 19

    Approaches to Multi-Objective Feature Selection: A Systematic Literature Review by Al-Tashi, Q., Abdulkadir, S.J., Rais, H.M., Mirjalili, S., Alhussian, H.

    Published 2020
    “…Feature selection has gained much consideration from scholars working in the domain of machine learning and data mining in recent years. …”
    Get full text
    Get full text
    Article
  20. 20

    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