Standard classification algorithms aim to minimize the probability of making an incorrect classification. In many important applications, however, some kinds of errors are more important than others. In this report we review cost-sensitive extensions of standard support vector machines (SVMs). In particular, we describe cost-sensitive extensions of the C-SVM and the ν-SVM, which we denote the 2...

Since their introduction, ranking SVM models [11] have become a powerful tool for training content-based retrieval systems. All we need for training a model are retrieval examples in the form of triplet constraints, i.e. examples specifying that relative to some query, a database item a should be ranked higher than database item b. These types of constraints could be obtained from feedback of u...

In recent years, the algorithms of learning to rank have been proposed by researchers. However, in information retrieval, instances of ranks are imbalanced. After the instances of ranks are composed to pairs, the pairs of ranks are imbalanced too. In this paper, a cost-sensitive risk minimum model of pairwise learning to rank imbalanced data sets is proposed. Following this model, the algorithm...

Most algorithms of support vector machines (SVMs) operate in a batch mode. However, when the samples arrive sequentially, batch implementations of SVMs are computationally demanding due to the fact that they must be retrained from scratch. This paper proposes an incremental SVM algorithm that is suitable for the problems of sequentially arriving samples. Unlike previous SVM techniques, this new...

Support Vector Machines(SVMs) have been extensively researched in the data mining and machine learning communities for the last decade and actively applied to applications in various domains. SVMs are typically used for learning classification, regression, or ranking functions, for which they are called classifying SVM, support vector regression (SVR), or ranking SVM (or RankSVM) respectively. ...

The information on the World Wide Web is growing without bound. Users may have very diversified preferences in the pages they target through a search engine. It is therefore a challenging task to adapt a search engine to suit the needs of a particular community of users who share similar interests. In this paper, we propose a new algorithm, Ranking SVM in a Co-training Framework (RSCF). Essenti...

Two parameters, C and r, must be carefully predetermined in establishing an efficient support vector machine (SVM) model. Therefore, the purpose of this study is to develop a genetic-based SVM (GA-SVM) model that can automatically determine the optimal parameters, C and r, of SVM with the highest predictive accuracy and generalization ability simultaneously. This paper pioneered on employing a ...

In this paper Self-Advising SVM, a new proposed version of SVM, is investigated for sleep apnea classification. Self-Advising SVM tries to transfer more information from training phase to the test phase in compare to the traditional SVM. In this paper Sleep apnea events are classified to central, obstructive or mixed, by using just three signals, airflow, abdominal and thoracic movement, as inp...

user-generated medical messages on internet contain extensive information related to adverse drug reactions (adrs) and are known as valuable resources for post-marketing drug surveillance. the aim of this study was to find an effective method to identify messages related to adrs automatically from online user reviews.we conducted experiments on online user reviews using different feature set an...