信息系统的属性信息粒计算方法

doi:10.11772/j.issn.1001-9081.2015.04.1030

计算机应用 ›› 2015, Vol. 35 ›› Issue (4): 1030-1034.DOI: 10.11772/j.issn.1001-9081.2015.04.1030

信息系统的属性信息粒计算方法

郝彦彬¹, 郭晓², 杨乃定¹

1. 西北工业大学管理学院, 西安 710072;
2. 西安电子科技大学经济与管理学院, 西安 710071

收稿日期:2014-11-17 修回日期:2014-01-05 出版日期:2015-04-10 发布日期:2015-04-08
通讯作者: 郝彦彬
作者简介:郝彦彬(1976-),男,黑龙江伊春人,讲师,博士研究生,CCF会员,主要研究方向:信息系统、数据挖掘、粒计算; 郭晓(1981-),女,山东泰安人,讲师,博士,主要研究方向:管理系统工程、风险管理、项目管理; 杨乃定(1964-),男,陕西户县人,教授,博士师导师,博士,主要研究方向:管理系统工程、风险管理、项目管理。
基金资助:
国家自然科学基金资助项目(71471146)。

Computing method of attribute information granule of information system

HAO Yanbin¹, GUO Xiao², YANG Naiding¹

1. College of Management, Northwestern Polytechnical University, Xi'an Shaanxi 710072, China;
2. School of Economics and Management, Xidian University, Xi'an Shaanxi 710071, China

Received:2014-11-17 Revised:2014-01-05 Online:2015-04-10 Published:2015-04-08

摘要/Abstract

摘要：

根据属性上的函数依赖关系,提出了信息系统属性信息粒的概念,并给出了可分离信息系统的粒结构计算方法。首先,定义了信息系统可分离性,证明了如果一个信息系统是可分离的,则该系统的粒结构可分解为该系统的子系统粒结构的笛卡儿乘积;其次,给出了信息系统可分离性的判别方法及信息系统分解算法;最后,分析了该计算方法的复杂度。分析结果表明,与直接计算信息系统的粒结构相比,该计算方法可将计算复杂度从O(2ⁿ)降低到O(2^n₁+2^n₂+…+2^n_k),n=n₁+n₂+…+n_k。理论分析和实例计算表明,该计算方法是可行的。

关键词: 函数依赖, 闭包, 属性粒, 信息系统结构, 可分离性

Abstract:

Based on functional dependency over the attributes, the concept of attribute information granule of information system was proposed, and a method to calculate the structure of attribute granule of separable information system was given. Firstly, the separability of information system was defined, and it was proved that if an information system is separable, the structure of attribute granule of the system can be decomposed into the Cartesian product of the structures of attribute granules of its sub-systems. Secondly, the method to judge the separability of an information system and the decomposition algorithm of information system were given. Lastly, the complexity of the proposed method was analyzed. And the analysis result demonstrates that the complexity of the direct calculation of the structure of attribute granule of information system is O(2ⁿ), and the proposed method can reduce it to O(2^n₁+2^n₂+…+2^n_k) where n=n₁+n₂+…+n_k. The theoretical analysis and example show that the method is feasible.

Key words: functional dependency, closure, attribute granule, information system structure, separability

中图分类号:

TP182

郝彦彬, 郭晓, 杨乃定. 信息系统的属性信息粒计算方法[J]. 计算机应用, 2015, 35(4): 1030-1034.

HAO Yanbin, GUO Xiao, YANG Naiding. Computing method of attribute information granule of information system[J]. Journal of Computer Applications, 2015, 35(4): 1030-1034.

参考文献

