| | |
| | |
Stat |
Members: 3643 Articles: 2'488'730 Articles rated: 2609
29 March 2024 |
|
| | | |
|
Article overview
| |
|
Smoothing graph signals via random spanning forests | Yusuf Y. Pilavci
; Pierre-Olivier Amblard
; Simon Barthelmé
; Nicolas Tremblay
; | Date: |
17 Oct 2019 | Abstract: | Another facet of the elegant link between random processes on graphs and
Laplacian-based numerical linear algebra is uncovered: based on random spanning
forests, novel Monte-Carlo estimators for graph signal smoothing are proposed.
These random forests are sampled efficiently via a variant of Wilson’s
algorithm --in time linear in the number of edges. The theoretical variance of
the proposed estimators are analyzed, and their application to several problems
are considered, such as Tikhonov denoising of graph signals or semi-supervised
learning for node classification on graphs. | Source: | arXiv, 1910.7963 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |