In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
We study hierarchical classification in the general case when an instance could belong to more than one class node in the underlying taxonomy. Experiments done in previous work sh...
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
Simon Colton, Andreas Meier, Volker Sorge, Roy L. ...
Automated static analysis can identify potential source code anomalies early in the software process that could lead to field failures. However, only a small portion of static ana...
Training a good text detector requires a large amount of labeled data, which can be very expensive to obtain. Cotraining has been shown to be a powerful semi-supervised learning t...