Bernard Fichet

Learn More
In this paper, we establish that the following fitting problem is NP-hard: given a finite set X and a dissimilarity measure d on X (d is a symmetric function d from X 2 to the non-negative real numbers and vanishing on the diagonal), we wish to find a Robinsonian dis-similarity d R on X minimizing the l ∞-error ||d − d R || ∞ = max x,y∈X {|d(x, y) − d R (x,(More)
Given a vector u and a certain subset K of a real vector space E, the problem of l-approximation involves determining an element u^ in K nearest to u in the sense of the l-error norm. The subdominant u * of u is the upper bound (if it exists) of the set [x # K : x O u] (we let x Oy if all coordinates of x are smaller than or equal to the corresponding(More)
résumé – Dans un cadre général où les concepts de sous-dominante/sur-dominée jouent un rôle fondamental, nous dressons un vaste panorama d'approximations en norme du supremum pour nombre de structures de la classification : ultramétriques (partielles ou non), k-ultramétriques, régressions convexes et isotones. Pour les semi-distances/dissimilarités d'arbre(More)
  • 1