Skip to Content

3,044 Results Found

  • Article
  • Open Access
2 Citations
2,740 Views
17 Pages

The artificial bee colony algorithm (ABC) is a promising metaheuristic algorithm for continuous optimization problems, but it performs poorly in solving discrete problems. To address this issue, this paper proposes a hybrid discrete artificial bee co...

  • Article
  • Open Access
1 Citations
1,047 Views
22 Pages

20 June 2025

Radio mean labeling of a connected graph G is an assignment of distinct positive integers to the vertices of G satisfying a mathematical constraint called radio mean condition. The maximum label assigned to any vertex of G is called the span of the r...

  • Article
  • Open Access
6 Citations
4,793 Views
26 Pages

Multiple geographical feature label placement (MGFLP) is an NP-hard problem that can negatively influence label position accuracy and the computational time of the algorithm. The complexity of such a problem is compounded as the number of features fo...

  • Article
  • Open Access
32 Citations
6,816 Views
25 Pages

18 September 2015

In this paper, we propose a fast labeling algorithm based on block-based concepts. Because the number of memory access points directly affects the time consumption of the labeling algorithms, the aim of the proposed algorithm is to minimize neighborh...

  • Feature Paper
  • Article
  • Open Access
402 Views
16 Pages

12 November 2025

In this work, we propose a novel Biased Random-Key Genetic Algorithm (BRKGA) to solve the Maximum Flow with Minimum Number of Labels (MF-ML) problem, a challenging NP-Complete variant of the classical Maximum Flow problem defined on graphs in which a...

  • Article
  • Open Access
17 Citations
6,314 Views
18 Pages

Label placement is a difficult problem in automated map production. Many methods have been proposed to automatically place labels for various types of maps. While the methods are designed to automatically and effectively generate labels for the point...

  • Study Protocol
  • Open Access
2 Citations
2,357 Views
17 Pages

Shrimp Counting Algorithm Using a Small-Scale Labeling Model

  • Meiling Wang,
  • Zhuoyue Cai,
  • Yifan Chen,
  • Shangqing Yang,
  • Leilei Chen and
  • Qingsong Hu

29 November 2024

This study presents an algorithm for shrimp counting using a small-scale labeling model. The aim is to enhance shrimp farming efficiency, reduce biosecurity risks, and minimize manual counting errors. Experimental evaluations were conducted using Lit...

  • Article
  • Open Access
3 Citations
1,714 Views
25 Pages

The Electric Fish Optimization (EFO) algorithm is inspired by the predation behavior and communication of weak electric fish. It is a novel meta-heuristic algorithm that attracts researchers because it has few tunable parameters, high robustness, and...

  • Article
  • Open Access
50 Citations
7,504 Views
15 Pages

A Weighted Voting Ensemble Self-Labeled Algorithm for the Detection of Lung Abnormalities from X-Rays

  • Ioannis E. Livieris,
  • Andreas Kanavos,
  • Vassilis Tampakas and
  • Panagiotis Pintelas

16 March 2019

During the last decades, intensive efforts have been devoted to the extraction of useful knowledge from large volumes of medical data employing advanced machine learning and data mining techniques. Advances in digital chest radiography have enabled r...

  • Article
  • Open Access
5 Citations
2,618 Views
16 Pages

26 May 2022

Profiting from the great progress of information technology, a huge number of multi-label samples are available in our daily life. As a result, multi-label classification has aroused widespread concern. Different from traditional machine learning met...

  • Article
  • Open Access
2 Citations
2,978 Views
27 Pages

Label-Setting Algorithm for Multi-Destination K Simple Shortest Paths Problem and Application

  • Sethu Vinayagam Udhayasekar,
  • Karthik K. Srinivasan,
  • Pramesh Kumar and
  • Bhargava Rama Chilukuri

25 July 2024

The k shortest paths problem finds applications in multiple fields. Of particular interest in the transportation field is the variant of finding k simple shortest paths (KSSP), which has a higher complexity. This research presents a novel label-setti...

  • Article
  • Open Access
1 Citations
2,013 Views
17 Pages

11 March 2024

In the realm of personalized federated learning, some current methods substitute shared parameters with shared samples created by Generative Adversarial Networks (GANs). This enables each client to independently design the architecture of their neura...

  • Article
  • Open Access
5 Citations
2,939 Views
19 Pages

25 April 2023

Legal Judgment Prediction aims to automatically predict judgment outcomes based on descriptions of legal cases and established law articles, and has received increasing attention. In the preliminary work, several problems still have not been adequate...

  • Article
  • Open Access
2 Citations
2,468 Views
16 Pages

21 May 2022

