Arşiv logosu
  • English
  • Türkçe
  • Giriş
    Yeni kullanıcı mısınız? Kayıt için tıklayın. Şifrenizi mi unuttunuz?
Arşiv logosu
  • Koleksiyonlar
  • DSpace İçeriği
  • Analiz
  • English
  • Türkçe
  • 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 "Hosseinalipour, Ali" seçeneğine göre listele

Listeleniyor 1 - 2 / 2
Sayfa Başına Sonuç
Sıralama seçenekleri
  • Küçük Resim Yok
    Öğe
    Generating the structural graph-based model from a program source-code using chaotic forrest optimization algorithm
    (Wiley, 2023) Arasteh, Bahman; Ghanbarzadeh, Reza; Gharehchopogh, Farhad Soleimanian; Hosseinalipour, Ali
    One of the most important and costly stages in software development is maintenance. Understanding the structure of software will make it easier to maintain it more efficiently. Clustering software modules is thought to be an effective reverse engineering technique for deriving structural models of software from source code. In software module clustering, the most essential objectives are to minimize connections between produced clusters, maximize internal connections within created clusters, and maximize clustering quality. Finding the appropriate software system clustering model is considered an NP-complete task. The previously proposed approaches' key limitations are their low success rate, low stability, and poor modularization quality. In this paper, for optimal clustering of software modules, Chaotic based heuristic method using a forest optimization algorithm is proposed. The impact of chaos theory on the performance of the other SFLA-GA and PSO-GA has also been investigated. The results show that using the logistic chaos approach improves the performance of these methods in the software-module clustering problem. The performance of chaotic based FOA, SFLA-GA and PSO-GA is superior to the other heuristic methods in terms of modularization quality and stability of the results.
  • Küçük Resim Yok
    Öğe
    A metaheuristic approach based on coronavirus herd immunity optimiser for breast cancer diagnosis
    (Springer, 2024) Hosseinalipour, Ali; Ghanbarzadeh, Reza; Arasteh, Bahman; Gharehchopogh, Farhad Soleimanian; Mirjalili, Seyedali
    As one of the important concepts in epidemiology, herd immunity was recommended to control the COVID-19 pandemic. Inspired by this technique, the Coronavirus Herd Immunity Optimiser has recently been introduced, demonstrating promising results in addressing optimisation problems. This particular algorithm has been utilised to address optimisation problems widely; However, there is room for enhancement in its performance by making modifications to its parameters. This paper aims to improve the Coronavirus Herd Immunity Optimisation algorithm to employ it in addressing breast cancer diagnosis problem through feature selection. For this purpose, the algorithm was discretised after the improvements were made. The Opposition-Based Learning approach was applied to balance the exploration and exploitation stages to enhance performance. The resulting algorithm was employed in the diagnosis of breast cancer, and its performance was evaluated on ten benchmark functions. According to the simulation results, it demonstrates superior performance in comparison with other well-known approaches of the similar nature. The results demonstrate that the new approach performs well in diagnosing breast cancer with high accuracy and less computational complexity and can address a variety of real-world optimisation problems.

| İstinye Üniversitesi | Kütüphane | Açık Bilim Politikası | Rehber | OAI-PMH |

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


İstinye Üniversitesi, İ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