About: Relaxed intersection
An Entity of Type: Abstraction100002137,
from Named Graph: http://dbpedia.org,
within Data Space: dbpedia.org
The relaxed intersection of m sets corresponds to the classicalintersection between sets except that it is allowed to relax few sets in order to avoid an empty intersection.This notion can be used to solve Constraints Satisfaction Problemsthat are inconsistent by relaxing a small number of constraints.When a bounded-error approach is considered for parameter estimation,the relaxed intersection makes it possible to be robust with respectto some outliers.