Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Graph domain adaptation with localized graph signal representations
Download
index.pdf
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
865
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
Journal
Pattern Recognition
DOI
https://doi.org/10.1016/j.patcog.2024.110628
Collections
Department of Electrical and Electronics Engineering, Article
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
Y. Y. Pilavcı, E. T. Güneyi, C. Cengiz, and E. Vural, “Graph domain adaptation with localized graph signal representations,”
Pattern Recognition
, vol. 155, pp. 0–0, 2024, Accessed: 00, 2024. [Online]. Available: https://hdl.handle.net/11511/110027.