[1] ZADEH L A. Is there a need for fuzzy logic? [J]. Information Sciences,2008,178(13):2751-2779.
[2] QIAN Y, ZHANG H, LI F, et al. Set-based granular computing: a lattice model [J]. International Journal of Approximate Reasoning, 2014,55(3): 834-852.
[3] MIAO D, XU F, YAO Y, et al. Set-theoretic formulation of granular computing [J]. Chinese Journal of Computers,2012,35(2): 351-363.(苗夺谦,徐菲菲,姚一豫,等.粒计算的集合论描述[J].计算机学报,2012,35(2): 351-363.)
[4] LIANG J, QIAN Y. Information granules and entropy theory in information systems [J]. Science China, Series E: Technological Sciences,2008,38(2): 2048-2065.(梁吉业,钱宇华.信息系统中的信息粒与熵理论[J].中国科学,E辑:技术科学,2008, 38(2): 2048-2065.)
[5] ZHU W, WANG F-Y. The fourth type of covering based rough sets[J]. Information Sciences,2012,201: 80-92.
[6] WANG L, YANG X, YANG J, et al. Comparison on covering-based rough set models[J]. Computer Science, 2012, 39(7): 229-231.(王丽娟,杨习贝,杨静宇,等.基于覆盖的粗糙集模型比较[J].计算机科学,2012, 39(7): 229-231.)
[7] WU W, LEUNG Y. Theory and applications of granular labelled partitions in multi-scale decision tables[J]. Information Sciences, 2011, 181(18): 3878-3897.
[8] GU S, WU W, XU Y. On granulation in incomplete multi-labeled information systems[J]. Journal of Nanjing University: Natural Science, 2013, 49(5):567-573.(顾沈明,吴伟志,徐优红.不完备多标记信息系统中粒度研究[J].南京大学学报:自然科学版,2013, 49(5):567-573.)
[9] ARMSTRONG W W. Dependency structures of data base relationships[C]// Proceedings of the 1974 IFIP Congress. Amsterdam: North-Holland, 1974: 580-583.
[10] MORA A, CORDERO P, ENCISO M, et al. Closure via functional dependence simplification[J]. International Journal of Computer Mathematics, 2012, 89(4): 510-526.
[11] KATONA G O H, SALI A. On the distance of databases[J]. Annals of Mathematics and Artificial Intelligence,2012, 65(2/3):199-216.
[12] DIEDERICH J, MILTON J. New methods and fast algorithms for database normalization[J]. ACM Transactions on Database Systems,1988,13(3): 339-365.

信息系统的属性信息粒计算方法

Computing method of attribute information granule of information system

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 12

编辑推荐

Metrics

[1]	黄永鑫, 唐雪飞. 基于近邻传播聚类和TANE算法的高校数据中函数依赖的发现[J]. 计算机应用, 2020, 40(1): 90-95.
[2]	陈曼如, 张楠, 童向荣, 东野升龙, 杨文静. 基于多尺度属性粒策略的快速正域约简算法[J]. 计算机应用, 2019, 39(12): 3426-3433.
[3]	赵迪, 华保健, 朱洪军. 高阶代码消除性能比较框架的设计与实现[J]. 计算机应用, 2016, 36(9): 2481-2485.
[4]	万静, 刘芳. 强偏序时态模式中混合依赖集的成员籍问题[J]. 计算机应用, 2015, 35(8): 2345-2349.
[5]	郝彦彬, 郭晓, 杨乃定. 基于增量计算的信息系统属性粒结构计算方法[J]. 计算机应用, 2015, 35(7): 1915-1920.
[6]	吕非非徐雅斌李卓武装. 面向微博影响力的社交网络特征分析[J]. 计算机应用, 2013, 33(12): 3359-3362.
[7]	彭翔周代英. 基于二阶模糊聚类算法的雷达目标距离像识别[J]. 计算机应用, 2011, 31(02): 399-401.
[8]	殷丽凤田宏. 基于XML Schema的XML弱函数依赖及其推理规则[J]. 计算机应用, 2010, 30(9): 2314-2316.
[9]	方良达余永权. 属性依赖理论及其在神经网络中的应用[J]. 计算机应用, 2010, 30(4): 985-989.
[10]	任廷艳余建桥. 基于轴节点的XML Schema到关系模式的映射[J]. 计算机应用, 2009, 29(08): 2303-2305.
[11]	王聪周激流李晓华郎方年付翔飞. 基于最大类可分离性新颜色空间的肤色检测[J]. 计算机应用, 2008, 28(12): 3095-3097.
[12]	苏召刘国华. XML弱函数依赖及其推理规则[J]. 计算机应用, 2007, 27(5): 1228-1231.