Distant Transfer Learning via Deep Random Walk

نویسندگان

چکیده

Transfer learning, which is to improve the learning performance in target domain by leveraging useful knowledge from source domain, often requires that those two domains are very close, limits its application scope. Recently, distant transfer has been studied between or even totally unrelated via unlabeled auxiliary act as a bridge spirit of human transitive inference completely concepts can be connected through gradual transfer. In this paper, we study proposing DeEp Random Walk basEd distaNt (DERWENT) method. Different existing models implicitly identify path and instances instances, proposed DERWENT model explicitly learn such paths deep random walk technique. Specifically, based on sequences identified technique data graph where have no direct connection, enforces adjacent points sequence similar, makes ending point represented other same sequence, considers weighted classification losses data. Empirical studies several benchmark datasets demonstrate algorithm yields state-of-the-art performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Active Learning via Random Walk

The basic goal in any classification problem is to identify a decision rule which assigns each test instances into one of the possible classes with a high degree of accuracy. Learning a good classifier requires a sufficient number of labeled training instances. However, the labels are often difficult, expensive or time consuming to obtain, as they may require experienced human annotators, for e...

متن کامل

Multiple-Instance Learning Via Random Walk

This paper presents a decoupled two stage solution to the multiple-instance learning (MIL) problem. With a constructed affinity matrix to reflect the instance relations, a modified Random Walk on a Graph process is applied to infer the positive instances in each positive bag. This process has both a closed form solution and an efficient iterative one. Combined with the Support Vector Machine (S...

متن کامل

Distant Domain Transfer Learning

In this paper, we study a novel transfer learning problem termed Distant Domain Transfer Learning (DDTL). Different from existing transfer learning problems which assume that there is a close relation between the source domain and the target domain, in the DDTL problem, the target domain can be totally different from the source domain. For example, the source domain classifies face images but t...

متن کامل

Quantum Random Walk via Classical Random Walk With Internal States

In recent years quantum random walks have garnered much interest among quantum information researchers. Part of the reason is the prospect that many hard problems can be solved efficiently by employing algorithms based on quantum random walks, in the same way that classical random walks have played a central role in many hugely successful randomized algorithms. In this paper we introduce a new ...

متن کامل

Microblog Sentiment Classification via Recurrent Random Walk Network Learning

Microblog Sentiment Classification (MSC) is a challenging task in microblog mining, arising in many applications such as stock price prediction and crisis management. Currently, most of the existing approaches learn the user sentiment model from their posted tweets in microblogs, which suffer from the insufficiency of discriminative tweet representation. In this paper, we consider the problem o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2021

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v35i12.17248