亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

Attribution reduction based on sequential three-way search of granularity

还原 粒度 数据挖掘 还原(数学) 数学 计算机科学 人工智能 算法 粗集 几何学 操作系统
作者
Xun Wang,Pingxin Wang,Xibei Yang,Yiyu Yao
出处
期刊:International Journal of Machine Learning and Cybernetics [Springer Science+Business Media]
卷期号:12 (5): 1439-1458 被引量:15
标识
DOI:10.1007/s13042-020-01244-x
摘要

Most existing results about attribute reduction are reported by considering one and only one granularity, especially for the strategies of searching reducts. Nevertheless, how to derive reduct from multi-granularity has rarely been taken into account. One of the most important advantages of multi-granularity based attribute reduction is that it is useful in investigating the variation of the performances of reducts with respect to different granularities. From this point of view, the concept of Sequential Granularity Attribute Reduction (SGAR) is systemically studied in this paper. Different from previous attribute reductions, the aim of SGAR is to find multiple reducts which are derived from a family of ordered granularities. Assuming that a reduct related to the previous granularity may offer the guidance for computing a reduct related to the current granularity, the idea of the three-way is introduced into the searching of sequential granularity reduct. The three different ways in such process are: (1) the reduct related to the previous granularity is precisely the reduct related to the current granularity; (2) the reduct related to the previous granularity is not the reduct related to the current granularity; (3) the reduct related to the previous granularity is possible to be the reduct related to the current granularity. Therefore, a three-way based forward greedy searching is designed to calculate the sequential granularity reduct. The main advantage of our strategy is that the number of times to evaluate the candidate attributes can be reduced. Experimental results over 12 UCI data sets demonstrate the following: (1) three-way based searching is superior to some state-of-the-art acceleration algorithms in time consumption of deriving reducts; (2) the sequential granularity reducts obtained by proposed three-way based searching will provide well-matched classification performances. This study suggests new trends concerning the problem of attribute selection.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
初景应助科研通管家采纳,获得20
22秒前
香蕉觅云应助科研通管家采纳,获得10
23秒前
灵宝宝完成签到,获得积分10
23秒前
6wdhw完成签到 ,获得积分10
1分钟前
小嚣张完成签到,获得积分10
1分钟前
和谐青文完成签到 ,获得积分10
1分钟前
wwe完成签到,获得积分10
1分钟前
宁安完成签到 ,获得积分10
1分钟前
默默无闻完成签到 ,获得积分10
2分钟前
魔术师完成签到,获得积分10
2分钟前
外向的妍完成签到,获得积分10
2分钟前
wwrjj完成签到,获得积分10
4分钟前
4分钟前
4分钟前
GTI完成签到,获得积分10
4分钟前
GTI发布了新的文献求助10
4分钟前
CodeCraft应助车哥爱学习采纳,获得10
4分钟前
善良的冰绿完成签到,获得积分10
4分钟前
萌萌完成签到 ,获得积分10
4分钟前
老石完成签到 ,获得积分10
5分钟前
5分钟前
完美世界应助科研通管家采纳,获得10
6分钟前
虚幻的岩完成签到,获得积分10
6分钟前
彦成完成签到,获得积分10
6分钟前
自由的盼柳完成签到 ,获得积分10
7分钟前
7分钟前
7分钟前
华乐天发布了新的文献求助10
7分钟前
ZikiGao发布了新的文献求助10
7分钟前
7分钟前
Akim应助车哥爱学习采纳,获得10
7分钟前
纯情的凡双完成签到 ,获得积分10
8分钟前
8分钟前
感动初蓝完成签到 ,获得积分10
8分钟前
西瓜妹完成签到 ,获得积分10
9分钟前
FeelingUnreal完成签到,获得积分10
10分钟前
GHOSTagw完成签到,获得积分10
10分钟前
Xee完成签到,获得积分10
10分钟前
隐形荟完成签到 ,获得积分10
10分钟前
long完成签到,获得积分20
11分钟前
高分求助中
Principles of Economics, 11th Edition 10000
University Physics with Modern Physics, 16th edition 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
48V Low-voltage Power Distribution Network (PDN) Architecture Industry Report, 2024 800
ズームレンズの光学設計に関する研究 800
Fundamentals of Pharmaceutical and Biologics Regulations: A Global Perspective, Second Edition 700
Matrix Methods in Data Mining and Pattern Recognition Second Edition 610
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7297908
求助须知:如何正确求助?哪些是违规求助? 8916366
关于积分的说明 18879317
捐赠科研通 6963207
什么是DOI,文献DOI怎么找? 3210641
关于科研通互助平台的介绍 2379958
邀请新用户注册赠送积分活动 2187108