PSVM: a preference-enhanced SVM model using preference data for classification

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

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Prediction of Protein Backbone Structure by Preference Classification with SVM

Given the primary sequence of a protein and its α-carbon coordinates, the allatom protein backbone reconstruction problem (PBRP) is to reconstruct the 3D coordinates of all atoms, including N, C, and O atoms on the backbone. A variety of methods for solving PBRP have been proposed, such as Adcock’s method, SABBAC, BBQ, and Chang’s methods. In this paper, we involve BBQ (Backbone Building from Q...

متن کامل

A Model For Preference

In this paper we address the problem of choosing the best solution(s) from a set of interpretations of the same object (in our case a segment of text). A notion of preference is stated, based on pairwise comparisons of complete interpretations in order to obtain a partial order among the competing interpretations. An experimental implementation is described, which uses Prolog-like preference st...

متن کامل

Personalized Queries Using a Generalized Preference Model

Due to the growing size of the Web, exploiting user preferences and user profiles to provide personalized information access is becoming an increasingly important issue. Many web sites are supported by underlying database systems; hence there is a growing need for supporting personalization in this context as well. In this paper, we present a generalized model of user preferences for database i...

متن کامل

Learning from Pairwise Preference Data using Gaussian Mixture Model

In this paper we propose a fast online preference learning algorithm capable of utilizing incomplete preference information. It is based on a Gaussian mixture model that learns soft pairwise label preferences via minimization of the proposed soft rank loss measure. Standard supervised learning techniques, such as gradient descent or Expectation Maximization can be used to find the unknown model...

متن کامل

A Preference-Aware Query Model for Data Web Services

Data Mashup is a special class of applications mashup that combines data elements from multiple data sources (that are often exported as data web services) to respond to transient business needs on the fly. In this paper, we propose a semantic model for data services along with a declarative approach for creating data mashups without any programming involved. Given a query formulated over domai...

متن کامل

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


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

ژورنال

عنوان ژورنال: Science China Information Sciences

سال: 2017

ISSN: 1674-733X,1869-1919

DOI: 10.1007/s11432-016-9020-4