期刊文献+

非无限步下波动数学分类问题有限收敛性验证

The Finite Convergence Proof of Infinite Fluctuations on Mathematical Classification Problem
在线阅读 下载PDF
导出
摘要 非无限步下波动数据的数学分类问题是否具有有限收敛性是解决数学问题分类的关键。对该类数学问题进行了建模,验证了非无限步下波动数学分类问题具有可行性和有限收敛性。通过凸优化KKT等价条件,从边缘衰减不能为空、矩阵更新过程中存在正确策略和可逆、波动分类集边缘过程中不会移出集合这3方面对模型的可行性和有限收敛性进行验证。仿真实验对3类实际采集数据集进行模型验证,结果表明模型具有可行性和有限收敛性。 The infinite fluctuations on whether mathematics classification problem has finite convergence is the key to solv-ing math problems. In this paper, the mathematical modeling issues, and to verify the mathematical classification problem of the infinite on volatility has finite convergence. Convex optimization equivalent KKT conditions, and from the edge of the attenuation can't be empty, right exist in the process of matrix updating strategy and reversible, fluctuations in question classification to set the edge process won't be removed from the collection of the three parties face model and the feasibility of the finite convergence for validation. Simulation model validation was carried out on the three kinds of actual data sets, the results show that the model is feasibility and convergence.
作者 吴鹏
出处 《科技通报》 北大核心 2014年第6期7-9,共3页 Bulletin of Science and Technology
基金 四川省科技项目(20114A369)
关键词 非无线步下波动 数字分类 矩阵 有限收敛性 infinite fluctuation mathematics classification matrix finite convergence
  • 相关文献

参考文献3

二级参考文献38

  • 1白林林,严斌宇,罗敬文,苟旭,卢苇.基于节点信任的LEACH协议簇头选举改进算法[J].四川大学学报(工程科学版),2012,44(S1):218-223. 被引量:12
  • 2刘敏华,萧德云.基于相似度的多传感器数据融合[J].控制与决策,2004,19(5):534-537. 被引量:36
  • 3Buyya, R, Yeo, CS, Venugopal, Srikumar. Market-Oriented Cloud Computing.. Vision, Hype, and Reality for Delivering IT Services as Computing Utilities[C]. 10th IEEE International Conference on High Performance Computing and Communications, 2008,9 : 25 - 27.
  • 4Lijun Mei, Chan, W. K. , Tse, T. H. A tale of clouds: paradigm comparisons and some thoughts on research issues[C]. 2008 IEEE Asia-Pacific Services Computing Conference (APSCC 2008), 2008.
  • 5Youseff, L., Butrico, M. , Da Silva, D. Toward a Unified Ontology of Cloud Computing[C]. 2008 Grid Computing Environments Workshop, 2008 : 10.
  • 6Zahariadis T, Vaxevanakis K G, Tsantilas C P. Glob- al romancing in next--Generation networks[J]. IEEE Communications Magazine, 2002, (2) : 145-151.
  • 7Virendra M, Upadhyaya S. Securing information through trust management in wireless networks[C]// Proceedings of Workshop on Secure Knowledge Man- agement (SKM2004). Buffalo:IEEE, 2004: 201-206.
  • 8Hur J,Lee Y,Hong SM,etal. Trust management for resilient wireless sensor networks [C]//Proc of the ICISC 2005, LNCS 3935. Berlin, Heidelberg: Spring- Verlag, 2006 : 56-68.
  • 9Yang Yi,Wang Xinran, Zhu Sencun. SDAP: A secure hop by hop data aggregation protocol for sensor net- works[C]//Proc of the Seventh ACM International Symposium on Mobile Ad Hoc Netuorking and Com- puting. Florence : ACM Press, 2006:356-367.
  • 10Safa H, Artail H, Tabet D. A cluster-based trust- aware routing protocol for mobile Ad Hoc networks [J]. Wireless Networks, 2010,16:969-984.

共引文献102

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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