2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2016
DOI: 10.1109/icassp.2016.7472541
|View full text |Cite
|
Sign up to set email alerts
|

Diffusion filtering of graph signals and its use in recommendation systems

Abstract: This paper presents diffusion filtering as a method to smooth signals defined on the nodes of a graph or network. Diffusion filtering considers the given signals as initial temperature distributions in the nodes and diffuses heat through the edges of the graph. The filtered signal is determined by the accumulated temperatures over time at each node. We show multiple other interpretations of diffusion filtering and describe how it can be generalized to encompass a wide class of networks making it suitable for r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
32
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
8
1

Relationship

3
6

Authors

Journals

citations
Cited by 31 publications
(32 citation statements)
references
References 31 publications
0
32
0
Order By: Relevance
“…There are also several variants of the graph Laplacian [73] such as the symmetric normalized graph Laplacian L sym = D −1/2 LD −1/2 that factors out differences in degree and is thus only reflecting relative connectivity, or the random-walk normalized graph Laplacian: L rw = D −1 L. Generalizations of the graph Laplacian also exist for graphs with negative weights [45], [74].…”
Section: A Graph Fourier Transformmentioning
confidence: 99%
“…There are also several variants of the graph Laplacian [73] such as the symmetric normalized graph Laplacian L sym = D −1/2 LD −1/2 that factors out differences in degree and is thus only reflecting relative connectivity, or the random-walk normalized graph Laplacian: L rw = D −1 L. Generalizations of the graph Laplacian also exist for graphs with negative weights [45], [74].…”
Section: A Graph Fourier Transformmentioning
confidence: 99%
“…The benefits of incorporating network information into signal analysis has been demonstrated in multiple domains. Notable examples of applications include video compression [9], rating predictions in recommendation systems [10], and breast cancer diagnostics [11], and semi-supervised learning [12].…”
Section: Introductionmentioning
confidence: 99%
“…GSP merges algebraic and spectral graph theory with computational harmonic analysis to process such signals on graphs. GSP has resulted in advanced solutions to manifold applications, such as computational science [5], image analysis [6] and recommendation system [7,8]. Moreover, GSP can be used to extend convolutional neural networks (CNNs) to graph data, which is called graph convolutional networks (GCNs) [9].…”
Section: Introductionmentioning
confidence: 99%
“…Similar to classical frequency-domain filtering, GFs manipulate the signal by selectively amplifying or attenuating its graph frequency domain components. GFs have been adopted in applications such as signal analysis [16,17], classification [8,18], reconstruction [10,19], denoising [20,21], clustering [22] and topology identification [23].…”
Section: Introductionmentioning
confidence: 99%