Skip to Content

Algorithms, Volume 14, Issue 12

2021 December - 30 articles

Cover Story: MILTree (Multiple-Instance Learning Tree) is a multiscale tree-based visualization to support multiple-instance learning (MIL) problems. The first level of the tree represents the bags, and the second level represents the instances belonging to each bag, allowing users to understand the MIL datasets in an intuitive way. Two new instance selection methods are introduced as well. View this 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 (30)

  • Article
  • Open Access
4 Citations
3,295 Views
21 Pages

20 December 2021

Considering the contradiction between limited node resources and high detection costs in mobile multimedia networks, an adaptive and lightweight abnormal node detection algorithm based on artificial immunity and game theory is proposed in order to ba...

(This article belongs to the Special Issue Network Science: Algorithms and Applications)
  • Article
  • Open Access
4 Citations
4,657 Views
29 Pages

Subspace Detours Meet Gromov–Wasserstein

  • Clément Bonet,
  • Titouan Vayer,
  • Nicolas Courty,
  • François Septier and
  • Lucas Drumetz

17 December 2021

In the context of optimal transport (OT) methods, the subspace detour approach was recently proposed by Muzellec and Cuturi. It consists of first finding an optimal plan between the measures projected on a wisely chosen subspace and then completing i...

(This article belongs to the Section Evolutionary Algorithms and Machine Learning)
  • Article
  • Open Access
3,059 Views
15 Pages

17 December 2021

In a previous paper by the author, a pathfinding problem for directed trees is studied under the following situation: each edge has a nonnegative integer length, but the length is unknown in advance and should be found by a procedure whose computatio...

  • Article
  • Open Access
1 Citations
3,185 Views
15 Pages

16 December 2021

When several Nash equilibria exist in the game, decision-makers need to refine their choices based on some refinement concepts. To this aim, the notion of a ϵ-proper equilibria set for polymatrix games is used to develop 0–1 mixed linear...

  • Review
  • Open Access
9 Citations
5,309 Views
33 Pages

Metaheuristics in the Humanitarian Supply Chain

  • Francisca Santana Robles,
  • Eva Selene Hernández-Gress,
  • Neil Hernández-Gress and
  • Rafael Granillo Macias

15 December 2021

Everyday there are more disasters that require Humanitarian Supply Chain (HSC) attention; generally these problems are difficult to solve in reasonable computational time and metaheuristics (MHs) are the indicated solution algorithms. To our knowledg...

(This article belongs to the Special Issue Metaheuristic Algorithms in Optimization and Applications 2021)
  • Article
  • Open Access
5 Citations
3,946 Views
13 Pages

14 December 2021

Due to its ability to significantly improve the wireless communication efficiency, the intelligent reflective surface (IRS) has aroused widespread research interest. However, it is a challenge to obtain perfect channel state information (CSI) for IRS...

(This article belongs to the Special Issue Algorithms for Communication Networks)
  • Article
  • Open Access
6 Citations
3,850 Views
14 Pages

A Domain Adaptive Person Re-Identification Based on Dual Attention Mechanism and Camstyle Transfer

  • Chengyan Zhong,
  • Guanqiu Qi,
  • Neal Mazur,
  • Sarbani Banerjee,
  • Devanshi Malaviya and
  • Gang Hu

13 December 2021

Due to the variation in the image capturing process, the difference between source and target sets causes a challenge in unsupervised domain adaptation (UDA) on person re-identification (re-ID). Given a labeled source training set and an unlabeled ta...

  • Article
  • Open Access
4 Citations
4,645 Views
24 Pages

13 December 2021

In this work, we give provable sieving algorithms for the Shortest Vector Problem (SVP) and the Closest Vector Problem (CVP) on lattices in ℓp norm (1≤p≤∞). The running time we obtain is better than existing provable sieving algorit...

(This article belongs to the Section Randomized, Online, and Approximation Algorithms)
  • Article
  • Open Access
3,099 Views
15 Pages

11 December 2021

We address the basic question in discrete Morse theory of combining discrete gradient fields that are partially defined on subsets of the given complex. This is a well-posed question when the discrete gradient field V is generated using a fixed algor...

(This article belongs to the Section Parallel and Distributed Algorithms)
  • Article
  • Open Access
14 Citations
4,068 Views
22 Pages

10 December 2021

This paper describes a unique meta-heuristic technique for hybridizing bio-inspired heuristic algorithms. The technique is based on altering the state of agents using a logistic probability function that is dependent on an agent’s fitness rank....

  • Article
  • Open Access
3,717 Views
11 Pages

Lempel-Ziv Parsing for Sequences of Blocks

  • Dmitry Kosolobov and
  • Daniel Valenzuela

10 December 2021

The Lempel-Ziv parsing (LZ77) is a widely popular construction lying at the heart of many compression algorithms. These algorithms usually treat the data as a sequence of bytes, i.e., blocks of fixed length 8. Another common option is to view the dat...

(This article belongs to the Section Analysis of Algorithms and Complexity Theory)
  • Editorial
  • Open Access
2 Citations
2,897 Views
3 Pages

9 December 2021

This is the second edition of a special issue of Algorithms that is of a rather different nature compared to other Special Issues in the journal, which are usually dedicated to a particular subject in the area of algorithms [...]

(This article belongs to the Special Issue 2021 Selected Papers from Algorithms Editorial Board Members)
  • Article
  • Open Access
3 Citations
5,396 Views
10 Pages

8 December 2021

A classic and fundamental result, known as the Lovász Local Lemma, is a gem in the probabilistic method of combinatorics. At a high level, its core message can be described by the claim that weakly dependent events behave similarly to independ...

(This article belongs to the Special Issue Surveys in Algorithm Analysis and Complexity Theory)
  • Article
  • Open Access
5,430 Views
17 Pages

8 December 2021

An essential criterion for the proper implementation of case-control studies is selecting appropriate case and control groups. In this article, a new simulated annealing-based control group selection method is proposed, which solves the problem of se...

(This article belongs to the Section Algorithms for Multidisciplinary Applications)
  • Article
  • Open Access
7 Citations
4,334 Views
19 Pages

6 December 2021

The underlying infrastructure paradigms behind the novel usage scenarios and services are becoming increasingly complex—from everyday life in smart cities to industrial environments. Both the number of devices involved and their heterogeneity m...

  • Article
  • Open Access
5 Citations
4,355 Views
23 Pages

2 December 2021

Time series data are widely found in finance, health, environmental, social, mobile and other fields. A large amount of time series data has been produced due to the general use of smartphones, various sensors, RFID and other internet devices. How a...

  • Article
  • Open Access
19 Citations
5,978 Views
14 Pages

A Sequential Graph Neural Network for Short Text Classification

  • Ke Zhao,
  • Lan Huang,
  • Rui Song,
  • Qiang Shen and
  • Hao Xu

1 December 2021

Short text classification is an important problem of natural language processing (NLP), and graph neural networks (GNNs) have been successfully used to solve different NLP problems. However, few studies employ GNN for short text classification, and m...

  • Article
  • Open Access
22 Citations
7,954 Views
16 Pages

The Buy-Online-Pick-Up-in-Store Retailing Model: Optimization Strategies for In-Store Picking and Packing

  • Nicola Ognibene Pietri,
  • Xiaochen Chou,
  • Dominic Loske,
  • Matthias Klumpp and
  • Roberto Montemanni

30 November 2021

Online shopping is growing fast due to the increasingly widespread use of digital services. During the COVID-19 pandemic, the desire for contactless shopping has further changed consumer behavior and accelerated the acceptance of online grocery purch...

(This article belongs to the Special Issue Mathematical Models and Their Applications III)
  • Article
  • Open Access
6 Citations
4,237 Views
20 Pages

Locally Scaled and Stochastic Volatility Metropolis– Hastings Algorithms

  • Wilson Tsakane Mongwe,
  • Rendani Mbuvha and
  • Tshilidzi Marwala

30 November 2021

Markov chain Monte Carlo (MCMC) techniques are usually used to infer model parameters when closed-form inference is not feasible, with one of the simplest MCMC methods being the random walk Metropolis–Hastings (MH) algorithm. The MH algorithm s...

  • Article
  • Open Access
28 Citations
4,339 Views
21 Pages

29 November 2021

The widespread availability of large amounts of genomic data on the SARS-CoV-2 virus, as a result of the COVID-19 pandemic, has created an opportunity for researchers to analyze the disease at a level of detail, unlike any virus before it. On the one...

  • Article
  • Open Access
3 Citations
4,019 Views
15 Pages

29 November 2021

Traditional time-series clustering methods usually perform poorly on high-dimensional data. However, image clustering using deep learning methods can complete image annotation and searches in large image databases well. Therefore, this study aimed to...

  • Article
  • Open Access
