Journal of Software:2001.12(3):415-419

(南昌大学 计算机科学与工程系,江西 南昌 330029)
Rough Logic and Its Applications in Data Reduction
LIU Qing,LIU Shao-hui,ZHENG Fei
Chart / table
Similar Articles
Article :Browse 2365   Download 2890
Received:October 22, 1999    Revised:January 21, 2000
> 中文摘要: 讨论了被定义在邻域值决策表上的Rough逻辑及其公式的真值,它在数据约简中的应用比Pawlak定义的决策表上的决策逻辑更加广泛.目前常用的数据约简方法有Pawlak的数据分析和Skowron的分明矩阵法.前者是非形式的,不易机械化;而后者虽说直观、易理解,但还要求生成一个分明矩阵的中间环节,从而造成时空上的不必要的开销.采取一边从邻域值决策表关于属性值邻域是分明的属性并构成邻域分明合取范式,一边做这种逻辑公式的等价变换直接得到邻域值决策表的诸多约简.由于不用生成分明矩阵的中间环节,这样便节省了空间和时间,
Abstract:The rough logic defined on neighbor-valued decision tables and its truth values of the formulas are discussed in this paper. It is more general than the decision logic defined by Pawlak in the applications of data reduction. At present, the methods used are often Pawlak's data analysis and Skowron's discernible matrix methods. The former is informal, no ease mechanization. The latter is intuitive, easy to understand, but it requires to generate a medial link of discernible matrix, to make unnecessary expenses on time and space. Therefore, in the paper, one side extracts the attributes of attribute neighbor-valued discernible from the neighbor-valued decision table and discernible Conjunctive Normal Form is constructed. The other side simplifies the formula to use absorbable laws and other calculus of logical formulas. It obtains directly all reductions in the neighbor-valued decision table. Since it doesn't need to generate the medial link of discernible matrix, so it can spare space and time, and raise the efficiency of the program run. Thus, reduction of the tables is handled to possess 6 attributes (4 conditional attributes and 2 decision attributes) and 102 objects to use two methods respectively, and to obtain the same results. It uses one side to extract formulas from the tables, and the other side to reduce the formulas in DELPHI 3.0 on PⅠⅠ 233/64 M. The time of program running is about 1 minute 54 seconds; while time of spending is about 1 minute 55 seconds to use the discernible matrix method. Due to the increase of an array (discernible matrix), its space degree of complexity is O(m×n2), where m is the number of attributes, n is the number of objects. So, the space and time occupied will also increase rapidly along with the increment of attributes and objects. The strong points and shortcomings of two methods are quite clear from space and time used.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金资助项目(69773001);江西省自然科学基金资助项目(9911027) 国家自然科学基金资助项目(69773001);江西省自然科学基金资助项目(9911027)
Foundation items:
Reference text:


LIU Qing,LIU Shao-hui,ZHENG Fei.Rough Logic and Its Applications in Data Reduction.Journal of Software,2001,12(3):415-419