Many current problems dealing with big data can be cast efficiently as function approximation on graphs. The information in the graph structure can often be reorganized in the form of a tree; for example, using clustering techniques. The objective of this paper is to develop a new system of orthogonal functions on weighted trees. The system is local, easily implementable, and allows for scalable approximations without saturation. A novelty of our orthogonal system is that the Fourier projections are uniformly bounded in the supremum norm. We describe in detail a construction of wavelet-like representations and estimate the degree of approximation of functions on the trees.
SchlagwörterAnalysis On Graphs And Trees ; Big Data ; Function Approximation On Big Data ; Wavelet-like Representation; Diffusion Maps; Laplacian; Wavelets; Frames