%0 Journal Article
%T 基于组合加速机制的多特定类快速正域约简<br>A Fast Attribute Reduction Algorithm Based on Fusing Acceleration Mechanism for Multi-Specific Classes Positive Region
%A 张小飞
%J Hans Journal of Data Mining
%P 203-212
%@ 2163-1468
%D 2023
%I Hans Publishing
%R 10.12677/HJDM.2023.133020
%X 信息技术的快速发展给社会带来了海量的高维数据，这些海量数据中隐藏着大量有价值的信息。如何高效处理大规模数据并从中提取有效知识已成为计算机领域的研究热点。基于粗糙集理论的属性约简，可以在保证数据分类能力不变的前提下，删除冗余属性，从而实现数据的有效降维。在实际应用中，决策者往往只关注某些特定决策标签的有效信息提取。在多特定类属性约简中，传统的启发式算法约简效率较低。针对该问题，本文从对象、属性和粒度的视角出发，提出了基于组合加速机制的多特定类快速正域约简算法。最后，实验选取6组数据集进行实验，从约简长度、参与迭代的对象规模、迭代次数和约简时间四个方面验证了所提算法在多特定类约简中的有效性。<br />
The rapid development of information technology has brought massive high-dimensional data to society, which hides a large amount of valuable information. How to efficiently deal with these large-scale data and extract effective knowledge from it has become a research hotspot in the field of computer science. Attribute reduction based on rough set theory can remove redundant attributes while keeping the ability of data classification unchanging, thus reducing the dimension of data effectively. In practical applications, decision makers often only focus on the effective information extraction of certain specific decision labels. In the attribute reduction of multi-specific classes, traditional heuristic algorithms have lower reduction efficiency. To solve above problems, this paper proposes a fast attribute reduction algorithm based on fusing acceleration mechanism for multi-specific classes positive region, which is from the perspectives of objects, attributes and granularity. Finally, six datasets were used for experiments. And the experimental results show the effectiveness of the proposed accelerating algorithm in this paper for multi-specific decision classes attribute reduction, which is verified from four aspects: reduction length, size of objects in iterations, number of iterations and reduction time.
%K 粗糙集，属性约简，粒计算，加速机制，Rough Set
%K Attribute Reduction
%K Granular Computing
%K Acceleration Mechanism
%U http://www.hanspub.org/journal/PaperInformation.aspx?PaperID=68320