Takemasa Yamasaki

Learn More
Support vector machines (SVMs) are known to result in a quadratic programming problem, that requires a large computational complexity. To overcome this problem, the authors proposed two incremental SVMs from geometrical point of view in the previous study, both have a linear complexity with respect to the number of examples on average. One method was shown(More)
  • 1