Naiwen Liu

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Sorry, we do not have enough data to show an influence graph for this author.
Learn More
In this paper, the authors present a greedy search algorithm that solves the SVM classification (SVC) problem at the lowermost C end. By combining the SVC asymptotic behavior with empirical results, it can be sure that at sufficiently small cost, a threshold C0, all the minority samples becomes support vectors each with Lagrange multiplier C0, and equal(More)
  • 1