Open Access Green möglich sobald Postprint bei der ZB eingereicht worden ist.
Appl. Comput. Harmon. Anal. 38, 489-509 (2014)
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.
Impact Factor
Scopus SNIP
Web of Science
Times Cited
Times Cited
Scopus
Cited By
Cited By
Altmetric
3.000
3.037
14
18
Anmerkungen
Besondere Publikation
Auf Hompepage verbergern
Publikationstyp
Artikel: Journalartikel
Dokumenttyp
Wissenschaftlicher Artikel
Schlagwörter
Analysis On Graphs And Trees ; Big Data ; Function Approximation On Big Data ; Wavelet-like Representation; Diffusion Maps; Laplacian; Wavelets; Frames
Sprache
englisch
Veröffentlichungsjahr
2014
HGF-Berichtsjahr
2014
ISSN (print) / ISBN
1063-5203
e-ISSN
1096-603X
Zeitschrift
Applied and Computational Harmonic Analysis
Quellenangaben
Band: 38,
Heft: 3,
Seiten: 489-509
Verlag
Academic Press
Verlagsort
San Diego, Calif. [u.a.]
Begutachtungsstatus
Peer reviewed
Institut(e)
Institute of Computational Biology (ICB)
POF Topic(s)
30205 - Bioengineering and Digital Health
Forschungsfeld(er)
Enabling and Novel Technologies
PSP-Element(e)
G-503800-001
WOS ID
WOS:000352119200007
Scopus ID
84925289590
Scopus ID
84904446265
Erfassungsdatum
2014-07-31