基于样本类别的邻域粗糙集正域计算

doi:10.3778/j.issn.1002-8331.1705-0347

计算机工程与应用 ›› 2018, Vol. 54 ›› Issue (20): 115-121.DOI: 10.3778/j.issn.1002-8331.1705-0347

基于样本类别的邻域粗糙集正域计算

彭潇然1，2，刘遵仁2，纪俊2

1.青岛大学数据科学与软件工程学院，山东青岛 266071
2.青岛大学计算机科学技术学院，山东青岛 266071

出版日期:2018-10-15 发布日期:2018-10-19

Positive region computation of neighborhood rough set based on category of samples

PENG Xiaoran1，2, LIU Zunren2, JI Jun2

1.College of Data Science and Software Engineering, Qingdao University, Qingdao, Shandong 266071, China
2.College of Computer Science and Technology, Qingdao University, Qingdao, Shandong 266071, China

Online:2018-10-15 Published:2018-10-19

摘要/Abstract

摘要： 对基于邻域粗糙集的属性约简算法而言，正域计算是保证其有效性的重要依据，也是影响其时间开销的最主要部分。正域计算的速度主要由样本间度量计算的次数决定。在确保正确性的条件下，样本间度量计算的次数越少，则正域计算越快。在现有的正域计算中，通常存在着大量同类别样本间的度量计算。针对这个现象，首先证明在邻域粗糙集的正域计算中，同类别样本间的度量计算对正域计算是无贡献的，然后据此提出了基于样本类别的正域计算。和现有的正域计算相比，实验结果表明，该正域计算有效且更快速。而且，该正域计算更适用于样本类别数较少的数据集。

关键词: 粗糙集, 邻域粗糙集, 正域计算, 属性约简, 样本类别

Abstract: For an attribute reduction algorithm based on the neighborhood rough set, the positive region calculation is the necessary basis of its efficient performance and the uppermost part of its time cost. And the speed of the calculation is mainly determined by measure times between samples. In the condition of ensuring the correctness of the calculation, the less the measure times are, the faster the calculation is. In existing positive region calculations, there are usually large measure times between samples that have the same category. Aimed at this case, this paper firstly proves that the measure between samples that have the same category is meaningless to the positive region calculation in neighborhood rough set. Then according to the proof, a positive region calculation based on category of samples is proposed. Compared with an existing positive region calculation, the experimental result shows that this proposed calculation is effective and faster. And this calculation is more suitable for data sets with fewer categories of samples.

Key words: rough set, neighborhood rough set, positive region computation, attribute reduction, category

彭潇然1，2，刘遵仁2，纪俊2. 基于样本类别的邻域粗糙集正域计算[J]. 计算机工程与应用, 2018, 54(20): 115-121.

PENG Xiaoran1，2, LIU Zunren2, JI Jun2. Positive region computation of neighborhood rough set based on category of samples[J]. Computer Engineering and Applications, 2018, 54(20): 115-121.

[1]	代琪，李敏，刘洋，李丽红. 模糊层次商空间的快速属性约简算法[J]. 计算机工程与应用, 2021, 57(4): 55-60.
[2]	高天宇，王庆荣，杨磊. 粗糙集属性依赖度强化的应急数据挖掘模型[J]. 计算机工程与应用, 2021, 57(3): 87-93.
[3]	王庆荣，马辰坤. 面向案例消耗推理的应急物资预测[J]. 计算机工程与应用, 2021, 57(22): 281-287.
[4]	张呈玲，李进金，林艺东. 基于OE-概念格的形式背景属性约简[J]. 计算机工程与应用, 2021, 57(15): 82-89.
[5]	刘玉锋，孙文鑫. 一般多粒度量化软粗糙集模型[J]. 计算机工程与应用, 2021, 57(12): 137-143.
[6]	刘桂枝. 维度变化的不完备混合型数据增量式属性约简[J]. 计算机工程与应用, 2021, 57(12): 161-169.
[7]	张博，贾华宇，马珺. RS-GA神经网络无人机受风情况估计[J]. 计算机工程与应用, 2020, 56(4): 209-213.
[8]	牟恩，张贤勇，姚岳松，邓切. 邻域近似条件熵的特定类属性约简及启发算法[J]. 计算机工程与应用, 2020, 56(24): 175-180.
[9]	张建华，李方方，杨岚. 融合PFS与RS的案例知识供需匹配研究[J]. 计算机工程与应用, 2020, 56(23): 139-145.
[10]	骆公志，梅焘. 监督机制多粒度决策粗糙集模型及应用[J]. 计算机工程与应用, 2020, 56(18): 214-220.
[11]	谢旭明，段隆振，邱桃荣，杨幼凤. 改进量子搜索算法及其在核属性求解上的应用[J]. 计算机工程与应用, 2020, 56(14): 57-61.
[12]	李旭，荣梓景，任艳. 带权决策表的属性约简[J]. 计算机工程与应用, 2020, 56(12): 54-59.
[13]	陈盼盼，林梦雷. 基于包含度的单值中智决策信息系统属性约简[J]. 计算机工程与应用, 2020, 56(12): 175-181.
[14]	任俊1，唐绮雯1，徐怡2，胡善忠2. 大学生贫困资助评定的多粒度粗糙集研究[J]. 计算机工程与应用, 2019, 55(7): 82-86.
[15]	邬阳阳，汤建国. 大数据背景下粗糙集属性约简研究进展[J]. 计算机工程与应用, 2019, 55(6): 31-38.

基于样本类别的邻域粗糙集正域计算

Positive region computation of neighborhood rough set based on category of samples

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics