Graph domain adaptation with localized graph signal representations

Date

2024-11-01

Author

Pilavcı, Yusuf Yiğit
Güneyi, Eylem Tuğçe
Cengiz, Cemil
Vural, Elif

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

871
views

34
downloads

Cite This

In this paper we propose a domain adaptation algorithm designed for graph domains. Given a source graph with many labeled nodes and a target graph with few or no labeled nodes, we aim to estimate the target labels by making use of the similarity between the characteristics of the variation of the label functions on the two graphs. Our assumption about the source and the target domains is that the local behavior of the label function, such as its spread and speed of variation on the graph, bears resemblance between the two graphs. We estimate the unknown target labels by solving an optimization problem where the label information is transferred from the source graph to the target graph based on the prior that the projections of the label functions onto localized graph bases be similar between the source and the target graphs. In order to efficiently capture the local variation of the label functions on the graphs, spectral graph wavelets are used as the graph bases. Experimentation on various data sets shows that the proposed method yields quite satisfactory classification accuracy compared to reference domain adaptation methods.

Subject Keywords

Domain adaptation, Graph Laplacian, Graph signal processing, Spectral graph theory, Spectral graph wavelets

URI

https://hdl.handle.net/11511/110027

Collections

Department of Electrical and Electronics Engineering, Article