Skip to main content
main-content

Annals of Mathematics and Artificial Intelligence OnlineFirst articles

22-07-2021

Exploration and exploitation analysis for the sonar inspired optimization algorithm

In the recent years, extensive discussion takes place in literature, on the effectiveness of meta-heuristics, and especially Nature Inspired Algorithms. Usually, authors state that such an approach should embody a well-balanced exploration and …

Authors:
Alexandros Tzanetos, Georgios Dounias

19-07-2021 Open Access

Chunking and cooperation in particle swarm optimization for feature selection

Bio-inspired optimization aims at adapting observed natural behavioral patterns and social phenomena towards efficiently solving complex optimization problems, and is nowadays gaining much attention. However, researchers recently highlighted an …

Authors:
Malek Sarhani, Stefan Voß

15-07-2021

On matrices and K-relations

We show that the matrix query language MATLANG corresponds to a natural fragment of the positive relational algebra on K-relations. The fragment is defined by introducing a composition operator and restricting K-relation arities to 2. We then …

Authors:
Robert Brijder, Marc Gyssens, Jan Van den Bussche

06-07-2021 Open Access

On the correspondence between abstract dialectical frameworks and nonmonotonic conditional logics

The exact relationship between formal argumentation and nonmonotonic logics is a research topic that keeps on eluding researchers despite recent intensified efforts. We contribute to a deeper understanding of this relation by investigating …

Authors:
Jesse Heyninck, Gabriele Kern-Isberner, Matthias Thimm, Kenneth Skiba

03-07-2021 Open Access

Topological measurement of deep neural networks using persistent homology

The inner representation of deep neural networks (DNNs) is indecipherable, which makes it difficult to tune DNN models, control their training process, and interpret their outputs. In this paper, we propose a novel approach to investigate the …

Authors:
Satoru Watanabe, Hayato Yamana

03-07-2021

The undecidability of proof search when equality is a logical connective

One proof-theoretic approach to equality in quantificational logic treats equality as a logical connective: in particular, term equality can be given both left and right introduction rules in a sequent calculus proof system. We present a …

Authors:
Dale Miller, Alexandre Viel

29-06-2021

Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas

In this paper, we discuss algorithms for the problem of finding read-once resolution refutations of unsatisfiable 2CNF formulas within the resolution refutation system. Broadly, a read-once resolution refutation is one in which each constraint …

Authors:
K. Subramani, Piotr Wojciechowski

26-06-2021

Constraint-based learning for non-parametric continuous bayesian networks

Modeling high-dimensional multivariate distributions is a computationally challenging task. In the discrete case, Bayesian networks have been successfully used to reduce the complexity and to simplify the problem. However, they lack of a general …

Authors:
Marvin Lasserre, Régis Lebrun, Pierre-Henri Wuillemin

26-06-2021

Guest editorial: Revised selected papers from the LION 13 conference

Authors:
Nikolaos F. Matsatsinis, Magdalene Marinaki, Yannis Marinakis, Panos M. Pardalos

25-06-2021

RAMP algorithms for the capacitated facility location problem

In this paper, we address the Capacitated Facility Location Problem (CFLP) in which the assignment of facilities to customers must ensure enough facility capacity and all the customers must be served. We propose both sequential and parallel …

Authors:
Telmo Matos, Óscar Oliveira, Dorabela Gamboa

22-06-2021

Irreducible bin packing and normality in routing open shop

The open shop is a classical scheduling problem known since 1976, which can be described as follows. A number of jobs have to be processed by a given set of machines, each machine should perform an operation on every job, and the processing times …

Authors:
Ilya Chernykh, Artem Pyatkin

21-06-2021

Least squares approach to K-SVCR multi-class classification with its applications

The support vector classification-regression machine for K-class classification (K-SVCR) is a novel multi-class classification method based on the “1-versus-1-versus-rest” structure. In this paper, we propose a least squares version of K-SVCR …

Authors:
Hossein Moosaei, Milan Hladík

21-06-2021

A dual RAMP algorithm for single source capacitated facility location problems

In this paper, we address the Single Source Capacitated Facility Location Problem (SSCFLP) which considers a set of possible locations for opening facilities and a set of clients whose demand must be satisfied. The objective is to minimize the …

Authors:
Óscar Oliveira, Telmo Matos, Dorabela Gamboa

12-06-2021

Two-phase Matheuristic for the vehicle routing problem with reverse cross-docking

Cross-dockingis a useful concept used by many companies to control the product flow. It enables the transshipment process of products from suppliers to customers. This research thus extends the benefit of cross-docking with reverse logistics …

Authors:
Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu

28-05-2021 Open Access

Ranking kinematics for revising by contextual information

Probability kinematics is a leading paradigm in probabilistic belief change. It is based on the idea that conditional beliefs should be independent from changes of their antecedents’ probabilities. In this paper, we propose a re-interpretation of …

Authors:
Meliha Sezgin, Gabriele Kern-Isberner, Christoph Beierle

27-05-2021

Neighborhood density information in clustering

Density Based Clustering (DBC) methods are capable of identifying arbitrary shaped data clusters in the presence of noise. DBC methods are based on the notion of local neighborhood density estimation. A major drawback of DBC methods is their poor …

Author:
Mujahid N. Syed

25-05-2021

Evolution of Gaussian Process kernels for machine translation post-editing effort estimation

In many Natural Language Processing problems the combination of machine learning and optimization techniques is essential. One of these problems is the estimation of the human effort needed to improve a text that has been translated using a …

Authors:
Ibai Roman, Roberto Santana, Alexander Mendiburu, Jose A. Lozano

20-05-2021

Learning tractable NAT-modeled Bayesian networks

Bayesian networks (BNs) encode conditional independence to avoid combinatorial explosion on the number of variables, but are subject to exponential growth of space and inference time on the number of causes per effect variable. Among …

Authors:
Yang Xiang, Qian Wang

12-05-2021

Evolutionary game analysis on government subsidy policy and bank loan strategy in China’s distributed photovoltaic market

Aiming to meet increasing energy demand and reduce carbon emissions caused by fossil fuel consumption, China is vigorously supporting the diffusion of photovoltaic (PV) generation equipment. The government and banks are recognized as playing …

Authors:
Xing Zhu, Baoyu Liao, Shanlin Yang, Panos M. Pardalos

06-05-2021

Breaking the curse of dimensionality: hierarchical Bayesian network model for multi-view clustering

Clustering high-dimensional data under the curse of dimensionality is an arduous task in many applications domains. The wide dimension yields the complexity-related challenges and the limited number of records leads to the overfitting trap. We …

Authors:
Hasna Njah, Salma Jamoussi, Walid Mahdi