4 Citations
3,435 Views
15 Pages

28 November 2021

The aim of this article is to present a procedure for the factorization and exact solution of boundary value problems for a class of n-th order linear Fredholm integro-differential equations with multipoint and integral boundary conditions. We use th...

  • Article
  • Open Access
1 Citations
3,362 Views
20 Pages

28 November 2021

The atom graph of a graph is a graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all possible atom trees of this graph. We provide two efficient algorithms for comput...

(This article belongs to the Section Combinatorial Optimization, Graph, and Network Algorithms)
  • Article
  • Open Access
1 Citations
3,567 Views
28 Pages

A Visual Mining Approach to Improved Multiple- Instance Learning

  • Sonia Castelo,
  • Moacir Ponti and
  • Rosane Minghim

27 November 2021

Multiple-instance learning (MIL) is a paradigm of machine learning that aims to classify a set (bag) of objects (instances), assigning labels only to the bags. This problem is often addressed by selecting an instance to represent each bag, transformi...

  • Article
  • Open Access
12 Citations
4,154 Views
18 Pages

Compensating Data Shortages in Manufacturing with Monotonicity Knowledge

  • Martin von Kurnatowski,
  • Jochen Schmid,
  • Patrick Link,
  • Rebekka Zache,
  • Lukas Morand,
  • Torsten Kraft,
  • Ingo Schmidt,
  • Jan Schwientek and
  • Anke Stoll

27 November 2021

Systematic decision making in engineering requires appropriate models. In this article, we introduce a regression method for enhancing the predictive power of a model by exploiting expert knowledge in the form of shape constraints, or more specifical...

  • Article
  • Open Access
46 Citations
23,044 Views
16 Pages

A Blockchain-Based Audit Trail Mechanism: Design and Implementation

  • Cristina Regueiro,
  • Iñaki Seco,
  • Iván Gutiérrez-Agüero,
  • Borja Urquizu and
  • Jason Mansell

26 November 2021

Audit logs are a critical component in today’s enterprise business systems as they provide several benefits such as records transparency and integrity and security of sensitive information by creating a layer of evidential support. However, cur...

(This article belongs to the Special Issue Advances in Blockchain Architecture and Consensus)
  • Article
  • Open Access
15 Citations
5,912 Views
21 Pages

26 November 2021

Resampling is a well-known statistical algorithm that is commonly applied in the context of Particle Filters (PFs) in order to perform state estimation for non-linear non-Gaussian dynamic models. As the models become more complex and accurate, the ru...

(This article belongs to the Collection Parallel and Distributed Computing: Algorithms and Applications)
  • Article
  • Open Access
4 Citations
3,752 Views
13 Pages

Algorithmic Design of an FPGA-Based Calculator for Fast Evaluation of Tsunami Wave Danger

  • Mikhail Lavrentiev,
  • Konstantin Lysakov,
  • Andrey Marchuk,
  • Konstantin Oblaukhov and
  • Mikhail Shadrin

26 November 2021

Events of a seismic nature followed by catastrophic floods caused by tsunami waves (the incidence of which has increased in recent decades) have an important impact on the populations of littoral regions. On the coast of Japan and Kamchatka, it takes...

(This article belongs to the Section Algorithms for Multidisciplinary Applications)
  • Review
  • Open Access
11 Citations
4,289 Views
21 Pages

Overview of Algorithms for Using Particle Morphology in Pre-Detonation Nuclear Forensics

  • Tom Burr,
  • Ian Schwerdt,
  • Kari Sentz,
  • Luther McDonald and
  • Marianne Wilkerson

24 November 2021

A major goal in pre-detonation nuclear forensics is to infer the processing conditions and/or facility type that produced radiological material. This review paper focuses on analyses of particle size, shape, texture (“morphology”) signatu...

(This article belongs to the Special Issue 2021 Selected Papers from Algorithms Editorial Board Members)
  • Article
  • Open Access
23 Citations
5,134 Views
22 Pages

23 November 2021

In machine learning, ensembles of models based on Multi-Layer Perceptrons (MLPs) or decision trees are considered successful models. However, explaining their responses is a complex problem that requires the creation of new methods of interpretation....

(This article belongs to the Special Issue Ensemble Algorithms and/or Explainability)
XFacebookLinkedIn
Algorithms - ISSN 1999-4893