| Full text | |
| Author(s): |
Tiglea, Daniel G.
;
Candido, Renato
;
Silva, Magno T. M.
;
IEEE
Total Authors: 4
|
| Document type: | Journal article |
| Source: | 2019 27TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO); v. N/A, p. 5-pg., 2019-01-01. |
| Abstract | |
Graph signal processing has attracted attention in the signal processing community, since it is an effective tool to deal with great quantities of interrelated data. Recently, a diffusion algorithm for adaptively learning from streaming graphs signals was proposed. However, it suffers from high computational cost since all nodes in the graph are sampled even in steady state. In this paper, we propose an adaptive sampling method for this solution that allows a reduction in computational cost in steady state, while maintaining convergence rate and presenting a slightly better steady-state performance. We also present an analysis to give insights about proper choices for its adaptation parameters. (AU) | |
| FAPESP's process: | 17/20378-9 - Adaptive filters and machine learning: applications on image, communications, and speech |
| Grantee: | Magno Teófilo Madeira da Silva |
| Support Opportunities: | Regular Research Grants |