Классификация ережелері мен бинарлық жіктеу әдістері

Given a population whose members each belong to one of a number of different sets or classes, a classification rule or classifier is a procedure by which the elements of the population set are each predicted to belong to one of the classes. A perfect classification is one for which every element in the population is assigned to the class it really belongs to. The bayes classifier is the classifier which assigns classes optimally based on the known attributes (i. e. features or regressors) of the elements to be classified. A special kind of classification rule is binary classification, for problems in which there are only two classes.

Given a data set consisting of pairs x and y, where x denotes an element of the population and y the class it belongs to, a classification rule h(x) is a function that assigns each element x to a predicted class A binary classification is such that the label y can take only one of two values. The true labels yi can be known but will not necessarily match their approximations In a binary classification, the elements that are not correctly classified are named false positives and false negatives. Some classification rules are static functions. Others can be computer programs. A computer classifier can be able to learn or can implement static classification rules. For a training data set, the true labels yj are unknown, but it is a prime target for the classification procedure that the approximation as well as possible, where the quality of this approximation needs to be judged on the basis of the statistical or probabilistic properties of the overall population from which future observations will be drawn. Given a classification rule, a classification test is the result of applying the rule to a finite sample of the initial data set.

Classification can be thought of as two separate problems – binary classification and multiclass classification. In binary classification, a better understood task, only two classes are involved, whereas multiclass classification involves assigning an object to one of several classes. Since many classification methods have been developed specifically for binary classification, multiclass classification often requires the combined use of multiple binary classifiers. An important point is that in many practical binary classification problems, the two groups are not symmetric – rather than overall accuracy, the relative proportion of different types of errors is of interest. For example, in medical testing, a false positive (detecting a disease when it is not present) is considered differently from a false negative (not detecting a disease when it is present). In multiclass classifications, the classes may be considered symmetrically (all errors are equivalent), or asymmetrically, which is considerably more complicated. Binary classification methods include probit regression and logistic regression. Multiclass classification methods include multinomial probit and multinomial logit.

False positives result when a test falsely (incorrectly) reports a positive result. For example, a medical test for a disease may return a positive result indicating that the patient has the disease even if the patient does not have the disease. False positive is commonly denoted as the top right (Condition negative X test outcome positive) unit in a Confusion matrix.

On the other hand, false negatives result when a test falsely or incorrectly reports a negative result. For example, a medical test for a disease may return a negative result indicating that patient does not have a disease even though the patient actually has the disease. False negative is commonly denoted as the bottom left (Condition positive X test outcome negative) unit in a Confusion matrix.

True positives result when a test correctly reports a positive result. As an example, a medical test for a disease may return a positive result indicating that the patient has the disease. This is shown to be true when the patient test confirms the existence of the disease. True positive is commonly denoted as the top left (Condition positive X test outcome positive) unit in a Confusion matrix.

True negative result when a test correctly reports a negative result. As an example, a medical test for a disease may return a positive result indicating that the patient does not have the disease. This is shown to be true when the patients test also reports not having the disease. True negative is commonly denoted as the bottom right (Condition negative X test outcome negative) unit in a Confusion matrix.

We can use Bayes' theorem to determine the probability that a positive result is in fact a false positive. We find that if a disease is rare, then the majority of positive results may be false positives, even if the test is relatively accurate. Naively, one might think that only 5% of positive test results are false, but that is quite wrong, as we shall see. Suppose that only 0.1% of the population has that disease, so that a randomly selected patient has a 0.001 prior probability of having the disease. We can use Bayes' theorem to calculate the probability that a positive test result is a false positive. and hence the probability that a positive result is a false positive is about 1 − 0.019 = 0.98, or 98%. Despite the apparent high accuracy of the test, the incidence of the disease is so low that the vast majority of patients who test positive do not have the disease. Nonetheless, the fraction of patients who test positive who do have the disease (0.019) is 19 times the fraction of people who have not yet taken the test who have the disease (0.001). Thus the test is not useless, and re testing may improve the reliability of the result. In order to reduce the problem of false positives, a test should be very accurate in reporting a negative result when the patient does not have the disease. If the test reported a negative result in patients without the disease with probability 0.999, then

so that 1 − 0.5 = 0.5 now is the probability of a false positive.

We can also use Bayes' theorem to calculate the probability of true negative. Using the examples above:

If a tested patient has the disease, the test returns a positive result 99% of the time, or with a probability of 0.99. The probability that a negative result is a true negative is 0.9999494 or 99.99%. Since the disease is rare and the positive to positive rate is high and the negative to negative rate is also high, this will produce a large True Negative rate.

In training a classifier, one may wish to measure its performance using the well accepted metrics of sensitivity and specificity. It may be instructive to compare the classifier to a random classifier that flips a coin based on the prevalence of a disease. Suppose that the probability a person has the disease is and the probability that they do not is Suppose then that we have a random classifier that guesses that the patient has the disease with that same probability and guesses that he does not with the same probability
The probability of a true positive is the probability that the patient has the disease times the probability that the random classifier guesses this correctly, or With similar reasoning, the probability of a false negative is From the definitions above, the sensitivity of this classifier is With similar reasoning, we can calculate the specificity as
So, while the measure itself is independent of disease prevalence, the performance of this random classifier depends on disease prevalence. The classifier may have performance that is like this random classifier, but with a better weighted coin (higher sensitivity and specificity). So, these measures may be influenced by disease prevalence. An alternative measure of performance is the Matthews correlation coefficient, for which any random classifier will get an average score of 0. The extension of this concept to non binary classifications yields the confusion matrix.