Joint Structure Feature Exploration and Regularization for Multi-Task Graph Classification

نویسندگان
چکیده

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

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

منابع مشابه

Multi-Task Model and Feature Joint Learning

Given several tasks, multi-task learning (MTL) learns multiple tasks jointly by exploring the interdependence between them. The basic assumption in MTL is that those tasks are indeed related. Existing MTL methods model the task relatedness/interdependence in two different ways, either common parameter-sharing or common featuresharing across tasks. In this paper, we propose a novel multi-task le...

متن کامل

An Efficient Gabor Feature-Based Multi-task Joint Support Vector Machines Framework for Hyperspectral Image Classification

In this paper, a novel multi-task learning (MTL) framework for a series of Gabor features via joint probabilistic outputs of support vector machines (SVM), abbreviated as GF-MTJSVM, has been proposed for Hyperspectral image (HSI) classification. Specifically, we firstly use a series of Gabor wavelet filters with different scales and frequencies to extract spectral-spatial-combined features from...

متن کامل

A Spectral Regularization Framework for Multi-Task Structure Learning

Learning the common structure shared by a set of supervised tasks is an important practical and theoretical problem. Knowledge of this structure may lead to better generalization performance on the tasks and may also facilitate learning new tasks. We propose a framework for solving this problem, which is based on regularization with spectral functions of matrices. This class of regularization p...

متن کامل

Distributed Stochastic Multi-Task Learning with Graph Regularization

We propose methods for distributed graph-based multi-task learning that are based on weighted averaging of messages from other machines. Uniform averaging or diminishing stepsize in these methods would yield consensus (single task) learning. We show how simply skewing the averaging weights or controlling the stepsize allows learning different, but related, tasks on the different machines.

متن کامل

Probabilistic Joint Feature Selection for Multi-task Learning

We study the joint feature selection problem when learning multiple related classification or regression tasks. By imposing an automatic relevance determination prior on the hypothesis classes associated with each of the tasks and regularizing the variance of the hypothesis parameters, similar feature patterns across different tasks are encouraged and features that are relevant to all (or most)...

متن کامل

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


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

ژورنال

عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering

سال: 2016

ISSN: 1041-4347

DOI: 10.1109/tkde.2015.2492567