• DOI:10.1093/bioinformatics/btl458
• Corpus ID: 495779

Weighted quality estimates in machine learning

@article{Budagyan2006WeightedQE,
  title={Weighted quality estimates in machine learning},
  author={Levon Budagyan and Ruben Abagyan},
  journal={Bioinformatics},
  year={2006},
  volume={22 21},
  pages={
          2597-603
        }
}

• L. Budagyan, R. Abagyan
• Published 1 October 2006
• Computer Science
• Bioinformatics

MOTIVATION
Machine learning methods such as neural networks, support vector machines, and other classification and regression methods rely on iterative optimization of the model quality in the space of the parameters of the method. Model quality measures (accuracies, correlations, etc.) are frequently overly optimistic because the training sets are dominated by particular families and subfamilies. To overcome the bias, the dataset is usually reduced by filtering out closely related objects. However, such filtering uses fixed similarity thresholds and ignores a part of the training information.

RESULTS
We suggested a novel approach to calculate prediction model quality based on assigning to each data point inverse density weights derived from the postulated distance metric. We demonstrated that our new weighted measures estimate the model generalization better and are consistent with the machine learning theory. The Vapnik-Chervonenkis theorem was reformulated and applied to derive the space-uniform error estimates. Two examples were used to illustrate the advantages of the inverse density weighting. First, we demonstrated on a set with a built-in bias that the unweighted cross-validation procedure leads to an overly optimistic quality estimate, while the density-weighted quality estimates are more realistic. Second, an analytical equation for weighted quality estimates was used to derive an SVM model for signal peptide prediction using a full set of known signal peptides, instead of the usual filtered subset.