找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Rough Sets; International Joint Tamás Mihálydeák,Fan Min,Davide Ciucci Conference proceedings 2019 Springer Nature Switzerland AG 2019 app

[复制链接]
查看: 49693|回复: 55
发表于 2025-3-21 18:44:25 | 显示全部楼层 |阅读模式
书目名称Rough Sets
副标题International Joint
编辑Tamás Mihálydeák,Fan Min,Davide Ciucci
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Rough Sets; International Joint  Tamás Mihálydeák,Fan Min,Davide Ciucci Conference proceedings 2019 Springer Nature Switzerland AG 2019 app
描述This LNAI 11499 constitutes the proceedings of the International Joint Conference on Rough Sets, IJCRS 2019, held in Debrecen, Hungary, in June 2019..The 41 full papers were carefully reviewed and selected from 71 submissions. The IJCRS conferences aim at bringing together experts from universities and research centers as well as the industry representing fields of research in which theoretical and applicational aspects of rough set theory already find or may potentially find usage. The papers are grouped in topical sections on core rough set models and methods; related methods and hybridization; areas of application..
出版日期Conference proceedings 2019
关键词approximate reasoning; approximation spaces; artificial intelligence; clustering; clustering algorithms;
版次1
doihttps://doi.org/10.1007/978-3-030-22815-6
isbn_softcover978-3-030-22814-9
isbn_ebook978-3-030-22815-6Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer Nature Switzerland AG 2019
The information of publication is updating

书目名称Rough Sets影响因子(影响力)




书目名称Rough Sets影响因子(影响力)学科排名




书目名称Rough Sets网络公开度




书目名称Rough Sets网络公开度学科排名




书目名称Rough Sets被引频次




书目名称Rough Sets被引频次学科排名




书目名称Rough Sets年度引用




书目名称Rough Sets年度引用学科排名




书目名称Rough Sets读者反馈




书目名称Rough Sets读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:21:18 | 显示全部楼层
发表于 2025-3-22 04:28:12 | 显示全部楼层
Studies on Reducing the Necessary Data Size for Rule Induction from the Decision Table by STRIMbution for the testing and shows the applicable range expanded and performance evaluation by use of a simulation experiment compared with those by the conventional STRIM. The simulation also shows that it gives discussing and confirming information the validity of the results obtained from applying minor-STRIM to a real-world dataset.
发表于 2025-3-22 05:13:20 | 显示全部楼层
On Topologies Defined by Binary Relations in Rough Setssult, we also obtain that any Alexandrov topology satisfying (clop), . is open if and only if . is closed, can be characterized by reflexive and symmetric relation..Moreover, we provide a negative answer to the problem left open in [.].
发表于 2025-3-22 11:12:24 | 显示全部楼层
Rough Matroids Based on Dual Approximation Operatorserator is presented and these definable sets are used for defining rough matroids based on an approximation operator. Finally, an order relation for a special type of rough matroids is established from the order relation among approximation operators.
发表于 2025-3-22 12:55:31 | 显示全部楼层
发表于 2025-3-22 18:03:51 | 显示全部楼层
发表于 2025-3-22 22:37:17 | 显示全部楼层
Approximation Based on Representativesthis paper, a possible method is provided to choose the necessary number of objects that represent the data set. These members are called representatives and it can be useful to use them in the approximation of an arbitrary set.
发表于 2025-3-23 02:26:44 | 显示全部楼层
发表于 2025-3-23 05:47:42 | 显示全部楼层
Rough Sets Defined by Multiple Relationser the tolerances . are .-compatible, this ordered set forms a complete lattice. As a special case we show how this complete lattice can be reduced to the complete lattice of the traditional rough sets defined by the equivalence ..
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-20 15:16
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表