skip to main content
10.1145/3635638.3635664acmotherconferencesArticle/Chapter ViewAbstractPublication PagesmlmiConference Proceedingsconference-collections
research-article

Research on Graph Signal Sampling and Reconstruction Method Based on Causal Emergence

Published:16 January 2024Publication History

ABSTRACT

Graph signal sampling and reconstruction techniques effectively reduce data dimensions while preserving the information and structure contained in networks. The distortion-free reduction of data dimensions not only aids in reducing the computational complexity of data but also facilitates the extraction of network features and attributes. This reduction in data dimensions provides convenience for the better analysis and processing of complex network data, ultimately enhancing the efficiency of complex network analysis tasks. Currently, the field of graph signal processing primarily consists of two fundamental frameworks: graph signal processing based on the graph Laplacian matrix and graph signal processing based on the graph's adjacency matrix . Although these two frameworks make full use of the topological structure of graph models, they do not consider the relationships between node information within networks, nor do they integrate individual node information with network structural information. Furthermore, they fail to approach the problem of sampling and reconstruction from the perspective of overall network information. This paper takes the network's intrinsic topological structure and the causal relationships between nodes as its starting point. The goal is to reduce network size and increase the effective information of individual nodes to make the entire network contain richer, valuable information. Combining the graph signal research method based on the graph Laplacian matrix, this paper introduces a graph signal sampling and reconstruction algorithm based on causal emergence. The algorithm initially employs a causal emergence algorithm based on spectral methods to obtain the sampled network and subsequently utilizes classical representation learning algorithms to acquire node representations of the sampled network. This approach enables us to obtain graph signal representations that are richer than those of the original network. Subsequently, we apply a reconstruction framework to reconstruct the obtained graph signals. Finally, the experimental results conducted on three real networks demonstrate that the proposed algorithm outperforms existing theories of graph signal sampling and reconstruction. This research contributes valuable insights and methods to the further development of the field of graph signal processing.

References

  1. Fan R K C. Spectral graph theory[M].Published for the Conference Board of the mathematical science by the American Mathematical Society,1997.Google ScholarGoogle Scholar
  2. Cvetkovic D, Rowlinson P, Simic S. An introduction to the theory of graph spectra[J]. Comparative & General Pharmacology,2009,2(6):217-224.Google ScholarGoogle Scholar
  3. Proakis J G, Manolakis D G. Digital signal processing: principles, algorithms, and applications [J].2006,23(4):392-394.Google ScholarGoogle Scholar
  4. Shuman D I, Narang S K, Frossard P, The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains. IEEE Signal Processing Magazine, 2013, 30(3):83–98.Google ScholarGoogle ScholarCross RefCross Ref
  5. Liu D, Brace C L. Big Data Analysis with Signal Processing on Graphs: Representation and processing of massive data sets with irregular structure[J].IEEE Signal Processing Magazine,2014,31(5):80-90.Google ScholarGoogle Scholar
  6. Brennan Klein and Erik Hoel. “The emergence of informative higher scales in complex networks”. In: Complexity (in press). url: https://arxiv.org/abs/1907.03902.Google ScholarGoogle Scholar
  7. Sandryhaila A, Moura J M F. Discrete Signal Processing on Graphs [J].IEEE Transactions on Signal Processing,2013,61(7):1644-1656Google ScholarGoogle Scholar
  8. Sandryhaila A, Moura J. Big Data Analysis with Signal Processing on Graphs: Representation and processing of massive data sets with irregular structure. IEEE Signal Processing Magazine,2014, 31(5):80–90.Google ScholarGoogle Scholar
  9. Sandryhaila A, Moura J M. Discrete signal processing on graphs: Frequency analysis. Signal Processing, IEEE Transactions on, 2014, 62(12):3042–3054.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Sardellitti S, Barbarossa S, Lorenzo P D. On the graph Fourier transform for directed graphs[J]. IEEE Journal of Selected Topics in Signal Processing, 2017, 11(6):796-811.Google ScholarGoogle ScholarCross RefCross Ref
  11. Magoarou L L, Gribonval R, Tremblay N. Approximate fast graph Fourier transforms via multilayer sparse approximations [J]. IEEE Transactions on Signal and Information Processing over Networks, 2018, 4(2): 407-420.Google ScholarGoogle ScholarCross RefCross Ref
  12. Tanaka Y, Eldar Y C . Generalized sampling on graphs with subspace and smoothness priors[J]. IEEE Transactions on Signal Processing, 2020,68:2272-2286.Google ScholarGoogle ScholarCross RefCross Ref
  13. Hammond D K, Vandergheynst P, Gribonval R. Wavelets on graphs via spectral graph theory[J]. Applied and Computational Harmonic Analysis, 2011, 30(2):129-150.Google ScholarGoogle ScholarCross RefCross Ref
  14. Pesenson I. Sampling in Paley-Wiener spaces on combinatorial graphs. Transactions of the American Mathematical Society, 2008, 360(10):5603–5627.Google ScholarGoogle ScholarCross RefCross Ref
  15. I. Pesenson, “Sampling in Paley-Wiener spaces on combinatorial graphs,” Trans. Amer. Math. Soc, vol. 360,no.10,pp.5603–5627, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  16. OuM, CuiP,Pei J, Asymmetric transitivity preserving graph embedding[C]//Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining2016: 1105-1114Google ScholarGoogle Scholar
  17. Erik P. Hoel. When the map is better than the territory.[J], Entropy, 2017, 19(5)Google ScholarGoogle Scholar
  18. Griebenow R, Klein B, Hoel E Finding the right scale of a network: Efficient identification of causal emergence through spectral clustering[J]. 2019.Google ScholarGoogle Scholar
  19. Finding the right scale of network:Efficient identification of causal emergence in preferential attachment networks through spectral clusting.Google ScholarGoogle Scholar
  20. Prabhakar Telagarapu, Gulivindala Suresh, J. Venkata Suman, and N. V. Lalitha, "Prabhakar Telagarapu, Gulivindala Suresh, J. Venkata Suman, and N. V. Lalitha," International Journal of Computer Theory and Engineering vol. 4, no. 1, pp. 81-84, 2012.Google ScholarGoogle Scholar
  21. Song Tiangang, Lyu Zhou, Ding Xinyang, and Wan Yi, "3D Surface Reconstruction Based on Kinect Sensor," International Journal of Computer Theory and Engineering vol. 5, no. 3, pp. 567-573, 2013.Google ScholarGoogle ScholarCross RefCross Ref
  22. Naveed Ahmed and Imran Junejo, "Using Multiple RGB-D Cameras for 3D Video Acquisition and Spatio-Temporally Coherent 3D Animation Reconstruction," International Journal of Computer Theory and Engineering vol. 6, no. 6, pp. 447-450, 2014.Google ScholarGoogle ScholarCross RefCross Ref
  23. Vicky Sintunata and Terumasa Aoki, "Color Segmentation Based Depth Adjustment for 3D Model Reconstruction from a Single Input Image," International Journal of Computer Theory and Engineering vol. 8, no. 2, pp. 171-176, 2016.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Research on Graph Signal Sampling and Reconstruction Method Based on Causal Emergence

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      MLMI '23: Proceedings of the 6th International Conference on Machine Learning and Machine Intelligence
      October 2023
      196 pages
      ISBN:9798400709456
      DOI:10.1145/3635638

      Copyright © 2023 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 16 January 2024

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed limited
    • Article Metrics

      • Downloads (Last 12 months)8
      • Downloads (Last 6 weeks)3

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format .

    View HTML Format