The non-parametric Gaussian mixture of regressions (NPGMRs) model serves as a flexible approach for the determination of latent heterogeneous regression relationships. This model assumes that the component means, variances and mixing proportions are...

  • Article
  • Open Access
640 Views
20 Pages

27 September 2025

In order to enhance leakage detection accuracy in water distribution networks (WDNs) while reducing sensor deployment costs, an intelligent algorithm for the optimal deployment of water network monitoring sensors based on the automatic labelling and...

  • Article
  • Open Access
3 Citations
12,473 Views
21 Pages

6 March 2024

In the dynamic world of finance, the application of Artificial Intelligence (AI) in pair trading strategies is gaining significant interest among scholars. Current AI research largely concentrates on regression analyses of prices or spreads between p...

  • Article
  • Open Access
9 Citations
2,543 Views
11 Pages

24 July 2023

Quantitative analysis of intracranial vessel segments typically requires the identification of the vessels’ centerlines, and a path-finding algorithm can be used to automatically detect vessel segments’ centerlines. This study compared th...

  • Article
  • Open Access
521 Views
25 Pages

Advances in deep learning are impressive in various fields and have achieved performance beyond human capabilities in tasks such as image classification, as demonstrated in competitions such as the ImageNet Large Scale Visual Recognition Challenge. N...

  • Article
  • Open Access
6 Citations
5,046 Views
24 Pages

A Comparative Study of Two State-of-the-Art Feature Selection Algorithms for Texture-Based Pixel-Labeling Task of Ancient Documents

  • Maroua Mehri,
  • Ramzi Chaieb,
  • Karim Kalti,
  • Pierre Héroux,
  • Rémy Mullot and
  • Najoua Essoukri Ben Amara

Recently, texture features have been widely used for historical document image analysis. However, few studies have focused exclusively on feature selection algorithms for historical document image analysis. Indeed, an important need has emerged to us...

  • Article
  • Open Access
3 Citations
2,796 Views
15 Pages

A Novel Connected-Components Algorithm for 2D Binarized Images

  • Costin-Anton Boiangiu,
  • Giorgiana-Violeta Vlăsceanu,
  • Constantin-Eduard Stăniloiu,
  • Nicolae Tarbă and
  • Mihai-Lucian Voncilă

5 June 2025

This paper introduces a new memory-efficient algorithm for connected-components labeling in binary images, which is based on run-length encoding. Unlike conventional pixel-based methods that scan and label individual pixels using global buffers or di...

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

Intelligent Neural Network Schemes for Multi-Class Classification

  • Ying-Jie You,
  • Chen-Yu Wu,
  • Shie-Jue Lee and
  • Ching-Kuan Liu

26 September 2019

Multi-class classification is a very important technique in engineering applications, e.g., mechanical systems, mechanics and design innovations, applied materials in nanotechnologies, etc. A large amount of research is done for single-label classifi...

  • Article
  • Open Access
3 Citations
4,357 Views
18 Pages

22 June 2020

It is very challenging to design the capacity-approaching labeling schemes for large constellations, such as 32-QAM, in delayed bit-interleaved coded modulation (DBICM). In this paper, we investigate the labeling design for 32-QAM DBICM with various...

  • Article
  • Open Access
5 Citations
3,779 Views
18 Pages

A Feasible Community Detection Algorithm for Multilayer Networks

  • Dongming Chen,
  • Panpan Du,
  • Qianrong Jiang,
  • Xinyu Huang and
  • Dongqi Wang

2 February 2020

As a more complicated network model, multilayer networks provide a better perspective for describing the multiple interactions among social networks in real life. Different from conventional community detection algorithms, the algorithms for multilay...

  • Article
  • Open Access
14 Citations
4,927 Views
21 Pages

12 June 2020

In this paper, we study the problem of developing new combinatorial generation algorithms. The main purpose of our research is to derive and improve general methods for developing combinatorial generation algorithms. We present basic general methods...

  • Article
  • Open Access
2 Citations
2,041 Views
20 Pages

A Novel EM-Type Algorithm to Estimate Semi-Parametric Mixtures of Partially Linear Models

  • Sphiwe B. Skhosana,
  • Salomon M. Millard and
  • Frans H. J. Kanfer

22 February 2023

Semi- and non-parametric mixture of normal regression models are a flexible class of mixture of regression models. These models assume that the component mixing proportions, regression functions and/or variances are non-parametric functions of the co...

  • Article
  • Open Access
1 Citations
7,719 Views
32 Pages

Generating Realistic Labelled, Weighted Random Graphs

  • Michael Charles Davis,
  • Zhanyu Ma,
  • Weiru Liu,
  • Paul Miller,
  • Ruth Hunter and
  • Frank Kee

8 December 2015

Generative algorithms for random graphs have yielded insights into the structure and evolution of real-world networks. Most networks exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation...

  • Article
  • Open Access
20 Citations
5,062 Views
22 Pages

An Efficient Algorithm to Determine Probabilistic Bisimulation

  • Jan Friso Groote,
  • Jao Rivera Verduzco and
  • Erik P. De Vink

3 September 2018

We provide an algorithm to efficiently compute bisimulation for probabilistic labeled transition systems, featuring non-deterministic choice as well as discrete probabilistic choice. The algorithm is linear in the number of transitions and logarithmi...

  • Article
  • Open Access
9 Citations
3,496 Views
24 Pages

Mixture-Based Probabilistic Graphical Models for the Label Ranking Problem

  • Enrique G. Rodrigo,
  • Juan C. Alfaro,
  • Juan A. Aledo and
  • José A. Gámez

31 March 2021

The goal of the Label Ranking (LR) problem is to learn preference models that predict the preferred ranking of class labels for a given unlabeled instance. Different well-known machine learning algorithms have been adapted to deal with the LR problem...

  • Article
  • Open Access
8 Citations
5,821 Views
23 Pages

Improving Multi-Instance Multi-Label Learning by Extreme Learning Machine

  • Ying Yin,
  • Yuhai Zhao,
  • Chengguang Li and
  • Bin Zhang

24 May 2016

Multi-instance multi-label learning is a learning framework, where every object is represented by a bag of instances and associated with multiple labels simultaneously. The existing degeneration strategy-based methods often suffer from some common dr...

  • Article
  • Open Access
1 Citations
5,061 Views
35 Pages

Use the K-Neighborhood Subgraphs to Compute Canonical Labelings of Graphs

  • Jianqiang Hao,
  • Yunzhan Gong,
  • Jianzhi Sun and
  • Li Tan

1 August 2019

This paper puts forward an innovative theory and method to calculate the canonical labelings of graphs that are distinct to N a u t y ’s. It shows the correlation between the canonical labeling of a graph and the canonical labeling of it...

  • Article
  • Open Access
2 Citations
7,158 Views
50 Pages

Using k-Mix-Neighborhood Subdigraphs to Compute Canonical Labelings of Digraphs

  • Jianqiang Hao,
  • Yunzhan Gong,
  • Yawen Wang,
  • Li Tan and
  • Jianzhi Sun

22 February 2017

This paper presents a novel theory and method to calculate the canonical labelings of digraphs whose definition is entirely different from the traditional definition of Nauty. It indicates the mutual relationships that exist between the canonical lab...

  • Article
  • Open Access
5 Citations
3,377 Views
18 Pages

26 August 2022

In this paper, we propose the specific recursion formula for the generalized labeled multi-Bernoulli filter based on the track-before-detect strategy (GLMB-TBD) using a belief propagation algorithm. The proposed method aims to track multiple weak tar...

  • Article
  • Open Access
9 Citations
7,275 Views
17 Pages

Electric vehicles play a key role for developing an eco-sustainable transport system. One critical component of an electric vehicle is its battery, which can be quickly charged or exchanged before it runs out. The problem of electric vehicle dispatch...

  • Article
  • Open Access
3 Citations
3,909 Views
12 Pages

Detecting the Structural Hole for Social Communities Based on Conductance–Degree

  • Zhifang Liao,
  • Lite Gu,
  • Xiaoping Fan,
  • Yan Zhang and
  • Chuanqi Tang

29 June 2020

It has been shown that identifying the structural holes in social networks may help people analyze complex networks, which is crucial in community detection, diffusion control, viral marketing, and academic activities. Structural holes bridge differe...

  • Article
  • Open Access
22 Citations
4,653 Views
18 Pages

Workshop Safety Helmet Wearing Detection Model Based on SCM-YOLO

  • Bin Zhang,
  • Chuan-Feng Sun,
  • Shu-Qi Fang,
  • Ye-Hai Zhao and
  • Song Su

5 September 2022

In order to overcome the problems of object detection in complex scenes based on the YOLOv4-tiny algorithm, such as insufficient feature extraction, low accuracy, and low recall rate, an improved YOLOv4-tiny safety helmet-wearing detection algorithm...

  • Article
  • Open Access
2 Citations
1,933 Views
18 Pages

Development of a Universal Validation Protocol and an Open-Source Database for Multi-Contextual Facial Expression Recognition

  • Ludovica La Monica,
  • Costanza Cenerini,
  • Luca Vollero,
  • Giorgio Pennazza,
  • Marco Santonico and
  • Flavio Keller

10 October 2023

Facial expression recognition (FER) poses a complex challenge due to diverse factors such as facial morphology variations, lighting conditions, and cultural nuances in emotion representation. To address these hurdles, specific FER algorithms leverage...

  • Article
  • Open Access
