English
Related papers

Related papers: Conditional aggregation-based Choquet integral on …

200 papers

Evolutionary algorithms have been applied to a wide range of stochastic problems. Motivated by real-world problems where constraint violations have disruptive effects, this paper considers the chance-constrained knapsack problem (CCKP)…

Neural and Evolutionary Computing · Computer Science 2021-08-02 Yue Xie , Oscar Harper , Hirad Assimi , Aneta Neumann , Frank Neumann

In this note the Choquet type operators are introduced, in connection to Choquet's theory of integrability with respect to a not necessarily additive set function. Based on their properties, a quantitative estimate for the nonlinear…

Classical Analysis and ODEs · Mathematics 2021-04-14 Sorin G. Gal , Constantin P. Niculescu

Many important collective decision-making problems can be seen as multi-agent versions of discrete optimisation problems. Participatory budgeting, for instance, is the collective version of the knapsack problem; other examples include…

Artificial Intelligence · Computer Science 2021-12-02 Linus Boes , Rachael Colley , Umberto Grandi , Jerome Lang , Arianna Novaro

Shape-constrained optimization arises in a wide range of problems including distributionally robust optimization (DRO) that has surging popularity in recent years. In the DRO literature, these problems are usually solved via reduction into…

Optimization and Control · Mathematics 2024-06-13 Henry Lam , Zhenyuan Liu , Dashi I. Singham

In this paper, we study integral functionals defined on spaces of functions with values on general (non-separable) Banach spaces. We introduce a new class of integrands and multifunctions for which we obtain measurable selection results.…

Optimization and Control · Mathematics 2022-08-10 Juan Guillermo Garrido , Pedro Pérez-Aros , Emilio Vilches

In this paper, we present approximation algorithms for combinatorial optimization problems under probabilistic constraints. Specifically, we focus on stochastic variants of two important combinatorial optimization problems: the k-center…

Data Structures and Algorithms · Computer Science 2008-09-03 Shipra Agrawal , Amin Saberi , Yinyu Ye

A recent characterisation of Fock-adapted contraction operator stochastic cocycles on a Hilbert space, in terms of their associated semigroups, yields a general principle for the construction of such cocycles by approximation of their…

Functional Analysis · Mathematics 2007-05-23 J. Martin Lindsay , Stephen J. Wills

Three important properties in aggregation theory are investigated, namely horizontal min-additivity, horizontal max-additivity, and comonotonic additivity, which are defined by certain relaxations of the Cauchy functional equation in…

Functional Analysis · Mathematics 2011-08-01 Miguel Couceiro , Jean-Luc Marichal

We introduce methods to count and enumerate all maximal independent, all maximum independent sets, and all independent sets in threshold graphs and k-threshold graphs. Within threshold graphs and k-threshold graphs independent sets…

Data Structures and Algorithms · Computer Science 2017-10-26 Frank Gurski , Carolin Rehs

Pooled logistic regression models are commonly applied in survival analysis. However, the standard implementation can be computationally demanding, which is further exacerbated when using the nonparametric bootstrap for inference. To ease…

Methodology · Statistics 2025-04-21 Paul N Zivich , Stephen R Cole , Bonnie E Shook-Sa , Justin B DeMonte , Jessie K Edwards

The main aim of this paper is to show that the nonlinear Choquet integral can be used to construct nonlinear approximation operators, exactly as by the use in probability of the Lebesgue-type integral, linear and positive approximation…

Classical Analysis and ODEs · Mathematics 2016-05-23 Sorin G Gal

We propose a new global SPACING constraint that is useful in modeling events that are distributed over time, like learning units scheduled over a study program or repeated patterns in music compositions. First, we investigate theoretical…

Logic in Computer Science · Computer Science 2013-03-26 Nina Narodytska , Peter Skocovsky , Toby Walsh

The stochastic knapsack problem is the stochastic variant of the classical knapsack problem in which the algorithm designer is given a a knapsack with a given capacity and a collection of items where each item is associated with a profit…

Data Structures and Algorithms · Computer Science 2017-12-05 Anindya De

Survival data with time-varying covariates are common in practice. If relevant, they can improve on the estimation of survival function. However, the traditional survival forests - conditional inference forest, relative risk forest and…

Applications · Statistics 2022-06-06 Weichi Yao , Halina Frydman , Denis Larocque , Jeffrey S. Simonoff

This paper introduces feature subset weighting using monotone measures for distance-based supervised learning. The Choquet integral is used to define a distance metric that incorporates these weights. This integration enables the proposed…

Machine Learning · Computer Science 2025-09-26 Adnan Theerens , Yvan Saeys , Chris Cornelis

We present a general method for constructing integrable stochastic processes, with two-step discrete time Floquet dynamics, from the transfer matrix formalism. The models can be interpreted as a discrete time parallel update. The method can…

Mathematical Physics · Physics 2018-04-04 Matthieu Vanicat

Discrimination and calibration represent two important properties of survival analysis, with the former assessing the model's ability to accurately rank subjects and the latter evaluating the alignment of predicted outcomes with actual…

Machine Learning · Computer Science 2024-06-04 Shi-ang Qi , Yakun Yu , Russell Greiner

The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…

Functional Analysis · Mathematics 2010-06-02 Gordan Zitkovic

We study the population genetics of Evolution in the important special case of weak selection, in which all fitness values are assumed to be close to one another. We show that in this regime natural selection is tantamount to the…

Computer Science and Game Theory · Computer Science 2012-08-16 Erick Chastain , Adi Livnat , Christos Papadimitriou , Umesh Vazirani

This paper is devoted to the study of approximate solutions for a multiobjective interval-valued optimization problem based on an interval order. We establish new existence theorems of approximate solutions for such a problem under some…

Optimization and Control · Mathematics 2025-02-19 Chuang-liang Zhang , Yun-cheng Liu , Nan-jing Huang
‹ Prev 1 3 4 5 6 7 10 Next ›