Arşiv logosu
  • Türkçe
  • English
  • Giriş
    Yeni kullanıcı mısınız? Kayıt için tıklayın. Şifrenizi mi unuttunuz?
Arşiv logosu
  • Koleksiyonlar
  • Sistem İçeriği
  • Analiz
  • Talep/Soru
  • Türkçe
  • English
  • Giriş
    Yeni kullanıcı mısınız? Kayıt için tıklayın. Şifrenizi mi unuttunuz?
  1. Ana Sayfa
  2. Yazara Göre Listele

Yazar "Hammouri, Abdelaziz I." seçeneğine göre listele

Listeleniyor 1 - 1 / 1
Sayfa Başına Sonuç
Sıralama seçenekleri
  • Yükleniyor...
    Küçük Resim
    Öğe
    Binary JAYA Algorithm with Adaptive Mutation for Feature Selection
    (SPRINGER HEIDELBERG, TIERGARTENSTRASSE 17, D-69121 HEIDELBERG, GERMANY, 2020) Awadallah, Mohammed A.; Al-Betar, Mohammed Azmi; Hammouri, Abdelaziz I.; Alomari, Osama Ahmad
    In this paper, a new metaheuristic algorithm called JAYA algorithm has been adapted for feature selection. Feature selection is a typical problem in machine learning and data mining domain concerned with determining the subset of high discriminative features from the irrelevant, noisy, redundant, and high-dimensional features. JAYA algorithm is initially proposed for continuous optimization. Due to the binary nature of the feature selection problem, the JAYA algorithm is adjusted using sinusoidal (i.e., S-shape) transfer function. Furthermore, the mutation operator controlled by adaptive mutation rate (Rm) parameter is also utilized to control the diversity during the search. The proposed binary JAYA algorithm with adaptive mutation is called BJAM algorithm. The performance of BJAM algorithm is tested using 22 real-world benchmark datasets, which vary in terms of the number of features and the number of instances. Four measures are used for performance analysis: classification accuracy, number of features, fitness values, and computational times. Initially, a comparison between binary JAYA (BJA) algorithm and the proposed BJAM algorithm is conducted to show the effect of the mutation operator in the convergence behavior. After that, the results produced by the BJAM algorithm are compared against those yielded by ten state-of-the-art methods. Surprisingly, the proposed BJAM algorithm is able to excel other comparative methods in 7 out of 22 datasets in terms of classification accuracy. This can lead to the conclusion that the proposed BJAM algorithm is an efficient algorithm for the problems belonging to the feature selection domain and is pregnant with fruitful results.

| İstanbul Gelişim Üniversitesi | Kütüphane | Açık Erişim Politikası | Rehber | OAI-PMH |

Bu site Creative Commons Alıntı-Gayri Ticari-Türetilemez 4.0 Uluslararası Lisansı ile korunmaktadır.


Cihangir Mahallesi, Şehit Jandarma Komando Er Hakan Öner Sokak, No:1, Avcılar, İstanbul, TÜRKİYE
İçerikte herhangi bir hata görürseniz lütfen bize bildirin

DSpace 7.6.1, Powered by İdeal DSpace

DSpace yazılımı telif hakkı © 2002-2025 LYRASIS

  • Çerez Ayarları
  • Gizlilik Politikası
  • Son Kullanıcı Sözleşmesi
  • Geri Bildirim