Search Results for author:
Found 2 papers, 0 papers with code
Best Complete Approximations of Preference Relations
We investigate the problem of approximating an incomplete preference relation $\succsim$ on a finite set by a complete preference relation.
APAC: Augmented PAttern Classification with Neural Networks
Our method is named as APAC: the Augmented PAttern Classification, which is a way of classification using the optimal decision rule for augmented data learning.
Ranked #7 on
Image Classification
on MNIST
Cannot find the paper you are looking for? You can
Submit a new open access paper.
