Combining One-Class Classifiers

نویسندگان

  • David M. J. Tax
  • Robert P. W. Duin
چکیده

In the problem of one-class classification target objects should be distinguished from outlier objects. In this problem it is assumed that only information of the target class is available while nothing is known about the outlier class. Like standard two-class classifiers, one-class classifiers hardly ever fit the data distribution perfectly. Using only the best classifier and discarding the classifiers with poorer performance might waste valuable information. To improve performance the results of different classifiers (which may differ in complexity or training algorithm) can be combined. This can not only increase the performance but it can also increase the robustness of the classification. Because for one-class classifiers only information of one of the classes is present, combining one-class classifiers is more difficult. In this paper we investigate if and how one-class classifiers can be combined best in a handwritten digit recognition problem.

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

ثبت نام

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

منابع مشابه

Pruned Random Subspace Method for One-Class Classifiers

The goal of one-class classification is to distinguish the target class from all the other classes using only training data from the target class. Because it is difficult for a single one-class classifier to capture all the characteristics of the target class, combining several one-class classifiers may be required. Previous research has shown that the Random Subspace Method (RSM), in which cla...

متن کامل

Combining One-Class Classifiers for Mobile-User Substitution Detection

Modern personal mobile devices, as mobile phones, smartphones, and communicators can be easily lost or stolen. Due to the functional abilities of these devices, their use by an unintended person may result in a severe security incident concerning private or corporate data and services. The means of user substitution detection are needed to be able to detect situations when a device is used by a...

متن کامل

Game theoretical analysis of combining binary classifiers for multi-class classification problems

Combining binary classifiers for multi-class classification problems has been very popular after the inventions of SVM and ada-boost, which are known to be very effective for binary classification. In this paper, we discuss the methods of combining binary classifiers from the game-theoretical point of view. The problem to duscuss is how the code matrix, which expresses the scheme of dividing an...

متن کامل

Bagging classifiers based on Kernel density estimators

A lot of research is being conducted on combining classification rules (classifiers) to produce a single one, known as an ensemble, which in general is more accurate than the individual classifiers making up the ensemble. Two popular methods for creating ensembles are Bagging introduced by Breiman, (1996) and, AdaBoosting by Freund and Schapire (1996). These methods rely on resampling technique...

متن کامل

Combined Binary Classifiers with Applica

Many applications require classification of examples into one of several classes. A common way of designing such classifiers is to determine the class based on the outputs of several binary classifiers. We consider some of the most popular methods for combining the decisions of the binary classifiers, and improve existing bounds on the error rates of the combined classifier over the training se...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001