期刊文献+

基于三角不等式判定和局部策略的高效邻域覆盖模型

Efficient Neighborhood Covering Model Based on Triangle Inequality Checkand Local Strategy
下载PDF
导出
摘要 邻域覆盖模型由于其原理简单以及对复杂数据具有较好的处理能力,在分类任务中得到了广泛应用。然而,邻域覆盖模型普遍存在运行效率较低的问题,且缺乏相关研究工作。为解决此问题,在传统邻域覆盖模型中引入距离间的三角不等式关系以提升构建邻域的效率,同时引入局部策略,定义了局部邻域覆盖以提升构建邻域覆盖的效率。为提升运行效率,从两个角度对传统邻域覆盖模型进行了改进,提出了基于三角不等式判定和局部策略的邻域覆盖模型(Neighborhood Covering Model based on Triangle Inequality Check and Local Strategy,TI-LNC)。此外,当前基于邻域覆盖模型的分类算法通常仅根据邻域中心以及邻域半径对样本进行分类,缺乏对邻域内样本信息的使用,从而影响了分类精度。为提高邻域覆盖模型的分类精度,增加了对邻域内样本信息的考虑,并基于TI-LNC设计了新的分类算法。在10个UCI数据集上的实验结果表明,所提模型能达到较高的运行效率以及较好的分类精度,具有一定的合理性及有效性。 Neighborhood covering model is widely used in classification tasks for its simple mechanism and ability to handle complex data.However,the neighborhood covering model has the problem of low efficiency and lack of related research work.To solve this problem,triangle inequality between distances is introduced to improve the efficiency of constructing neighborhood.Meanwhile,local neighborhood covering is defined.The local strategy is used to improve the efficiency of constructing neighborhood covering.In summary,to improve the efficiency,traditional neighborhood covering model is improved from two perspectives,and a neighborhood covering model based on triangle inequality check and local strategy(TI-LNC)is proposed.In addition,current classification algorithms based on neighborhood covering models only classify samples based on neighborhood centers and neighborhood radius,and ignore the sample information in neighborhoods,which affects classification accuracy.To improve the classification accuracy of the neighborhood covering model,the consideration of sample information in the neighborhood is added,and a new classification algorithm based on TI-LNC is designed.The experimental results on 10 UCI data sets show that the proposed model which is reasonable and effective can achieve higher efficiency and better classification accuracy.
作者 陈于思 艾志华 张清华 CHEN Yu-si;AI Zhi-hua;ZHANG Qing-hua(Chongqing Key Laboratory of Computational Intelligence,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)
出处 《计算机科学》 CSCD 北大核心 2022年第5期152-158,共7页 Computer Science
基金 国家自然科学基金(61876201)。
关键词 邻域粗糙集 邻域覆盖模型 局部邻域覆盖 三角不等式判定 Neighborhood rough set Neighborhood covering model Local neighborhood covering Triangle inequality check
  • 相关文献

参考文献5

二级参考文献45

  • 1王家耀,张雪萍,周海燕.一个用于空间聚类分析的遗传K-均值算法[J].计算机工程,2006,32(3):188-190. 被引量:19
  • 2文锋,陈宗海,卓睿,周光明.连续状态自适应离散化基于K-均值聚类的强化学习方法[J].控制与决策,2006,21(2):143-147. 被引量:7
  • 3PANG N T,MICHAEL S,VIPIN K.数据挖掘导论(英文版)[M].北京:人民邮电出版社,2006.
  • 4马卫武 李念平 杨志昂.室内空气品质综合评价权重系数的确定与分析.通风除尘,2004,(11):9-11.
  • 5刘金福,于达仁,胡清华,王伟.基于加权粗糙集的代价敏感故障诊断方法[J].中国电机工程学报,2007,27(23):93-99. 被引量:14
  • 6R Gilad-Bachrach Ranb,A Navot,N Tishby.Margin based feature selection-theory and algorithms[A].International Conference on Machine Learning[C].ACM Press,2004.43-50.
  • 7T G Dietterich.An experimental comparison of three methods for constructing ensembles of decision trees:bagging,boosting,and randomization[J].Mach Learn,2000,40:139-157.
  • 8Zhou Z-H,Yu Y.Ensembling local learners through multimodal perturbation[J].IEEE Trans.SMC-Part B:Cybernetics.2005,35:725-735.
  • 9L Breiman.Bagging predictors[J].Machine Learning.1996,24(2):123-140.
  • 10RE Schapire.The strength of weak leamability[J].Machine Learning,1990,5(2):197-227.

共引文献68

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部