Filtreler
Filtreler
Bulunan: 17 Adet 0.020 sn
İlgili Araştırmacılar [5]
BM Sürdürülebilir Kalkınma [1]
Tam Metin [2]
Veritabanları [2]
wosquality [3]
Konu Başlıkları [49]
Yayın Yılı [4]
Erişime Açık

Battle Royale Optimizer with a New Movement Strategy

Sara Akan | Taymaz Akan

Gamed-based is a new stochastic metaheuristics optimization category that is inspired by traditional or digital game genres. Unlike SI-based algorithms, individuals do not work together with the goal of defeating other individuals and winning the game. Battle royale optimizer (BRO) is a Gamed-based metaheuristic optimization algorithm that has been recently proposed for the task of continuous problems. This paper proposes a modified BRO (M-BRO) in order to improve balance between exploration and exploitation. For this matter, an additional movement operator has been used in the movement strate ...Daha fazlası

Erişime Açık

Text‑based automatic personality prediction: a bibliographic review

Taymaz Akan

Personality detection is an old topic in psychology and automatic personality prediction (or perception) (APP) is the automated (computationally) forecasting of the personality on diferent types of human generated/exchanged contents (such as text, speech, image, and video). The principal objective of this study is to ofer a shallow (overall) review of natural language processing approaches on APP since 2010. With the advent of deep learning and following it transfer-learning and pre-trained model in NLP, APP research area has been a hot topic, so in this review, methods are categorized into th ...Daha fazlası

Erişime Açık

Multi-circle Detection Using Multimodal Optimization

Taymaz Akan

Object and shape detection in digital image were one of the hot topic over the last two decades. Especially automatic multi circle detection has received more attention over last years. Hough transform (HT) is a well-known and most popular method for lines and circles detection. However, HT has huge computational complexity expense. This paper proposed a new successful heuristic method to reduce computation time and improve the speed of HT for circle detection. In this proposed method the edges information of the image is obtained by means of Robert edge detection. Then, multimodal particle sw ...Daha fazlası

Erişime Açık

A Brain MRI Segmentation Method Using Feature Weighting and a Combination of Efficient Visual Features

Taymaz Akan

Determining the area of brain tumors is an essential and fundamental step in automatic diagnosis and treatment systems. The authors present a method based on a combination of efficient visual features and fuzzy c-means clustering to detect brain tumors. For this purpose, first, the background area of the images is removed by the new thresholding method, then the useful and efficient features are extracted. The authors use this new feature space for clustering-based segmentation. The proposed clustering algorithm gives a different importance to the extracted features in the segmentation process ...Daha fazlası

Süresiz Ambargo

A multimodal butterfly optimization using fitness-distance balance

Taymaz Akan

Due to the multimodal nature of real-world optimization problems, in recent years, there has been a great interest in multi-modal optimization algorithms. Multimodal optimization problems involve identifying multiple local/global optima. Niching techniques have been widely used to tackle multi-modal optimization problems. Most of the existing niching methods either require predefined niching parameters or extra information about the problem space. This paper presents a novel multimodal algorithm based on Butterfly Optimization Algorithm, which is constructed using the Fitness-Distance Balance ...Daha fazlası

Süresiz Ambargo

A memetic animal migration optimizer for multimodal optimization

Taymaz Akan

Unimodal optimization algorithms can find only one global optimum solution, while multimodal ones have the ability to detect all/most existing local/global optima in the problem space. Many practical scientific and engineering optimization problems have multiple optima to be located. There are a considerable number of optimization approaches in the literature to address the unimodal problems. Although multimodal optimization methods have not been studied as much as the unimodal ones, they have attracted an enormous amount of attention recently. However, most of them suffer from a common nichin ...Daha fazlası

Süresiz Ambargo

A hybrid firefly and particle swarm optimization algorithm applied to multilevel image thresholding

Taymaz Akan

There are many techniques for conducting image analysis and pattern recognition. This papers explores a way to optimize one of these techniques-image segmentation-with the help of a novel hybrid optimization algorithm. Image segmentation is mostly used for a semantic segmentation of images, and thresholding is one the most common techniques for performing this segmentation. Otsu's and Kapur's thresholding methods are two well-known approaches, both of which maximize the between-class variance and the entropy measure, respectively, in a gray image histogram. Both techniques were developed for b ...Daha fazlası

Erişime Açık

Multi-modal Battle Royale optimizer

Taymaz Akan

Multimodal optimization poses a challenging problem in the field of optimization as it entails the discovery of multiple local and global optima, unlike unimodal optimization, which seeks a single global solution. In recent years, the significance of addressing multimodal optimization challenges has grown due to the real-world complexity of many problems. While numerous optimization methods are available for unimodal problems, multimodal optimization techniques have garnered increased attention. However, these approaches often grapple with a common issue: the determination of the niching param ...Daha fazlası

Süresiz Ambargo

MOBRO: multi-objective battle royale optimizer

Taymaz Akan

Battle Royale Optimizer (BRO) is a recently proposed optimization algorithm that has added a new category named game-based optimization algorithms to the existing categorization of optimization algorithms. Both continuous and binary versions of this algorithm have already been proposed. Generally, optimization problems can be divided into single-objective and multi-objective problems. Although BRO has successfully solved single-objective optimization problems, no multi-objective version has been proposed for it yet. This gap motivated us to design and implement the multi-objective version of B ...Daha fazlası

Süresiz Ambargo

Battle royale optimizer for training multi-layer perceptron

Taymaz Akan

Artificial neural network (ANN) is one of the most successful tools in machine learning. The success of ANN mostly depends on its architecture and learning procedure. Multi-layer perceptron (MLP) is a popular form of ANN. Moreover, backpropagation is a well-known gradient-based approach for training MLP. Gradient-based search approaches have a low convergence rate therefore, they may get stuck in local minima, which may lead to performance degradation. Training the MLP is accomplished based on minimizing the total network error, which can be considered as an optimization problem. Stochastic op ...Daha fazlası

Süresiz Ambargo

Battle royale optimizer for multilevel image thresholding

Taymaz Akan

Image segmentation, the process of partitioning an image into meaningful regions, is a fundamental step in image processing, crucial for applications like computer vision, medical imaging, and object recognition. Image segmentation is an essential step of image processing that directly affects its success. Among the methods used for image segmentation, histogram-based thresholding is prevalent. Two well-known approaches to histogram-based thresholding are Otsu’s and Kapur’s methods in gray images that maximize the between-class variance and the entropy measure, respectively. Both techniques we ...Daha fazlası

Süresiz Ambargo

BinBRO: Binary Battle Royale Optimizer algorithm

Taymaz Akan

Stochastic methods attempt to solve problems that cannot be solved by deterministic methods with reasonable time complexity. Optimization algorithms benefit from stochastic methods; however, they do not guarantee to obtain the optimal solution. Many optimization algorithms have been proposed for solving problems with continuous nature; nevertheless, they are unable to solve discrete or binary problems. Adaptation and use of continuous optimization algorithms for solving discrete problems have gained growing popularity in recent decades. In this paper, the binary version of a recently proposed ...Daha fazlası

6698 sayılı Kişisel Verilerin Korunması Kanunu kapsamında yükümlülüklerimiz ve çerez politikamız hakkında bilgi sahibi olmak için alttaki bağlantıyı kullanabilirsiniz.
Tamam

creativecommons
Bu site altında yer alan tüm kaynaklar Creative Commons Alıntı-GayriTicari-Türetilemez 4.0 Uluslararası Lisansı ile lisanslanmıştır.
Platforms