Domain Adaptation on Graphs via Frequency Analysis

Date

2019-08-22

Author

Pilancı, Mehmet
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

226
views

0
downloads

Classical machine learning algorithms assume the training and test data to be sampled from the same distribution, while this assumption may be violated in practice. Domain adaptation methods aim to exploit the information available in a source domain in order to improve the performance of classification in a target domain. In this work, we focus on the problem of domain adaptation in graph settings. We consider a source graph with many labeled nodes and aim to estimate the class labels on a target graph with few labeled nodes. Our main assumption about the relation between the two graphs is that the frequency content of the label function has similar characteristics. Building on the recent advances in frequency analysis on graphs, we propose a novel graph domain adaptation algorithm. Experiments on image data sets show that the proposed method performs successfully.

Subject Keywords

Domain adaptation, Data classification, Graph Fourier transform, Graph Laplacian, Frequency analysis

URI

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

DOI

https://doi.org/10.1109/siu.2019.8806414

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

DOMAIN ADAPTATION VIA TRANSFERRING SPECTRAL PROPERTIES OF LABEL FUNCTIONS ON GRAPHS Pilanci, Mehmet; Vural, Elif (2016-07-12) We propose a domain adaptation algorithm that relies on a graph representation of data samples in the source and target domains. The algorithm combines the information of the known class labels in the source and target domains through the Fourier coefficients of the class label function in the two graphs. The proposed method does not require an ordering or a one-to-one mapping between the samples of the source and target domains; instead, it uses only a small set of matched pairs that serve the purpose of "...
Domain Adaptation with Nonparametric Projections Vural, Elif (2019-08-22) Domain adaptation algorithms focus on a setting where the training and test data are sampled from related but different distributions. Various domain adaptation methods aim to align the source and target domains in a new common domain by learning a transformation or projection. In this work, we learn a nonlinear and nonparametric projection of the source and target domains into a common domain along with a linear classifier in the new domain. Experiments on image data sets show that the proposed nonlinear a...
Domain adaptation on graphs by learning graph topologies: theoretical analysis and an algorithm Vural, Elif (The Scientific and Technological Research Council of Turkey, 2019-01-01) Traditional machine learning algorithms assume that the training and test data have the same distribution, while this assumption does not necessarily hold in real applications. Domain adaptation methods take into account the deviations in data distribution. In this work, we study the problem of domain adaptation on graphs. We consider a source graph and a target graph constructed with samples drawn from data manifolds. We study the problem of estimating the unknown class labels on the target graph using the...
MODELLING OF KERNEL MACHINES BY INFINITE AND SEMI-INFINITE PROGRAMMING Ozogur-Akyuz, S.; Weber, Gerhard Wilhelm (2009-06-03) In Machine Learning (ML) algorithms, one of the crucial issues is the representation of the data. As the data become heterogeneous and large-scale, single kernel methods become insufficient to classify nonlinear data. The finite combinations of kernels are limited up to a finite choice. In order to overcome this discrepancy, we propose a novel method of "infinite" kernel combinations for learning problems with the help of infinite and semi-infinite programming regarding all elements in kernel space. Looking...
On numerical optimization theory of infinite kernel learning Ozogur-Akyuz, S.; Weber, Gerhard Wilhelm (2010-10-01) In Machine Learning algorithms, one of the crucial issues is the representation of the data. As the given data source become heterogeneous and the data are large-scale, multiple kernel methods help to classify "nonlinear data". Nevertheless, the finite combinations of kernels are limited up to a finite choice. In order to overcome this discrepancy, a novel method of "infinite" kernel combinations is proposed with the help of infinite and semi-infinite programming regarding all elements in kernel space. Look...

Citation Formats

M. Pilancı and E. Vural, “Domain Adaptation on Graphs via Frequency Analysis,” 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/48969.