| ²é¿´: 726 | »Ø¸´: 6 | ||||
| µ±Ç°Ö»ÏÔʾÂú×ãÖ¸¶¨Ìõ¼þµÄ»ØÌû£¬µã»÷ÕâÀï²é¿´±¾»°ÌâµÄËùÓлØÌû | ||||
dance2012Òø³æ (ÕýʽдÊÖ)
|
[ÇóÖú]
ÇóÎÄÏ×ÊÇ·ñ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. |
» ²ÂÄãϲ»¶
284Çóµ÷¼Á
ÒѾÓÐ10È˻ظ´
һ־Ըɽ¶«´óѧҩѧѧ˶Çóµ÷¼Á
ÒѾÓÐ4È˻ظ´
07»¯Ñ§280·ÖÇóµ÷¼Á
ÒѾÓÐ4È˻ظ´
298-Ò»Ö¾Ô¸Öйúũҵ´óѧ-Çóµ÷¼Á
ÒѾÓÐ12È˻ظ´
Çó²ÄÁÏ£¬»·¾³×¨Òµµ÷¼Á
ÒѾÓÐ3È˻ظ´
335Çóµ÷¼Á
ÒѾÓÐ5È˻ظ´
Çóµ÷¼Á
ÒѾÓÐ7È˻ظ´
Ò»Ö¾Ô¸¼ª´ó»¯Ñ§322Çóµ÷¼Á
ÒѾÓÐ4È˻ظ´
»·¾³Ñ§Ë¶288Çóµ÷¼Á
ÒѾÓÐ8È˻ظ´
341Çóµ÷¼Á(Ò»Ö¾Ô¸ºþÄÏ´óѧ070300)
ÒѾÓÐ6È˻ظ´

dance2012
Òø³æ (ÕýʽдÊÖ)
- Ó¦Öú: 4 (Ó×¶ùÔ°)
- ½ð±Ò: 275.9
- É¢½ð: 1411
- ºì»¨: 11
- Ìû×Ó: 848
- ÔÚÏß: 415.4Сʱ
- ³æºÅ: 2487378
- ×¢²á: 2013-05-29
- ÐÔ±ð: GG
- רҵ: ×éºÏÊýѧ

4Â¥2015-02-28 20:27:45
Paulwolf
ÈÙÓþ°æÖ÷ (ÎÄ̳¾«Ó¢)
·ÇÏßÐÔ¿ØÖÆÁìÓòÐÂÈËһö
-

ר¼Ò¾Ñé: +178 - Ó¦Öú: 317 (´óѧÉú)
- ¹ó±ö: 4.423
- ½ð±Ò: 310300
- É¢½ð: 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 ºËÐĺϼ¯ÖÐµÄ "ÒýÓõIJο¼ÎÄÏ×": 29 Web of Science ºËÐĺϼ¯ÖÐµÄ "±»ÒýƵ´Î": 0 |
2Â¥2015-02-28 20:04:58
Paulwolf
ÈÙÓþ°æÖ÷ (ÎÄ̳¾«Ó¢)
·ÇÏßÐÔ¿ØÖÆÁìÓòÐÂÈËһö
-

ר¼Ò¾Ñé: +178 - Ó¦Öú: 317 (´óѧÉú)
- ¹ó±ö: 4.423
- ½ð±Ò: 310300
- É¢½ð: 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
Paulwolf
ÈÙÓþ°æÖ÷ (ÎÄ̳¾«Ó¢)
·ÇÏßÐÔ¿ØÖÆÁìÓòÐÂÈËһö
-

ר¼Ò¾Ñé: +178 - Ó¦Öú: 317 (´óѧÉú)
- ¹ó±ö: 4.423
- ½ð±Ò: 310300
- É¢½ð: 17942
- ºì»¨: 554
- ɳ·¢: 3382
- Ìû×Ó: 35712
- ÔÚÏß: 4027.9Сʱ
- ³æºÅ: 3131175
- ×¢²á: 2014-04-12
- רҵ: ¿ØÖÆÀíÂÛÓë·½·¨
- ¹ÜϽ: ѧÊõ»áÒé
5Â¥2015-02-28 20:28:18













»Ø¸´´ËÂ¥
roceedings Paper
5