期刊文献+

内P-集合与F-优化数据-筛选 被引量:2

Internal P-Set and Selection of F-Optimized Data
下载PDF
导出
摘要 应用内P-集合的内-动态特性及其结构,提出了F-优化数据概念,讨论F-优化数据的生成与筛选,获得F-优化数据-筛选定理及F-优化数据的生成-筛选算法,并给出F-优化数据-筛选的应用.研究结果为动态信息系统的数据优化提供了一种新方法. The process of optimizing and selection for plant varieties has the internal dynamic characteristic.The concept of F-optimized data is proposed by using the internal dynamic characteristic and the structure on the internal P-set.The paper discusses chiefly the generation and the selection of F-optimized data.Meanwhile,the theorem of selection and the algorithm of generation and selection for F-optimized data are obtained.Finally,the paper gives the application about F-optimized data.The results provide a new method for optimizing data in dynamic information.
出处 《河南大学学报(自然科学版)》 CAS 北大核心 2013年第3期232-236,共5页 Journal of Henan University:Natural Science
基金 贵州省科技厅 安顺市人民政府 安顺学院联合基金项目(黔科合丁字LKA[2012]11号)
关键词 内p-集合 F-优化数据 粒度 F-优化度 筛选 internal P-set F-optimized data granulation degree F-optimizing degree selection
  • 相关文献

参考文献16

二级参考文献86

  • 1李豫颖.F-畸变数据的生成与修复[J].吉首大学学报(自然科学版),2010,31(3):59-63. 被引量:9
  • 2SHI Kaiquan. S-rough sets and its applications in diagnosis-recognition for disease[J]. IEEE Proceedings of the First International Conference on Machine Learning and Cybernetics, 2002, 1 (1) : 50-54
  • 3SHI Kaiquan, CUI Yuquan. F-decomposition and F-reduction of S-rough sets[J]. An International Journal Advances in Systems Science and Applications, 2004, 4(4):487-499.
  • 4SHI Kaiquan, CHANG Tingchen, One direction S-rough sets[J]. International Journal of Fuzzy Mathematics, 2005, 13(2) : 319-334.
  • 5SHI Kaicluan. Two direction S-rough sets[J]. International Journal of Fuzzy Mathematics, 2005, 13(2) : 335-349.
  • 6史开泉,姚炳学.函数S-粗集与规律挖掘[M].北京:科学出版社,2007.147-198.
  • 7PAWLAK Z. Rough sets[J]. International Journal of Computer and Information Sciences, 1982, 32(11): 341-356.
  • 8LEE J T, ANTI-ION Y. Mining spatial association rules in image data bases[J]. Information Sciences, 2007, 117(7):1593-1608.
  • 9LIN Mingyen. Fast discovery of sequential patterns in large database using effective time-indexing[J]. Information Sciences, 2008, 178 (22) : 4228-4245.
  • 10KIM S W. Privacy preserving data mining of sequential patterns for network traffic data[J]. Information Sciences, 2008, 178(3):694-713.

共引文献233

同被引文献12

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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