We investigate the problem of breast cancer screening optimization, using various techniques applicable in domains where the data format is not defined in advance. The aim is to minimize the cost related to the screening of patients while maximizing the beneficial effect of the process regarding some key breast cancer indices. Our model can…
Decision trees rank among the most popular classification tools, employed in practical applications due to their known efficiency. A Nash equilibrium-based decision tree splits node data using the Nash equilibrium concept. Boosting is a technique that is used to enhance the performance of a classifier by allowing an in-depth exploration of the data. This…
The critical node detection problem is a central task in computational graph theory due to its large applicability, consisting in deleting $k$ nodes to minimize a certain graph measure. In this article, we propose a new Extremal Optimization-based approach, the Pseudo-Deterministic Noisy Extremal Optimization (PDNEO) algorithm, to solve the Critical Node Detection variant in…
Today, robots can be found in almost any field. Examples include robots for transporting materials in hospitals and warehouses, surveillance, intelligent laboratories and space exploration. Whatever the reason for moving the robot and whatever its location, all robot applications anywhere require path calculation. In this paper, we address the problem of collision-free path planning…
The Influence Maximization Problem is a challenging computational task with multiple real-world applications. A new approach to this problem based on cooperative game theory and optimization called the Shapley Influence Maximization Extremal Optimization approach is proposed. The influence maximization problem for the independent cascade model is considered as a cooperative game, where players seek…
Decision trees are some of the most popular and intuitive classification techniques. Based on the recursive division of the data, the goal is to ultimately identify regions in the space in which most instances belong to the same class. This paper proposes a game-theoretic decision tree using a two-player game to determine the splitting…
The Nash equilibrium is used to estimate the parameters of a Probit binary classification model transformed into a multiplayer game. Each training data instance is a player of the game aiming to maximize its own log likelihood function. The Nash equilibrium of this game is approximated by modifying the Covariance Matrix Adaptation Evolution Strategy…
Nowadays, software systems encounter repeated modifications in order to satisfy any requirement regarding a business change. To assure that these changes do not affect systems' proper functioning, those parts affected by the changes need to be retested, minimizing the negative impact of performed modifications on another part of the software. In this research, we…
Determining the critical nodes in a network given a certain network measure is a computational challenging problem that requires the design of adaptive and scalable algorithms. The number of connected components in a graph is an example of such a measure: in this case the nodes considered critical are those that, if removed from…
Critical node detection is a crucial task in network analysis. In this article a new problem is proposed, the critical node detection in hypergraphs, which are a generalization of the ‘traditional’ graphs. A genetic algorithm is proposed to solve this problem and as an application an inflation dataset is transformed in a hypergraph and…
