Measure fields for function approximation

@article{Marroqun1995MeasureFF,
  title={Measure fields for function approximation},
  author={Jos{\'e} L. Marroqu{\'i}n},
  journal={IEEE transactions on neural networks},
  year={1995},
  volume={6 5},
  pages={
          1081-90
        }
}
The computation of a piecewise smooth function that approximates a finite set of data points may be decomposed into two decoupled tasks: 1) the computation of the locally smooth models, and hence, the segmentation of the data into classes that consist of the sets of points best approximated by each model; 2) the computation of the normalized discriminant functions for each induced class (which maybe interpreted as relative probabilities). The approximating function may then be computed as the… CONTINUE READING
BETA