关于Furniture超平面问题和最大间隔聚类
On the Furthest Hyperplane Problem and Maximal Margin Clustering
摘要:
本文介绍了一种无监督的支持向量机的对应算法--Furmart-Hyperplane问题。给定Rd中的一组n个点,目标是产生使分离裕度最大化的超平面(通过原点),即超平面与任何输入点之间的最小距离。据我们所知,这是第一篇关于FHP的论文。我们提供的下限和上限,这个NP难问题。首先,我们给出了一个简单的随机算法,其运行时间为n^O(1/θ^2),其中θ是最优分离间隔。我们证明了它对1/θ^2的指数依赖性是紧的,直到次多项式因子,假设SAT不能在次指数时间内求解。其次,我们给出了一个有效的近似算法。对于任何α \in [0,1],算法产生一个超平面,该超平面到至少1 - 5α分数的点的距离至少是最佳分离裕度的α倍。最后,我们表明,FHP不承认PTAS提出了一个间隙保持减少从一个特定版本的PCP定理。
英文摘要:
This paper introduces the Furthest Hyperplane Problem (FHP), which is an unsupervised counterpart of Support Vector Machines. Given a set of n points in Rd, the objective is to produce the hyperplane (passing through the origin) which maximizes the separation margin, that is, the minimal distance between the hyperplane and any input point. To the best of our knowledge, this is the first paper achieving provable results regarding FHP. We provide both lower and upper bounds to this NP-hard problem. First, we give a simple randomized algorithm whose running time is n^O(1/θ^2) where θ is the optimal separation margin. We show that its exponential dependency on 1/θ^2 is tight, up to sub-polynomial factors, assuming SAT cannot be solved in sub-exponential time. Next, we give an efficient approxima- tion algorithm. For any α \in [0, 1], the algorithm produces a hyperplane whose distance from at least 1 - 5α fraction of the points is at least α times the optimal separation margin. Finally, we show that FHP does not admit a PTAS by presenting a gap preserving reduction from a particular version of the PCP theorem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。