Filtreler

2022 - 20254
Filtreleri Sıfırla

Ayarlar

Yazar: Dehkharghani, Rahim × Bölüm: Işık University, Faculty of Engineering, Department of Computer Engineering ×

Arama Sonuçları

Listeleniyor 1 - 4 / 4
  • Küçük Resim
    Yayın
    BinBRO: Binary Battle Royale Optimizer algorithm
    (Elsevier Ltd, 2022-02-04) (Rahkar Farshi), Taymaz Akan; Agahian, Saeid; Dehkharghani, Rahim
    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 optimization algorithm, Battle Royale Optimization, which we named BinBRO, has been proposed. The proposed algorithm has been applied to two benchmark datasets: the uncapacitated facility location problem, and the maximum-cut graph problem, and has been compared with 6 other binary optimization algorithms, namely, Particle Swarm Optimization, different versions of Genetic Algorithm, and different versions of Artificial Bee Colony algorithm. The BinBRO-based algorithms could rank first among those algorithms when applying on all benchmark datasets of both problems, UFLP and Max-Cut.
  • Küçük Resim
    Yayın
    Battle Royale Optimizer for solving binary optimization problems
    (Elsevier B.V., 2022-05) Akan, Taymaz; Agahian, Saeid; Dehkharghani, Rahim
    Battle Royale Optimizer (BRO) is a recently proposed metaheuristic optimization algorithm used only in continuous problem spaces. The BinBRO is a binary version of BRO. The BinBRO algorithm employs a differential expression, which utilizes a dissimilarity measure between binary vectors instead of a vector subtraction operator, used in the original BRO algorithm to find the nearest neighbor. To evaluate BinBRO, we applied it to two popular benchmark datasets: the uncapacitated facility location problem (UFLP) and the maximum-cut (Max-Cut) graph problems from OR-Library. An open-source MATLAB implementation of BinBRO is available on CodeOcean and GitHub websites.
  • Küçük Resim
    Yayın
    ComStreamClust: a communicative multi-agent approach to text clustering in streaming data
    (Springer Science and Business Media Deutschland GmbH, 2023-12) Najafi, Ali; Gholipour-Shilabin, Araz; Dehkharghani, Rahim; Mohammadpur-Fard, Ali; Asgari-Chenaghlu, Meysam
    Topic detection is the task of determining and tracking hot topics in social media. Twitter is arguably the most popular platform for people to share their ideas with others about different issues. One such prevalent issue is the COVID-19 pandemic. Detecting and tracking topics on these kinds of issues would help governments and healthcare companies deal with this phenomenon. In this paper, we propose a novel, multi-agent, communicative clustering approach, so-called ComStreamClust for clustering sub-topics inside a broader topic, e.g., the COVID-19 and the FA CUP. The proposed approach is parallelizable, and can simultaneously handle several data-point. The LaBSE sentence embedding is used to measure the semantic similarity between two tweets. ComStreamClust has been evaluated by several metrics such as keyword precision, keyword recall, and topic recall. Based on topic recall on different number of keywords, ComStreamClust obtains superior results when compared to the existing methods.
  • Küçük Resim
    Yayın
    Sarcasm detection on news headlines using transformers
    (Springer, 2025-09-07) Gümüşçekiçci, Gizem; Dehkharghani, Rahim
    Sarcasm poses a linguistic challenge due to its figurative nature, where intended meaning contradicts literal interpretation. Sarcasm is prevalent in human communication, affecting interactions in literature, social media, news, e-commerce, etc. Identifying the true intent behind sarcasm is challenging but essential for applications in sentiment analysis. Detecting sarcasm in written text, as a challenging task, has attracted many researchers in recent years. This paper attempts to detect sarcasm in news headlines. Journalists prefer using sarcastic news headlines as they seem much more interesting to the readers. In the proposed methodology, we experimented with Transformers, namely the BERT model, and several Machine and Deep Learning models with different word and sentence embedding methods. The proposed approach inherently requires high-performance resources due to the use of large-scale pre-trained language models such as BERT. We also extended an existing news headlines dataset for sarcasm detection using augmentation techniques and annotating it with hand-crafted features. The proposed methodology could outperform almost all existing sarcasm detection approaches with a 98.86% F1-score when applied to the extended news headlines dataset, which we made publicly available on GitHub.