.png){kind=icon}
返回
Attribute reduction: a horizontal data decomposition approach
.png){kind=icon}
OA
AI
DOI：10.1007/s00500-014-1554-8.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Ever-growing data generate a need for new solutions to the problem of attribute reduction. Such solutions are required to deal with limited memory capacity and with many computations needed for large data processing. This paper proposes new definitions of attribute reduction using horizontal data decomposition. Algorithms for computing reducts of an information system and decision table are developed and evaluated. In the proposed approach, the size of subtables obtained during the decomposition can be arbitrarily small. The reduct sets of subtables are computed independently from one another using any heuristic method for attribute reduction. Compared with standard attribute reduction methods, the proposed approach can produce the same reducts with less space complexity and with the same or less theoretical time complexity. Experiments conducted under this work show that for information systems with fewer attributes or reducts the time needed for computing the reduct set can be shorten.
Keyword:
Attribute reduction
Rough set theory
Data decomposition
FPGA
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
Dietary Sodium and the Antihypertensive Effect of Nifedipine in Spontaneously Hypertensive Rats
.png){kind=icon}
PREAI
分享收藏Measuring the capture velocity of atoms in a magneto-optical trap as a function of laser intensity测量磁光阱中原子捕获速率随激光强度的变化
PREAI
分享收藏Modeling Surface Recombination at the p-TypeSi/SiO2Interface via Dangling Bond Amphoteric Centers通过悬挂键两性中心模拟p型Si/SiO2界面的表面复合OAAI
OAAI分享收藏
分享收藏
查看更多内容