期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

P-集合与数据内搜索-应用 被引量：7

P-sets and Data Internal Search-application
在线阅读 下载PDF
导出
摘要 P-集合是把动态特性引入到有限普通集合中,改进普通集合得到的。P-集合是由内P-集合XF-(internalpacket setsXF-)与外P-集合XF(outer packet setsXF)构成的集合对,或者(XF-,XF)是P-集合。利用内P-集合,给出数据内搜索的概念,给出F-数据的度量和依赖关系,给出F-数据内搜索迭代算法和准则,给出数据内搜索的应用。P-集合是研究动态信息系统的一个新理论与新方法。 Introduced by dynamic characteristics,P-sets can be obtained from the improved finite general sets.P-sets are a set pair which are composed of internal P-sets X and outer P-sets XF,or（X,XF） is P-sets.By using P-sets,the concept of data internal search,the measure and dependence relation about-data were given,search iterative algorithm and criterion of-data were proposed,finally the applications of data internal search were given.P-sets is a new theory and method to study dynamic information system.
作者 谢维奇 于秀清
机构地区 驻马店职业技术学院信息工程系 山东大学数学与系统科学学院 德州学院数学系
出处 《计算机科学》 CSCD 北大核心 2011年第1期236-239,共4页 Computer Science
基金 山东省自然科学基金资助项目(Y2007H02)资助
关键词 P-集合 ■-数据 数据内搜索 依赖-内搜索准则 应用 P-sets ■-data Data internal search Dependence-internal search criterion Applications
分类号 O144 [理学—基础数学]
  • 相关文献

参考文献10

  • 1Shi Kaiquan. P sets and its applications [J].An International Advances in Systems Science and Applications, 2009,9(2):209- 219.
  • 2史开泉.P-集合[J].山东大学学报（理学版）,2008,43(11):77-84. 被引量：218
  • 3史开泉,张丽.内P-集合与数据外-恢复[J].山东大学学报（理学版）,2009,44(4):8-14. 被引量：110
  • 4汤积华,陈保会,史开泉.P-集合与(,F)-数据生成-辨识[J].山东大学学报（理学版）,2009,44(11):83-88. 被引量：83
  • 5于秀清.P-集合的识别与筛选[J].山东大学学报（理学版）,2010,45(1):94-98. 被引量：61
  • 6张飞,陈萍,张丽.P-集合的P-分离与应用[J].山东大学学报（理学版）,2010,45(3):71-75. 被引量：53
  • 7Shi Kaiquan, LI Xiuhong. Camouflaged informatiation and its on identification and its applications[J]. An International Journal Advances in System Science and Applications,2010,10(2) : 208- 216.
  • 8Zhang li, Cui Yuquan. Outer P-sets and data internal-recover [J].An International Journal Advances in System Science and Applications,2010,10(2) :229- 236.
  • 9Lin Hong-kang, Li Yu-ying. P sets and its P-separation theorems[J]. An International Journal Advances in System Science and Applications, 2010,10(2) : 245-251.
  • 10Zhang Guan yu, LI En-zhong. Information gene and its information knock-out/knock-in[J].An International Journal Advances in System Science and Applications, 2010, 10 (2) : 267-27.

二级参考文献35

  • 1SHI 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
  • 2SHI 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.
  • 3SHI Kaiquan, CHANG Tingchen, One direction S-rough sets[J]. International Journal of Fuzzy Mathematics, 2005, 13(2) : 319-334.
  • 4SHI Kaicluan. Two direction S-rough sets[J]. International Journal of Fuzzy Mathematics, 2005, 13(2) : 335-349.
  • 5史开泉,姚炳学.函数S-粗集与规律挖掘[M].北京:科学出版社,2007.147-198.
  • 6PAWLAK Z. Rough sets[J]. International Journal of Computer and Information Sciences, 1982, 32(11): 341-356.
  • 7LEE J T, ANTI-ION Y. Mining spatial association rules in image data bases[J]. Information Sciences, 2007, 117(7):1593-1608.
  • 8LIN Mingyen. Fast discovery of sequential patterns in large database using effective time-indexing[J]. Information Sciences, 2008, 178 (22) : 4228-4245.
  • 9KIM S W. Privacy preserving data mining of sequential patterns for network traffic data[J]. Information Sciences, 2008, 178(3):694-713.
  • 10SHI Kaiquan. P-sets and its apphcatiom[J]. An International Journal Advances in Systems Science and Apphcations, 2009, 9(2):168-178.

共引文献224

同被引文献58

  • 1Yiyu,（Y.Y.）,Yao.Three Perspectives of Granular Computing[J].南昌工程学院学报,2006,25(2):16-21. 被引量：19
  • 2BEMERS-LEE T, HENDLER J, LASSILA O. The semantic Web [ J ]. Scientific American ,2001 (5) :279-285 .
  • 3HENDLER J. Ontologies on the semantic Web[ J]. IEEE Intelligent Systems,2002,17 (2) :73-74.
  • 4MCGUINNESS D L, Van HARMELEN F. OWL Web ontology language overview [ EB/OL]. ( 2004- 02 ). http://www, w3. org/TR/ 2004/REC -owl-features-20040210/.
  • 5WILLE R. Restructuring lattice theory:an approach based on hierarchies of concepts [ C]//Proc of the 7th International Conference on Formal Concept Analysis. Berlin : Springer-Verlag,2009:314- 339.
  • 6GANTER B, WILLE R. Formal concept analysis : mathematical foundations [ M ]. Berlin : Springer-Verlag, 1997.
  • 7TONELLA P. Using a concept lattice of decomposition slices for program understanding and impact analysis [ J]. IEEE Trans on Software Engineering,2003,29 ( 6 ) :495-509.
  • 8HAAV H M. A semi-automatic method to ontology design by using FCA [ C ]//Proc of the 2nd International CLA Workshop. 2004: 13-25.
  • 9KHAN L, LUO Feng. Ontology Construction for information selection[C]//Proc of the 14th IEEE International Conference on Tools with Artificial Intelligence. Washington DC : IEEE Computer Society, 2002 : 122-127.
  • 10BORDAT J P. Calcul pratique du treillis de galois d' une correspondence[ J]. Math6matique et Science Humaines, 1986,96:31-47.

引证文献7

二级引证文献22

计算机科学
2011年 第1期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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