You are currently viewing a new version of our website. To view the old version click .

Algorithms, Volume 17, Issue 1

January 2024 - 49 articles

Cover Story: We present a general version of the polygonal fitting problem called Unconstrained Polygonal Fitting (UPF). Our goal is to represent a given 2D shape S with an N-vertex polygonal curve P with a known number of vertices, so that the Intersection over Union (IoU) metric between S and P is maximized without any assumption of the location of the N-vertices of P that can be placed anywhere in the 2D space. The resulting solutions of the UPF may approximate the given curve better than the solutions of the classical polygonal approximation problem, where the vertices are constrained to belong to the boundary of the given 2D shape. For a given number of vertices N, a Particle Swarm Optimization method is used to maximize the IoU metric, which yields almost optimal solutions. View the paper
  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list .
  • You may sign up for email alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.

Articles (49)

  • Article
  • Open Access
1 Citations
2,801 Views
36 Pages

Correntropy-Based Constructive One Hidden Layer Neural Network

  • Mojtaba Nayyeri,
  • Modjtaba Rouhani,
  • Hadi Sadoghi Yazdi,
  • Marko M. Mäkelä,
  • Alaleh Maskooki and
  • Yury Nikulin

22 January 2024

One of the main disadvantages of the traditional mean square error (MSE)-based constructive networks is their poor performance in the presence of non-Gaussian noises. In this paper, we propose a new incremental constructive network based on the corre...

  • Article
  • Open Access
6 Citations
5,969 Views
23 Pages

Activation-Based Pruning of Neural Networks

  • Tushar Ganguli and
  • Edwin K. P. Chong

21 January 2024

We present a novel technique for pruning called activation-based pruning to effectively prune fully connected feedforward neural networks for multi-object classification. Our technique is based on the number of times each neuron is activated during m...

  • Article
  • Open Access
3,787 Views
15 Pages

Framework Based on Simulation of Real-World Message Streams to Evaluate Classification Solutions

  • Wenny Hojas-Mazo,
  • Francisco Maciá-Pérez,
  • José Vicente Berná Martínez,
  • Mailyn Moreno-Espino,
  • Iren Lorenzo Fonseca and
  • Juan Pavón

21 January 2024

Analysing message streams in a dynamic environment is challenging. Various methods and metrics are used to evaluate message classification solutions, but often fail to realistically simulate the actual environment. As a result, the evaluation can pro...

  • Article
  • Open Access
3 Citations
2,707 Views
20 Pages

19 January 2024

In automated storage and retrieval systems (AS/RSs), the utilization of intelligent algorithms can reduce the makespan required to complete a series of input/output operations. This paper introduces a simulation optimization algorithm designed to min...

  • Article
  • Open Access
10 Citations
4,305 Views
19 Pages

19 January 2024

This study investigates the problem of decentralized dynamic resource allocation optimization for ad-hoc network communication with the support of reconfigurable intelligent surfaces (RIS), leveraging a reinforcement learning framework. In the presen...

  • Communication
  • Open Access
2,147 Views
11 Pages

19 January 2024

In the current research, we consider the solution of dispersion relations addressed to solid state physics by using artificial neural networks (ANNs). Most specifically, in a double semiconductor heterostructure, we theoretically investigate the disp...

  • Article
  • Open Access
6 Citations
3,326 Views
23 Pages

19 January 2024

Background: The development and application of machine learning (ML) methods have become so fast that almost nobody can follow their developments in every detail. It is no wonder that numerous errors and inconsistencies in their usage have also sprea...

  • Article
  • Open Access
2,020 Views
16 Pages

Dictionary Encoding Based on Tagged Sentential Decision Diagrams

  • Deyuan Zhong,
  • Liangda Fang and
  • Quanlong Guan

18 January 2024

Encoding a dictionary into another representation means that all the words can be stored in the dictionary in a more efficient way. In this way, we can complete common operations in dictionaries, such as (1) searching for a word in the dictionary, (2...

  • Article
  • Open Access
2 Citations
2,518 Views
21 Pages

BENK: The Beran Estimator with Neural Kernels for Estimating the Heterogeneous Treatment Effect

  • Stanislav Kirpichenko,
  • Lev Utkin,
  • Andrei Konstantinov and
  • Vladimir Muliukha

18 January 2024

A method for estimating the conditional average treatment effect under the condition of censored time-to-event data, called BENK (the Beran Estimator with Neural Kernels), is proposed. The main idea behind the method is to apply the Beran estimator f...

  • Article
  • Open Access
2,889 Views
27 Pages

Efficient Multi-Objective Simulation Metamodeling for Researchers

  • Ken Jom Ho,
  • Ender Özcan and
  • Peer-Olaf Siebers

18 January 2024

Solving multiple objective optimization problems can be computationally intensive even when experiments can be performed with the help of a simulation model. There are many methodologies that can achieve good tradeoffs between solution quality and re...

of 5

Get Alerted

Add your email address to receive forthcoming issues of this journal.

XFacebookLinkedIn
Algorithms - ISSN 1999-4893