Core and Attribute Reduction Algorithms Based on Compatible Discernibility Matrix
In order to solve the shortcoming of computing core and attribute reduction from inconsistent decision table, in the paper, firstly, the definitions of compatible simplified decision table and compatible simplified discernibility matrix are given, and then the methods of computing core and attribute...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 106 |
|---|---|
| container_issue | |
| container_start_page | 103 |
| container_title | |
| container_volume | 2 |
| creator | Chuanjian Yang Hao Ge Guangshun Yao Lisheng Ma |
| description | In order to solve the shortcoming of computing core and attribute reduction from inconsistent decision table, in the paper, firstly, the definitions of compatible simplified decision table and compatible simplified discernibility matrix are given, and then the methods of computing core and attribute reduction are put forward. It is proved that the core and reduction acquired from the property are the core and reduction based on positive region. Secondly, the algorithms of computing core and attribute reduction based compatible discernibility matrix are proposed. Finally,the example is used to explain the correctness of the method. |
| doi_str_mv | 10.1109/CINC.2009.212 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5231022</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5231022</ieee_id><sourcerecordid>5231022</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-d970387de1451974577b61a35fa93dd9c0ceadfa925588a754224d3e3e6f51953</originalsourceid><addsrcrecordid>eNotjk1LxDAYhAOyoK49evKSP9Car7dpjjXqurAqip6XtHmrkW67pFlw_70VPQ0zwzwMIZecFZwzc23XT7YQjJlCcHFCMqMrpksDslQgF-T8tzJMVpU8Jdk0fTHGuCk1CHVGXuwYkbrB0zqlGJpDQvqK_tCmMA607j_GGNLnbqI3bkJP58yOu71LoemR3oapxTiEJvQhHemjmwnfF2TRuX7C7F-X5P3-7s0-5Jvn1drWmzxwDSn3Rs-XtEeugButQOum5E5C54z03rSsRednIwCqymlQQigvUWLZzQOQS3L1xw2IuN3HsHPxuAUhORNC_gCns09L</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Core and Attribute Reduction Algorithms Based on Compatible Discernibility Matrix</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Chuanjian Yang ; Hao Ge ; Guangshun Yao ; Lisheng Ma</creator><creatorcontrib>Chuanjian Yang ; Hao Ge ; Guangshun Yao ; Lisheng Ma</creatorcontrib><description>In order to solve the shortcoming of computing core and attribute reduction from inconsistent decision table, in the paper, firstly, the definitions of compatible simplified decision table and compatible simplified discernibility matrix are given, and then the methods of computing core and attribute reduction are put forward. It is proved that the core and reduction acquired from the property are the core and reduction based on positive region. Secondly, the algorithms of computing core and attribute reduction based compatible discernibility matrix are proposed. Finally,the example is used to explain the correctness of the method.</description><identifier>ISBN: 9780769536453</identifier><identifier>ISBN: 076953645X</identifier><identifier>DOI: 10.1109/CINC.2009.212</identifier><identifier>LCCN: 2009903883</identifier><language>eng</language><publisher>IEEE</publisher><subject>attribute reduction ; Computational efficiency ; Computational intelligence ; Computer science ; core attribute ; discernibility matrix ; rough set ; Rough sets ; Set theory ; Uncertainty</subject><ispartof>2009 International Conference on Computational Intelligence and Natural Computing, 2009, Vol.2, p.103-106</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5231022$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5231022$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Chuanjian Yang</creatorcontrib><creatorcontrib>Hao Ge</creatorcontrib><creatorcontrib>Guangshun Yao</creatorcontrib><creatorcontrib>Lisheng Ma</creatorcontrib><title>Core and Attribute Reduction Algorithms Based on Compatible Discernibility Matrix</title><title>2009 International Conference on Computational Intelligence and Natural Computing</title><addtitle>CINC</addtitle><description>In order to solve the shortcoming of computing core and attribute reduction from inconsistent decision table, in the paper, firstly, the definitions of compatible simplified decision table and compatible simplified discernibility matrix are given, and then the methods of computing core and attribute reduction are put forward. It is proved that the core and reduction acquired from the property are the core and reduction based on positive region. Secondly, the algorithms of computing core and attribute reduction based compatible discernibility matrix are proposed. Finally,the example is used to explain the correctness of the method.</description><subject>attribute reduction</subject><subject>Computational efficiency</subject><subject>Computational intelligence</subject><subject>Computer science</subject><subject>core attribute</subject><subject>discernibility matrix</subject><subject>rough set</subject><subject>Rough sets</subject><subject>Set theory</subject><subject>Uncertainty</subject><isbn>9780769536453</isbn><isbn>076953645X</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjk1LxDAYhAOyoK49evKSP9Car7dpjjXqurAqip6XtHmrkW67pFlw_70VPQ0zwzwMIZecFZwzc23XT7YQjJlCcHFCMqMrpksDslQgF-T8tzJMVpU8Jdk0fTHGuCk1CHVGXuwYkbrB0zqlGJpDQvqK_tCmMA607j_GGNLnbqI3bkJP58yOu71LoemR3oapxTiEJvQhHemjmwnfF2TRuX7C7F-X5P3-7s0-5Jvn1drWmzxwDSn3Rs-XtEeugButQOum5E5C54z03rSsRednIwCqymlQQigvUWLZzQOQS3L1xw2IuN3HsHPxuAUhORNC_gCns09L</recordid><startdate>200906</startdate><enddate>200906</enddate><creator>Chuanjian Yang</creator><creator>Hao Ge</creator><creator>Guangshun Yao</creator><creator>Lisheng Ma</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200906</creationdate><title>Core and Attribute Reduction Algorithms Based on Compatible Discernibility Matrix</title><author>Chuanjian Yang ; Hao Ge ; Guangshun Yao ; Lisheng Ma</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-d970387de1451974577b61a35fa93dd9c0ceadfa925588a754224d3e3e6f51953</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>attribute reduction</topic><topic>Computational efficiency</topic><topic>Computational intelligence</topic><topic>Computer science</topic><topic>core attribute</topic><topic>discernibility matrix</topic><topic>rough set</topic><topic>Rough sets</topic><topic>Set theory</topic><topic>Uncertainty</topic><toplevel>online_resources</toplevel><creatorcontrib>Chuanjian Yang</creatorcontrib><creatorcontrib>Hao Ge</creatorcontrib><creatorcontrib>Guangshun Yao</creatorcontrib><creatorcontrib>Lisheng Ma</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chuanjian Yang</au><au>Hao Ge</au><au>Guangshun Yao</au><au>Lisheng Ma</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Core and Attribute Reduction Algorithms Based on Compatible Discernibility Matrix</atitle><btitle>2009 International Conference on Computational Intelligence and Natural Computing</btitle><stitle>CINC</stitle><date>2009-06</date><risdate>2009</risdate><volume>2</volume><spage>103</spage><epage>106</epage><pages>103-106</pages><isbn>9780769536453</isbn><isbn>076953645X</isbn><abstract>In order to solve the shortcoming of computing core and attribute reduction from inconsistent decision table, in the paper, firstly, the definitions of compatible simplified decision table and compatible simplified discernibility matrix are given, and then the methods of computing core and attribute reduction are put forward. It is proved that the core and reduction acquired from the property are the core and reduction based on positive region. Secondly, the algorithms of computing core and attribute reduction based compatible discernibility matrix are proposed. Finally,the example is used to explain the correctness of the method.</abstract><pub>IEEE</pub><doi>10.1109/CINC.2009.212</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9780769536453 |
| ispartof | 2009 International Conference on Computational Intelligence and Natural Computing, 2009, Vol.2, p.103-106 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_5231022 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | attribute reduction Computational efficiency Computational intelligence Computer science core attribute discernibility matrix rough set Rough sets Set theory Uncertainty |
| title | Core and Attribute Reduction Algorithms Based on Compatible Discernibility Matrix |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T21%3A57%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Core%20and%20Attribute%20Reduction%20Algorithms%20Based%20on%20Compatible%20Discernibility%20Matrix&rft.btitle=2009%20International%20Conference%20on%20Computational%20Intelligence%20and%20Natural%20Computing&rft.au=Chuanjian%20Yang&rft.date=2009-06&rft.volume=2&rft.spage=103&rft.epage=106&rft.pages=103-106&rft.isbn=9780769536453&rft.isbn_list=076953645X&rft_id=info:doi/10.1109/CINC.2009.212&rft_dat=%3Cieee_6IE%3E5231022%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5231022&rfr_iscdi=true |