| 查看: 835 | 回复: 6 | ||||
| 当前只显示满足指定条件的回帖，点击这里查看本话题的所有回帖 | ||||
[求助]
求文献是否EI收录？谢谢
|
||||
|
1.Bin Yang, William Zhu. Covering-based rough sets on covering-circuit matroids. in FSKD 2014, 48-53. 2.Bin Yang, William Zhu. A new type of covering-based rough sets. in RSKT 2014, 489-499. |
回复此楼» 猜你喜欢
青基如何破局
已经有4人回复
-
基金不中，共勉
已经有8人回复
-
基金未中，这种答复是模板吗？
已经有5人回复
-
为什么资助数各大高校都创新高，自己申请怎么就这么难
已经有5人回复
-
有多少人是今天查系统知道结果的？
已经有17人回复
-
导师吐槽：我怎么摊上了这么个极品研究生！
已经有5人回复
-
怎么看青基中了没有啊
已经有5人回复
-
梦想
已经有3人回复
-
面上合作单位盖章
已经有3人回复
-
看板上这么多中的，有点像50人群里49个人都是骗子的那种感觉……
已经有5人回复
Paulwolf
荣誉版主 (文坛精英)
非线性控制领域新人一枚
-
专家经验: +178 - 应助: 317 (大学生)
- 贵宾: 4.423
- 金币: 320190
- 散金: 17942
- 红花: 554
- 沙发: 3382
- 帖子: 35712
- 在线: 4027.9小时
- 虫号: 3131175
- 注册: 2014-04-12
- 专业: 控制理论与方法
- 管辖: 学术会议
5楼2015-02-28 20:28:18
Paulwolf
荣誉版主 (文坛精英)
非线性控制领域新人一枚
-
专家经验: +178 - 应助: 317 (大学生)
- 贵宾: 4.423
- 金币: 320190
- 散金: 17942
- 红花: 554
- 沙发: 3382
- 帖子: 35712
- 在线: 4027.9小时
- 虫号: 3131175
- 注册: 2014-04-12
- 专业: 控制理论与方法
- 管辖: 学术会议
【答案】应助回帖
★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★
感谢参与，应助指数 +1
dance2012: 金币+20, ★★★★★最佳答案 2015-02-28 20:29:22
感谢参与，应助指数 +1
dance2012: 金币+20, ★★★★★最佳答案 2015-02-28 20:29:22
|
版规一个帖子一条！ 在此，第二个给你检索出来了！ A New Type of Covering-Based Rough Sets 作者:Yang, B (Yang, Bin)[ 1 ] ; Zhu, W (Zhu, William)[ 1 ] 编者:Miao, D; Pedrycz, W; Slezak, D; Peters, G; Hu, Q; Wang, R ROUGH SETS AND KNOWLEDGE TECHNOLOGY, RSKT 2014 丛书: Lecture Notes in Artificial Intelligence 卷: 8818 页: 489-499 DOI: 10.1007/978-3-319-11740-9_45 出版年: 2014 会议名称 会议: 9th International Conference on Rough Sets and Knowledge Technology (RSKT) 会议地点: Tongji Univ, Shanghai, PEOPLES R CHINA 会议日期: OCT 24-26, 2014 会议赞助商:Natl Nat Sci Fdn China; Int Rough Set Soc; Chinese Assoc Artificial Intelligence, Rough Sets & Soft Comp Soc 摘要 As a technique for granular computing, rough sets deal with the vagueness and granularity in information systems. Covering-based rough sets are natural extensions of the classical rough sets by relaxing the partitions to coverings and have been applied for many fields. In this paper, a new type of covering-based rough sets are proposed and the properties of this new type of covering-based rough sets are studied. First, we introduce a concept of inclusion degree into covering-based rough set theory to explore some properties of the new type of covering approximation space. Second, a new type of covering-based rough sets is established based on inclusion degree. Moreover, some properties of the new type of covering-based rough sets are studied. Finally, a simple application of the new type of covering-based rough sets to network security is given. 关键词 作者关键词:Granular computing; covering; rough set; neighborhood; inclusion degree; network security KeyWords Plus:REDUCTION; OPERATORS 作者信息 通讯作者地址: Yang, B (通讯作者) 显示增强组织信息的名称 Minnan Normal Univ, Lab Granular Comp, Zhangzhou 363000, Peoples R China. 地址: 显示增强组织信息的名称 [ 1 ] Minnan Normal Univ, Lab Granular Comp, Zhangzhou 363000, Peoples R China 电子邮件地址:williamfengzhu@gmail.com 出版商 SPRINGER INT PUBLISHING AG, GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND 类别 / 分类 研究方向:Computer Science Web of Science 类别:Computer Science, Artificial Intelligence; Computer Science, Information Systems 文献信息 文献类型  roceedings Paper语种:English 入藏号: WOS:000345091600045 ISBN:978-3-319-11740-9; 978-3-319-11739-3 ISSN: 0302-9743 其他信息 IDS 号: BB6XB Web of Science 核心合集中的 "引用的参考文献": 29 Web of Science 核心合集中的 "被引频次": 0 |
2楼2015-02-28 20:04:58
Paulwolf
荣誉版主 (文坛精英)
非线性控制领域新人一枚
-
专家经验: +178 - 应助: 317 (大学生)
- 贵宾: 4.423
- 金币: 320190
- 散金: 17942
- 红花: 554
- 沙发: 3382
- 帖子: 35712
- 在线: 4027.9小时
- 虫号: 3131175
- 注册: 2014-04-12
- 专业: 控制理论与方法
- 管辖: 学术会议
【答案】应助回帖
|
EI信息： Accession number: 20144600190825 Title: A new type of Covering-Based rough sets Authors: Yang, Bin1; Zhu, William1 Email author williamfengzhu@gmail.com Author affiliation: 1 Lab of Granular Computing, Minnan Normal University, Zhangzhou, China Corresponding author: Yang, Bin Source title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Abbreviated source title: Lect. Notes Comput. Sci. Volume: 8818 Issue date: 2014 Publication year: 2014 Pages: 489-499 Language: English ISSN: 03029743 E-ISSN: 16113349 ISBN-13: 9783319117393 Document type: Conference article (CA) Conference name: 9th International Conference on Rough Sets and Knowledge Technology, RSKT 2014 Conference date: October 24, 2014 - October 26, 2014 Conference location: Shanghai, China Conference code: 109299 Sponsor: AAI; Fundamenta Informaticae; International Rough Set Society; National Natural Science Foundation of China; Rough Sets and Soft Computing Society of the Chinese Association for Artificial Intelligence; Springer; Tongji University Publisher: Springer Verlag Abstract: As a technique for granular computing, rough sets deal with the vagueness and granularity in information systems. Covering-based rough sets are natural extensions of the classical rough sets by relaxing the partitions to coverings and have been applied for many fields. In this paper, a new type of covering-based rough sets are proposed and the properties of this new type of covering-based rough sets are studied. First, we introduce a concept of inclusion degree into covering-based rough set theory to explore some properties of the new type of covering approximation space. Second, a new type of covering-based rough sets is established based on inclusion degree. Moreover, some properties of the new type of covering-based rough sets are studied. Finally, a simple application of the new type of covering-based rough sets to network security is given. © Springer International Publishing Switzerland 2014. Number of references: 29 Main heading: Rough set theory Controlled terms: Approximation algorithms - Computation theory - Granular computing - Network security Uncontrolled terms: Approximation spaces - Covering - Inclusion degrees - Natural extension - Neighborhood Classification code: 723 Computer Software, Data Handling and Applications - 723.2 Data Processing and Image Processing - 921 Mathematics - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory DOI: 10.1007/978-3-319-11740-9_45 Database: Compendex Compilation and indexing terms, © 2015 Elsevier Inc. |
3楼2015-02-28 20:08:51
4楼2015-02-28 20:27:45
投票:
