Pattern classification as interpolation in N dimensions
Patrick A. V. Hall · The Computer Journal · 1968
Pattern classifications are considered equivalent to computing a special function, and the problem in designing a machine is to reconstruct and approximate this function given only a finite set of samples from the function. Interpolation theory is applied to the problem and a variety of realisations are suggested. While the theoretical viewpoint is new and general, the realisations are shown to be equivalent to many existing solutions; however, this theory allows a systematic approach to design, with a firm and general background to convergence and error.