maximal point coverage by LP
2 views (last 30 days)
Show older comments
Hello,
I have a following problem to solve
given a separating hyperpane wx = 1 (obtained with SVM), and points in lower-left halfspace. I need to find a that covers the hypercube with axis-parallel faces with one vertex lying on hyperplane containing maximal points.
I found linear programming formulation for solving that problem: http://pages.cs.wisc.edu/~gfung/rule_extraction_2005c.pdf here is formulation given in paper min e'y x,y
s.t. wx = 1 A.i- eyi <= xi V i {1, . . . , n}, 0 <=x<= 1, y >=0
but could not convert it to a form acceptable by linprog
Any ideas will be greatly appreciated.
Thanks
0 Comments
Answers (0)
See Also
Categories
Find more on Statistics and Machine Learning Toolbox in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!