On The Radon--Nikodym Spectral Approach With Optimal Clustering

Abstract

Problems of interpolation, classification, and clustering are considered. In the tenets of Radon-Nikodym approach f (x)ψ 2 / ψ 2 , where the ψ(x) is a linear function on input attributes, all the answers are obtained from a generalized eigenproblem f |ψ [i] = λ [i] ψ [i] . The solution to the interpolation problem is a regular Radon-Nikodym derivative. The solution to the classification problem requires prior and posterior probabilities that are obtained using the Lebesgue quadrature[1] technique. Whereas in a Bayesian approach new observations change only outcome probabilities, in the Radon-Nikodym approach not only outcome probabilities but also the probability space ψ [i] change with new observations. This is a remarkable feature of the approach: both the probabilities and the probability space are constructed from the data. The Lebesgue quadrature technique can be also applied to the optimal clustering problem. The problem is solved by constructing a Gaussian quadrature on the Lebesgue measure. A distinguishing feature of the Radon-Nikodym approach is the knowledge of the invariant group: all the answers are invariant relatively any non-degenerated linear transform of input vector x components. A software product implementing the algorithms of interpolation, classification, and optimal clustering is available from the authors. * malyshki@ton.ioffe.ru