基于结构粒化的数据合并方法

doi:10.11772/j.issn.1001-9081.2015.02.0358

计算机应用 ›› 2015, Vol. 35 ›› Issue (2): 358-363.DOI: 10.11772/j.issn.1001-9081.2015.02.0358

基于结构粒化的数据合并方法

闫林¹, 刘涛¹, 闫硕², 李峰¹, 阮宁¹

1. 河南师范大学计算机与信息工程学院, 河南新乡 453007;
2. 北京交通大学计算机与信息技术学院, 北京 100044

收稿日期:2014-09-12 修回日期:2014-11-16 出版日期:2015-02-10 发布日期:2015-02-12
通讯作者: 刘涛
作者简介:闫林(1957-),男,河南新乡人,教授,主要研究方向:数理逻辑、粒计算、数据推理; 刘涛(1984-),男,河南南阳人,硕士研究生,主要研究方向:数据处理、粒计算; 闫硕(1987-),男,河南新乡人,博士研究生,主要研究方向:计算机代数、数据推理; 李峰(1988-),男,河南永城人,硕士研究生,主要研究方向:数据信息化处理; 阮宁(1988-),男,河南驻马店人,硕士研究生,主要研究方向:粗糙集、数据挖掘。
基金资助:
国家自然科学基金资助项目(U1204606)。

Data combination method based on structure's granulation

YAN Lin¹, LIU Tao¹, YAN Shuo², LI Feng¹, RUAN Ning¹

1. College of Computer and Information Engineering, Henan Normal University, Xinxiang Henan 453007, China;
2. School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China

Received:2014-09-12 Revised:2014-11-16 Online:2015-02-10 Published:2015-02-12

摘要/Abstract

摘要：

为了研究实际中的数据合并问题,对各类数据信息给予了整体表示,使数据集、关联关系和划分共同组成了关联组合结构,为数据合并作了结构化的准备。进而,通过对关联关系的粒化处理,实现了关联组合结构到粒化结构的转换,促成了相关数据的按组合并。由于关联组合结构和粒化结构均与关联矩阵相互对应,所以基于结构转换的数据合并又可通过矩阵变换计算完成。因此所展开的讨论既包含了数据合并的理论分析,也给出了数据合并可程序化的数据形式,形成了以结构粒化为理论支撑、以矩阵变换为算法构成的数据合并方法。基于该方法的程序设计使数据合并实现了程序化,并保证了运行的线性复杂度。实验表明,理论支撑下的程序处理具有快速及准确的运行特性。

关键词: 数据合并, 关联组合结构, 粒化结构, 关联矩阵, 粒化矩阵

Abstract:

In order to study the problem about data combinations occurring in real life, different kinds of data information were combined together, leading to a structure called associated-combinatorial structure. Actually, the structure was constituted by a data set, an associated relation and a partition. The aim was to use the structure to set up a method of data combination. To this end, the associated-combinatorial structure was transformed into a granulation structure by granulating the associated relation. In this process, data combinations were completed in accordance with the data classifications. Moreover, because an associated-combinatorial structure or a granulation structure could be represented by the associated matrix, the transformation from a structure to another structure was characterized by algebraic calculations determined by matrix transformations. Therefore, the research not only involved theoretical analysis for the data combination, but also established the data processing method connected with matrix transformations. Accordingly, a computer program with linear complexity was formulated according to the data combinations method. The experimental result proves that the program is accurate and fast.

Key words: data combination, associated-combinatorial structure, granulation structure, associated matrix, granulation matrix

中图分类号:

TP18
TP311

闫林, 刘涛, 闫硕, 李峰, 阮宁. 基于结构粒化的数据合并方法[J]. 计算机应用, 2015, 35(2): 358-363.

YAN Lin, LIU Tao, YAN Shuo, LI Feng, RUAN Ning. Data combination method based on structure's granulation[J]. Journal of Computer Applications, 2015, 35(2): 358-363.

参考文献

[1] PEDRYCZ W. Granular computing: analysis and design of intelligent systems [M]. Boca Raton: CRC Press, 2013: 24-50.
[2] YAN L. Fundamentals of mathematical logic and granular computing [M]. Beijing: Science Press, 2007: 155-165. (闫林. 数理逻辑基础与粒计算[M]. 北京:科学出版社, 2007: 155-165).
[3] SKOWRON A, STEPANIUK J, SWINIARSKI R. Modeling rough granular computing based on approximation spaces [J]. Information Sciences, 2012, 184(1): 20-43.
[4] MCALLISTER R A, ANGRYK R A. Abstracting for dimensionality reduction in text classification [J]. International Journal of Intelligent Systems, 2013, 28(2): 115-138.
[5] FAN T. Rough set analysis of relational structures [J]. Information Sciences, 2013, 221: 230-244.
[6] YAN L, YAN S. Granular reasoning and decision system's decomposition [J]. Journal of Software, 2012, 7(3): 683-690.
[7] HONKO P. Association discovery from relational data via granular computing [J]. Information Sciences, 2013, 234: 136-149.
[8] YAN L, SONG J. Granular trees based on different data sets and their modeling applications[J]. Computer Science, 2014, 41(3): 258-262. (闫林, 宋金鹏. 数据集的粒化树及其建模应用[J]. 计算机科学, 2014, 41(3): 258-262).
[9] PAWLAK Z. Rough set ─ theoretical aspects of reasoning about data [M]. Norwell: Kluwer Academic Publishers, 1992: 157-201.
[10] WANG S, ZHU Q, ZHU W, et al. Quantitative analysis for covering-based rough sets through the upper approximation number [J]. Information Sciences, 2013, 220: 483-491.
[11] SHE Y. On the rough consistency measures of logic theories and approximate reasoning in rough logic [J]. International Journal of Approximate Reasoning, 2014, 55(1): 486-499.
[12] YAN L, YAN S. Researches on rough truth of rough axioms based on granular reasoning [J]. Journal of Software, 2014, 9(2): 265-273.
[13] KOLMAN B, BUSBY R C, ROSS S C. Discrete mathematical structures [M]. 4th ed. Upper Saddle River: Prentlce-Hall, 2001: 89-125.
[14] GACEK A. Granular modeling of signals: a framework of granular computing [J]. Information Sciences, 2013, 221: 1-11.
[15] YU Z, BAI X, YUN Z. A study of rough sets based on 1-neighborhood systems [J]. Information Sciences, 2013, 248: 103-113.
[16] RIESEN K, BUNKE H. Graph classification and clustering based on vector space embedding [M]. River Edge: World Scientific Publishing, 2010: 138-146.

基于结构粒化的数据合并方法

Data combination method based on structure's granulation

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 2

编辑推荐

Metrics

[1]	吴甲陈崚. 一种快速的频繁子图挖掘算法[J]. 计算机应用, 2008, 28(10): 2533-2536.
[2]	冯朝一梁家荣黄柳萍李天志 . 基于集合覆盖的不完备信息系统属性约简方法[J]. 计算机应用, 2006, 26(11): 2664-2666.