Interpolation by lattice polynomial functions: a polynomial time algorithm - Archive ouverte HAL Access content directly
Journal Articles Fuzzy Sets and Systems Year : 2019

Interpolation by lattice polynomial functions: a polynomial time algorithm

Abstract

This paper deals with the problem of interpolating partial functions over finite distributive lattices by lattice polynomial functions. More precisely, this problem can be formulated as follows: Given a finite dis-tributive lattice L and a partial function f from D ⊆ L n to L, find all the lattice polynomial functions that interpolate f on D. If the set of lattice polynomials interpolating a function f is not empty, then it has a unique upper bound and a unique lower bound. This paper presents a new description of these bounds and proposes an algorithm for computing them that runs in polynomial time, thus improving existing methods. Furthermore, we present an empirical study on randomly generated datasets that illustrates our theoretical results.
Fichier principal
Vignette du fichier
Interpolation_by_lattice_polynomial_functions_a_polynomial_time_algorithm.pdf (156.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01958903 , version 1 (19-12-2018)
hal-01958903 , version 2 (26-04-2019)

Identifiers

Cite

Quentin Brabant, Miguel Couceiro, José Rui Figueira. Interpolation by lattice polynomial functions: a polynomial time algorithm. Fuzzy Sets and Systems, 2019, 368, pp.101-118. ⟨10.1016/j.fss.2018.12.009⟩. ⟨hal-01958903v2⟩
147 View
213 Download

Altmetric

Share

Gmail Facebook X LinkedIn More