已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
taku完成签到 ,获得积分10
2秒前
司新颖完成签到,获得积分20
4秒前
希希完成签到 ,获得积分10
4秒前
5秒前
纯真的紊发布了新的文献求助10
5秒前
6秒前
巴啦啦玩泥巴完成签到 ,获得积分10
8秒前
Cecilia发布了新的文献求助10
8秒前
9秒前
yyf完成签到 ,获得积分10
12秒前
乔凌云发布了新的文献求助10
13秒前
龚幻梦发布了新的文献求助10
14秒前
星星粥完成签到 ,获得积分10
18秒前
23秒前
24秒前
小神仙完成签到 ,获得积分10
25秒前
无花果应助zdker采纳,获得10
25秒前
NXNJ发布了新的文献求助10
26秒前
CipherSage应助YLC采纳,获得10
26秒前
酷波er应助星星粥采纳,获得10
27秒前
Kao应助科研通管家采纳,获得30
28秒前
Criminology34应助科研通管家采纳,获得10
28秒前
GingerF应助科研通管家采纳,获得50
28秒前
28秒前
Ava应助科研通管家采纳,获得10
28秒前
SciGPT应助科研通管家采纳,获得20
28秒前
29秒前
乔凌云发布了新的文献求助10
30秒前
唐亿倩完成签到,获得积分10
30秒前
英俊的铭应助今天开心吗采纳,获得10
31秒前
32秒前
顾先森发布了新的文献求助10
33秒前
YLC发布了新的文献求助10
37秒前
molihuakai应助NXNJ采纳,获得80
37秒前
Akim应助LBJBowen23采纳,获得10
38秒前
冷酷飞飞完成签到 ,获得积分10
40秒前
42秒前
三木子完成签到,获得积分10
44秒前
47秒前
HUOZHUANGCHAO完成签到,获得积分10
50秒前
高分求助中
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小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7297119
求助须知:如何正确求助?哪些是违规求助? 8915596
关于积分的说明 18878642
捐赠科研通 6962946
什么是DOI,文献DOI怎么找? 3210507
关于科研通互助平台的介绍 2379814
邀请新用户注册赠送积分活动 2186984