Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Adaptive Joint Estimation of Temporal Vertex and Edge Signals (2211.06533v3)

Published 12 Nov 2022 in cs.SI and eess.SP

Abstract: The adaptive estimation of coexisting temporal vertex (node) and edge signals on graphs is a critical task when a change in edge signals influences the temporal dynamics of the vertex signals. However, the current Graph Signal Processing algorithms mostly consider only the signals existing on the graph vertices and have neglected the fact that signals can reside on the edges. We propose an Adaptive Joint Vertex-Edge Estimation (AJVEE) algorithm for jointly estimating time-varying vertex and edge signals through a time-varying regression, incorporating both vertex signal filtering and edge signal filtering. Accompanying AJVEE is a newly proposed Adaptive Least Mean Square procedure based on the Hodge Laplacian (ALMS-Hodge), which is inspired by classical adaptive filters combining simplicial filtering and simplicial regression. AJVEE is able to operate jointly on the vertices and edges by merging two ALMS-Hodge specified on the vertices and edges into a unified formulation. A more generalized case extending AJVEE beyond the vertices and edges is being discussed. Experimenting on real-world traffic networks and population mobility networks, we have confirmed that our proposed AJVEE algorithm could accurately and jointly track time-varying vertex and edge signals on graphs.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (53)
  1. A. Sandryhaila and J. M.F. Moura, “Big data analysis with signal processing on graphs: Representation and processing of massive data sets with irregular structure,” IEEE Signal Process. Mag., vol. 31, no. 5, pp. 80 – 90, 2014.
  2. “The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains,” IEEE Signal Process. Mag., vol. 30, pp. 83 – 98, 2013.
  3. “Graph signal processing: Overview, challenges, and applications,” Proc. IEEE, vol. 106, no. 5, pp. 808–828, 2018.
  4. “Adaptive least mean squares estimation of graph signals,” IEEE Trans. Signal Inf. Process. Netw., vol. 2, no. 4, pp. 555 – 568, 2016.
  5. “Modeling inter-station relationships with attentive temporal graph convolutional network for air quality prediction,” in WSDM, 2021, p. 616–634.
  6. “Normalized lms algorithm and data-selective strategies for adaptive graph signal estimation,” Signal Process., vol. 167, pp. 107326, 2020.
  7. “Time-dependent gene network modelling by sequential monte carlo,” IEEE/ACM Trans. Comput. Biol. Bioinf., vol. 13, no. 6, pp. 1183–1193, 2016.
  8. “A graph signal processing perspective on functional brain imaging,” Proceedings of the IEEE, vol. 106, no. 5, pp. 868–885, 2018.
  9. “Graph representation learning in biomedicine and healthcare,” Nat. Biomed. Eng, pp. 1–17, 2022.
  10. J. Yang and J. Peng, “Estimating time-varying graphical models,” J. Comput. Graph. Stat., vol. 29, no. 1, pp. 191–202, 2020.
  11. “Adaptive sign algorithm for graph signal processing,” Signal Process., vol. 200, pp. 108662, 2022.
  12. “Adaptive estimation and sparse sampling for graph signals in alpha-stable noise,” Digital Signal Process., vol. 105, pp. 102782, 2020.
  13. “Graph normalized-lmp algorithm for signal estimation under impulsive noise,” J. Signal Process. Syst., 2022.
  14. “Robust recovery for graph signal via l0subscript𝑙0l_{0}italic_l start_POSTSUBSCRIPT 0 end_POSTSUBSCRIPT-norm regularization,” IEEE Signal Process. Lett., pp. 1–5, 2023.
  15. “A graph diffusion lms strategy for adaptive graph signal processing,” in Asilomar, 2017, pp. 1973–1976.
  16. Y. Yan and E. E. Kuruoglu, “Fast and robust wind speed prediction under impulsive noise via adaptive graph-sign diffusion,” in IEEE CAI, 2023, pp. 302–305.
  17. “Kernel-based reconstruction of space-time functions on dynamic graphs,” IEEE Journal of Selected Topics in Signal Processing, vol. 11, no. 6, pp. 856–869, 2017.
  18. J. Mei and J. M. F. Moura, “Signal processing on graphs: Causal modeling of unstructured data,” IEEE Trans. Signal Process., vol. 65, no. 8, pp. 2077–2092, 2017.
  19. “Autoregressive moving average graph filtering,” IEEE Trans. Signal Process., vol. 65, no. 2, pp. 274–288, 2016.
  20. “Filtering random graph processes over random time-varying graphs,” IEEE Transactions on Signal Processing, vol. 65, no. 16, pp. 4406–4421, 2017.
  21. “Multivariate time series faorecasting with GARCH models on graphs,” IEEE Trans. Signal Inf. Process. Netw., vol. 9, pp. 557–568, 2023.
  22. “A time-vertex signal processing framework: Scalable processing and meaningful representations for time-series on graphs,” IEEE Trans. Signal Process., vol. 66, no. 3, pp. 817–829, 2018.
  23. “Distributed reconstruction of time-varying graph signals via a modified newton’s method,” J. Franklin Inst., vol. 359, no. 16, pp. 9401–9421, 2022.
  24. “Graph-based semi-supervised and active learning for edge flows,” in KDD. 2019, p. 761–771, ACM.
  25. “Computing dynamic user equilibria on large-scale networks with software implementation,” Networks and Spatial Economics, vol. 19, no. 3, pp. 869–902, 2019.
  26. “Adaptive distributed synchronization of heterogeneous multi-agent systems over directed graphs with time-varying edge weights,” J. Franklin Inst., vol. 358, no. 4, pp. 2434–2452, 2021.
  27. “Simplicial convolutional neural networks,” in ICASSP, 2022, pp. 8847–8851.
  28. T. M. Roddenberry and S. Segarra, “Hodgenet: Graph neural networks for edge data,” in ACSSC, 2019, pp. 220–224.
  29. M. T. Schaub and S. Segarra, “Flow smoothing and denoising: Graph signal processing in the edge-space,” in GlobalSIP, 2018, pp. 735–739.
  30. S. Barbarossa and S. Sardellitti, “Topological signal processing over simplicial complexes,” IEEE Trans. Signal Process., vol. 68, pp. 2992–3007, 2020.
  31. S. Barbarossa and S. Sardellitti, “Topological signal processing: Making sense of data building on multiway relations,” IEEE Signal Process. Mag., vol. 37, no. 6, pp. 174–183, 2020.
  32. “Hodgelets: Localized spectral representations of flows on simplicial complexes,” in ICASSP, 2022, pp. 5922–5926.
  33. “Topological slepians: Maximally localized representations of signals over simplicial complexes,” arXiv, 2022.
  34. “Finite impulse response filters for simplicial complexes,” in EUSIPCO, 2021, pp. 2005–2009.
  35. S. Sardellitti and S. Barbarossa, “Robust signal processing over simplicial complexes,” in ICASSP, 2022, pp. 8857–8861.
  36. “Simplicial convolutional filters,” IEEE Trans. Signal Process., vol. 70, pp. 4633–4648, 2022.
  37. “Distributed denoising over simplicial complexes using chebyshev polynomial approximation,” in EUSIPCO, 2022, pp. 822–826.
  38. “Online edge flow imputation on networks,” IEEE Signal Process. Lett., vol. 30, pp. 115–119, 2023.
  39. “Simplicial vector autoregressive model for streaming edge flows,” in ICASSP, 2023.
  40. “Edge sampling of graphs based on edge smoothness,” in ICASSP, 2022, pp. 5932–5936.
  41. “Simplicial attention neural networks,” arXiv, 2022.
  42. “SGAT: Simplicial graph attention network,” 2022, pp. 3192–3200, IJCAI.
  43. “Transfer graph neural networks for pandemic forecasting,” AAAI, vol. 35, no. 6, pp. 4838–4845, May 2021.
  44. “Random walks on simplicial complexes and the normalized hodge 1-laplacian,” SIAM Review, vol. 62, no. 2, pp. 353–391, 2020.
  45. L.-H. Lim, “Hodge laplacians on graphs,” SIAM Review, vol. 62, no. 3, pp. 685–715, 2020.
  46. “What are higher-order networks?,” SIAM Review, vol. 65, no. 3, pp. 686–731, 2023.
  47. “GraphHop: An enhanced label propagation method for node classification,” IEEE Trans. Neural Netw. Learn. Syst, pp. 1–15, 2022.
  48. “Chebyshev polynomial approximation for distributed signal processing,” in DCOSS, 2011, pp. 1–8.
  49. “Variance analysis of unbiased least lp-norm estimator in non-gaussian noise,” Signal Processing, vol. 122, pp. 190–203, 2016.
  50. P. Diniz, Adaptive Filtering: Algorithms and Practical Implementation, Springer, 01 2008.
  51. L. Stanković and E. Sejdić, Vertex-frequency analysis of graph signals, Springer, 2019.
  52. “Transportation networks for research,” url = https://github.com/bstabler/TransportationNetworks.
  53. Y. Yan and E. E. Kuruoglu, “Online signal estimation on the graph edges via line graph transformation,” preprint, arXiv:2311.00656, 2023.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets