R. Bennett and E.J. Bredensteiner, Geometry in learning, Tech. Report, Department of Mathematical Sciences, Rennselaer Polytechnic Institute, New York, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....v ) is a pair of closest points of U and V . Note that w = ffi(u Gamma v ) for ffi chosen such that ku Gamma v k = 2=kw k. A direct, geometrically intuitive proof is given by Sancheti and Keerthi[22] with reference to a geometrical problem in Robotics. Later, Bennett[3] proved a somewhat close result in the context of learning algorithms. Here we only give a discussion that follows the traditional Wolfe Dual approach employed in the SVM literature. The main reason for doing this is to show the relationships of NPP and the variables in it with the Wolfe Dual of ....

R. Bennett and E.J. Bredensteiner, Geometry in learning, Tech. Report, Department of Mathematical Sciences, Rennselaer Polytechnic Institute, New York, 1996.

....Theorem 1. w ; b ) solves SVM NV if and only if there exist u 2 U and v 2 V such that (u ; v ) solves NPP and (3) holds. 2 A direct, geometrically intuitive proof is given by Sancheti and Keerthi[20] with reference to a geometrical problem in Robotics. Later, Bennett[2] proved a somewhat close result in the context of learning algorithms. Here we only give a discussion that follows the traditional Wolfe Dual approach employed in the SVM literature. The main reason for doing this is to show the relationships of NPP and the variables in it with the Wolfe Dual of ....

R. Bennett and E.J. Bredensteiner, Geometry in learning, Tech. Report, Department of Mathematical Sciences, Rennselaer Polytechnic Institute, New York, 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC