摘要

Branch and bound semi-supervised support vector machines as an exact globally optimization is useful for benchmarking practical semi-supervised support vector machines implementations. An improved learning algorithm for branch and bound for semi-supervised support vector machines is presented, concerning the defects of the branch and bound for semi-supervised support vector machines. The estimations of the node lower bound are redefined, which can reduce time complexity of computing the lower bound on every node. Branching nodes are determined by using the geometric characteristic of the support vector machines, which can improve the operation speed simultaneously. Experimental results show that modified algorithm has high precision and strong robustness.

全文