期刊文献+

基于等式约束的高维数据多分类问题的归一化割改进算法

Improved Normalized Cut Algorithm for Multi Classification of High-dimensional Data Based on Equality Constraints
下载PDF
导出
摘要 本文对归一化割(NC, Normalized Cut)进行了改进,在能量泛函中引入了度平衡约束以提高模型的约束能力。经典的NC是实现平衡约束的一种重要方法,通过平衡约束来克服通过最小割算法进行数据分类的平凡解问题。但NC的平衡约束能力是不够的,尤其是当数据集不平衡时,约束能力会进一步下降,以此为基础提出了本文的模型。改进后的模型还可以扩展到解决不平衡的多分类问题。在解决不平衡的二分类和多分类问题时,实验结果表明,本文改进的归一化割方法比原始模型具有更高的分类精度和保持平衡的能力。此外,与原来的归一化割方法相比,在保真度集规模很小的情况下,改进的归一化割模型可以实现有效的数据分类。 In this paper, we improved the normalized cut(NC) method, and the degree balance constraint is introduced into the energy functional to improve the constraint ability of the model. The classical NC method is an important method to realize balance constraint, which overcomes the trivial solution problem of data classification by the minimum cut algorithm. However, the NC balance constraint capacity is not enough, especially when the data set is unbalanced, the constraint ability will decline further. Based on this, the model in this paper is proposed. The improved model can also be extended to solve the unbalanced multi-classification problem. The experimental results show that the improved normalized cut method has higher classification accuracy and balance ability than the original model. In addition,compared with the original normalized cut method, in the case of a very small fidelity set size, the modified Normalized Cut can realize effective classification.
作者 徐止磊 盛夏 潘振宽 Xu Zhilei;Sheng Xia;Pan Zhenkuan(Qingdao University School of Computer Science&Technology,Qingdao 266071,China)
出处 《科学技术创新》 2022年第6期66-73,共8页 Scientific and Technological Innovation
关键词 多分类 等式约束 非局部总变差 归一化割 最小割 Multi-class classification Equality constraint Non-local total variation Normalized Cut Minimum Cut
  • 相关文献

参考文献2

二级参考文献35

  • 1Leonid I.RUDIN,Stanley OSHER,Emad FATEMI.Nonlinear total variation based noise removal algorithms[J].Phys.D,1992,60(1-4):259-268.
  • 2Bing SONG.Topics in Variational PDE Image Segmentation,Inpainting and Denoising[D].USA:University of California Los Angeles,2003.
  • 3Marino BELLONI,Bernd KAWOHL.A direct uniqueness proof for equations involving the p-Laplace operator[J].Manuscripta math,2002,109(2):229-231.
  • 4Bernd KAWOHL.From Mumford-Shah to Perona-Malik in image processing[J].Math.Methods Appl.Sci,2004,27(15):1803-1814.
  • 5Bernd KAWOHL,Jana STARA.Observations on a nonlinear evolution equation[EB/OL].http://www.karlin.mff.cuni.cz/-rokyta/ preprint/2004-pap/2004-139.ps,2004-12-20.
  • 6Guha S,Rastogi R,Shim K.CURE:An Efficient Clustering Algorithm for Large Databases[C].Seattle:Proceedings of the ACM SIGMOD Conference,1998.73-84.
  • 7Guha S,Rastogi R,Shim K.ROCK:A Robust Clustering Algorithm for Categorical Attributes[C].Sydney:Proceedings of the 15th ICDE,1999.512-521.
  • 8Karypis G,Han E-H,Kumar V.CHAMELEON:A Hierarchical Clustering Algorithm Using Dynamic Modeling[J].IEEE Computer,1999,32(8):68-75.
  • 9Ester M,Kriegel H-P,Sander J,et al.A Density-based Algorithm for Discovering Clusters in Large Spatial Databases with Noise[C].Portland:Proceedings of the 2nd ACM SIGKDD,1996.226-231.
  • 10Hinneburg A,Keim D.An Efficient Approach to Clustering Large Multimedia Databases with Noise[C].New York:Proceedings of the 4th ACM SIGKDD,1998.58-65.

共引文献270

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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