Method and system for classification in imbalanced datasets within a supervised classification framework. Bootstrap methodology is modified according to k-Nearest Neighbor sampling weights and adaptive target set size principle, to induce weak classifiers from the bootstrap samples in an iterative procedure that results in a set of weak classifiers. A weighted combination scheme is used to adaptively combine the weak classifiers to a strong classifier that achieves good performance for all classes (reflected as high values for metrics such as G-mean and F-score) as well as good overall accuracy.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A method for performing classification in an imbalanced dataset containing a plurality of majority class instances and a plurality of minority class instances, the method comprising: training, by a data processor, a classifier on the imbalanced dataset; estimating, by the data processor, an accuracy ACC for the classifier; sampling, by the data processor, the plurality of majority class instances: iterating, by the data processor, a predetermined number of times, during an iteration of which the data processor performs: sampling to obtain a sample containing a plurality of majority class instances according to k-Nearest Neighbor weighting so that the ratio of a number of minority class instances to a number of majority class instances in the sample equals a predetermined ratio by computation on a previous iteration; training a weak classifier on the sample obtained during the iteration; and computing a ratio of a number of minority class instances to a number of majority class instances for a subsequent iteration; and combining, by the data processor, a plurality of weak classifiers from a plurality of iterations into an ensemble aggregation corresponding to a strong classifier, wherein the combining is according to respective weights based on a function of accuracies of the weak classifiers. 2. The method of claim 1, wherein the sampling is done with replacement. 3. The method of claim 1, wherein the number of times for the iterating is predetermined according to a constraint on an upper bound of a standard deviation of a geometric mean of a final result of the iterating. 4. The method of claim 1, wherein, for the first iteration, the ratio of the number of minority class instances to the number of majority class instances in the sample equals 1. 5. The method of claim 1, wherein, for a subsequent iteration, the ratio of the number of minority class instances to the number of majority class instances is a function having the corresponding ratio of the present iteration as an argument. 6. The method of claim 1, wherein, for a subsequent iteration, the ratio of the number of minority class instances to the number of majority class instances is a function having a random number as an argument. 7. The method of claim 1, wherein, for a subsequent iteration, the ratio of the number of minority class instances to the number of majority class instances is a function having the accuracy ACC as an argument. 8. A system for performing classification in an imbalanced dataset containing a plurality of majority class instances and a plurality of minority class instances, the system comprising: a data processor; and a non-transitory storage device connected to the data processor, for storing executable instruction code, which executable instructions, when executed by the data processor, cause the processor to perform: training a classifier on the imbalanced dataset; estimating an accuracy ACC for the classifier; sampling the plurality of majority class instances; iterating a predetermined number of times, during an iteration of which: sampling to obtain a sample containing a plurality of majority class instances according to k-Nearest Neighbor weighting so that the ratio of a number of minority class instances to a number of majority class instances in the sample equals a predetermined ratio by computation on a previous iteration; training a weak classifier on the sample obtained during the iteration; and computing a ratio of a number of minority class instances to a number of majority class instances for a subsequent iteration; and combining a plurality of weak classifiers from a plurality of iterations into an ensemble aggregation corresponding to a strong classifier, wherein the combining is according to respective weights based on a function of accuracies of the weak classifiers. 9. A computer data product for performing classification in an imbalanced dataset containing a plurality of majority class instances and a plurality of minority class instances, the computer data product comprising non-transitory data storage containing executable instruction code, which executable instructions, when executed by a data processor, cause the processor to perform: training a classifier on the imbalanced dataset: estimating an accuracy ACC for the classifier; sampling the plurality of majority class instances; iterating a predetermined number of times, during an iteration of which: sampling to obtain a sample containing a plurality of majority class instances according to k-Nearest Neighbor weighting so that the ratio of a number of minority class instances to a number of majority class instances in the sample equals a predetermined ratio by computation on a previous iteration; training a weak classifier on the sample obtained during the iteration; and computing a ratio of a number of minority class instances to a number of majority class instances for a subsequent iteration; and combining a plurality of weak classifiers from a plurality of iterations into an ensemble aggregation corresponding to a strong classifier, wherein the combining is according to respective weights based on a function of accuracies of the weak classifiers.