计算机科学 ›› 2011, Vol. 38 ›› Issue (8): 193-196.
• 人工智能 • 上一篇 下一篇
钱进,苗夺谦,张泽华
出版日期:
发布日期:
基金资助:
QIAN Jin,MIAO Duo-qian, ZHANG Zchua
Online:
Published:
摘要: 知识约简是粗糙集理论的重要研究内容之一。经典的差别矩阵知识约简算法只能处理小数据集,而已有的任务并行的知识约简算法是假设所有数据一次性装入内存中,这显然不适合处理海量数据。为此,剖析了差别矩阵元素的特性,根据属性(集)的不可辨识性和云计算技术MapRcducc设计了适合数据并行的差别矩阵,并首次提出了面向大规模数据的差别矩阵知识约简算法。实验结果表明该知识约简算法是有效可行的,且具有较好的可扩展性。
关键词: 云计算,差别矩阵,知识约简,粗糙集
Abstract: Knowledge reduction is one of the important research issues in rough set theory. Classical knowledge reduction algorithms can only deal with small datasets,while the existing parallel knowledge reduction algorithms assume all the datasets can be loaded into the main memory and only implement reduction tasks concurrently, which is infeasible for handling large-scale data. Massive data with high dimension makes attribute reduction a challenging task. To solve this problem, the characteristics of discernibility matrix cells were analyzed, and discernibility matrix for data parallel was designed in terms of the indiscernibility of the attributes) and MapReduce programming model. Thus, large-scale data oriented discernibility matrix knowledge reduction algorithm in cloud computing was proposed. I}he experimental results demonstrate that our proposed algorithm can scale well and efficiently process largcscale datasets on commodity computers.
Key words: Cloud computing, Discernibility matrix, Knowledge reduction, Rough set
钱进,苗夺谦,张泽华. 云计算环境下差别矩阵知识约简算法研究[J]. 计算机科学, 2011, 38(8): 193-196. https://doi.org/
QIAN Jin,MIAO Duo-qian, ZHANG Zchua. Research on Discernibility Matrix Knowledge Reduction Algorithm in Cloud Computing[J]. Computer Science, 2011, 38(8): 193-196. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2011/V38/I8/193
Cited