11 Citations
4,971 Views
23 Pages

Competitive Particle Swarm Optimization for Multi-Category Text Feature Selection

  • Jaesung Lee,
  • Jaegyun Park,
  • Hae-Cheon Kim and
  • Dae-Won Kim

18 June 2019

Multi-label feature selection is an important task for text categorization. This is because it enables learning algorithms to focus on essential features that foreshadow relevant categories, thereby improving the accuracy of text categorization. Rece...

  • Article
  • Open Access
6 Citations
3,315 Views
20 Pages

31 December 2021

Truss size and topology optimization problems have recently been solved mainly by many different metaheuristic methods, and these methods usually require a large number of structural analyses due to their mechanism of population evolution. A branched...

  • Article
  • Open Access
13 Citations
3,316 Views
17 Pages

6 February 2022

Cancer cells undergo phenotypic changes or mutations during treatment, making detecting protein-based or gene-based biomarkers challenging. Here, we used algorithmic analysis combined with patient-derived tumor models to derive an early prediction to...

  • Article
  • Open Access
688 Views
20 Pages

25 June 2025

This study investigates a variant of the shortest path problem (SPP) tailored for plug-in hybrid electric vehicles (PHEVs), incorporating two practical features: hybrid energy mode switching and partial charging. A novel modeling framework is propose...

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

25 January 2017

The algorithm MLS (Maximal Label Search) is a graph search algorithm that generalizes the algorithms Maximum Cardinality Search (MCS), Lexicographic Breadth-First Search (LexBFS), Lexicographic Depth-First Search (LexDFS) and Maximal Neighborhood Sea...

  • Article
  • Open Access
2 Citations
2,653 Views
18 Pages

22 October 2021

Analyzing the solution space structure and evolution of 3-satisfiability (3-SAT) problem is an important way to study the difficulty of the solving satisfiability (SAT) problem. However, there is no unified analysis model for the spatial structure an...

  • Article
  • Open Access
1 Citations
2,837 Views
32 Pages

6 March 2025

This study addresses a specialized variant of the full-truckload delivery problem inspired by a Turkish logistics firm that operates in the liquid transportation sector. An exact algorithm is proposed for the relevant problem, to which no exact appro...

  • Article
  • Open Access
3 Citations
2,490 Views
18 Pages

A Fast Quantum Image Component Labeling Algorithm

  • Yan Li,
  • Dapeng Hao,
  • Yang Xu and
  • Kinkeung Lai

1 August 2022

Component Labeling, as a fundamental preprocessing task in image understanding and pattern recognition, is an indispensable task in digital image processing. It has been proved that it is one of the most time-consuming tasks within pattern recognitio...

  • Abstract
  • Open Access
3 Citations
1,436 Views
2 Pages

Background and objectives: The front-of-pack label Nutri-Score has met a lot of scientific opposition [...]

  • Article
  • Open Access
5 Citations
4,827 Views
13 Pages

Modularity-Based Incremental Label Propagation Algorithm for Community Detection

  • Yunlong Ma,
  • Yukai Zhao,
  • Jingwei Wang,
  • Min Liu,
  • Weiming Shen and
  • Yumin Ma

12 June 2020

Label Propagation Algorithm (LPA) is a fast community detection algorithm. However, since each node is randomly assigned a different label at first, there is serious randomness in the label updating process of LPA, resulting in great instability of d...

  • Article
  • Open Access
2 Citations
3,778 Views
23 Pages

Progressive Multiple Alignment of Graphs

  • Marcos E. González Laffitte and
  • Peter F. Stadler

11 March 2024

The comparison of multiple (labeled) graphs with unrelated vertex sets is an important task in diverse areas of applications. Conceptually, it is often closely related to multiple sequence alignments since one aims to determine a correspondence, or m...

  • Article
  • Open Access
1,416 Views
16 Pages

29 August 2024

In abstract argumentation frameworks, the computation of stable extensions is an important semantic task for evaluating the acceptability of arguments. The current approaches for the computation of stable extensions are typically conducted through me...

  • Article
  • Open Access
3 Citations
4,072 Views
18 Pages

AlgoLabel: A Large Dataset for Multi-Label Classification of Algorithmic Challenges

  • Radu Cristian Alexandru Iacob,
  • Vlad Cristian Monea,
  • Dan Rădulescu,
  • Andrei-Florin Ceapă,
  • Traian Rebedea and
  • Ștefan Trăușan-Matu

9 November 2020

While semantic parsing has been an important problem in natural language processing for decades, recent years have seen a wide interest in automatic generation of code from text. We propose an alternative problem to code generation: labelling the alg...

of 61