A New Sufficient & Necessary Condition for Testing Linear Separability Between Two Sets

被引:1
|
作者
Zhong, Shuiming [1 ]
Lyu, Huan [2 ]
Lu, Xiaoxiang [3 ]
Wang, Baowei [4 ]
Wang, Dingcheng [2 ]
机构
[1] Nanjing Univ Informat Sci & Technol, Engn Res Ctr Digital Forens, Sch Software, Minist Educ, Nanjing 210044, Jiangsu, Peoples R China
[2] Nanjing Univ Informat Sci & Technol, Sch Comp Sci, Nanjing 210044, Jiangsu, Peoples R China
[3] Hohai Univ, Coll Comp & Informat, Nanjing 210098, Jiangsu, Peoples R China
[4] Nanjing Univ Informat Sci & Technol, Engn Res Ctr Digital Forens, Jiangsu Collaborat Innovat Ctr Atmospher Environm, Minist Educ,Sch Comp Sci, Nanjing 210044, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Computational modeling; Support vector machines; Time complexity; Testing; Training; Task analysis; Symbols; Classification; computation geometry; convex analysis; linear separability; sphere model; PERCEPTRON; MODEL;
D O I
10.1109/TPAMI.2024.3356661
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
As a fundamental mathematical problem in the field of machine learning, the linear separability test still lacks a theoretically complete and computationally efficient method. This paper proposes and proves a sufficient and necessary condition for linear separability test based on a sphere model. The advantage of this test method is two-fold: (1) it provides not only a qualitative test of linear separability but also a quantitative analysis of the separability of linear separable instances; (2) it has low time cost and is more efficient than existing test methods. The proposed method is validated through a large number of experiments on benchmark datasets and artificial datasets, demonstrating both its correctness and efficiency.
引用
收藏
页码:4160 / 4173
页数:14
相关论文
共 50 条