Domain Adaptation on Graphs by Learning Aligned Graph Bases

Pilanci M., VURAL E.

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, cilt.34, sa.2, ss.587-600, 2022 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 34 Sayı: 2
  • Basım Tarihi: 2022
  • Doi Numarası: 10.1109/tkde.2020.2984212
  • Dergi Adı: IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Aerospace Database, Applied Science & Technology Source, Business Source Elite, Business Source Premier, Communication Abstracts, Compendex, Computer & Applied Sciences, INSPEC, Metadex, Civil Engineering Abstracts
  • Sayfa Sayıları: ss.587-600
  • Anahtar Kelimeler: Face, Laplace equations, Semisupervised learning, Fourier transforms, Frequency-domain analysis, Manifolds, Social networking (online), Domain adaptation, data classification, graph Fourier transform, graph Laplacian, spectrum transfer, FRAMEWORK, LAPLACIAN, FEATURES, KERNEL
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

A common assumption in semi-supervised learning is that the class label function has a slow variation on the data graph, while in many problems, the label function may vary abruptly in certain graph regions, resulting in high-frequency components. Although semi-supervised learning is an ill-posed problem, it is often possible to find a source graph on which the label function has similar frequency content to the target graph where the actual classification problem is defined. In this paper, we propose a method for domain adaptation on graphs based on learning the spectrum of the label function in a source graph with many labels, and transferring the spectrum information to the target graph. When transferring the frequency content, it is not easy to share graph Fourier coefficients directly between the two independently constructed graphs, since no match exists between their Fourier bases. We solve this by learning a transformation between the Fourier bases of the two graphs that flexibly "aligns" them. The unknown class label function on the target graph is then reconstructed from the learnt spectrum while retaining consistency with the available labels. Comparative experiments suggest that the proposed algorithm often outperforms recent domain adaptation methods in various data classification applications.