连续信息系统中一种新的属性约简算法

2007 International Conference on Computational Intelligence and Security (CIS 2007) Pub Date : 2007-12-15 DOI:10.1109/CIS.2007.191

Yuejin Lv, Hong-yun Zhang, Fen Quan, Zhi-cheng Chen

{"title":"连续信息系统中一种新的属性约简算法","authors":"Yuejin Lv, Hong-yun Zhang, Fen Quan, Zhi-cheng Chen","doi":"10.1109/CIS.2007.191","DOIUrl":null,"url":null,"abstract":"This paper puts forward a new method of discretizing continuous attributes. Compared with the traditional approach, the method, proposed in this paper, can make the number of the obtained classes be more moderate, as well as the lost information be fewer. And then a simple attribute reduction algorithm is developed in continuous information systems. Finally, a real example is used to illustrate its feasibility and effectiveness, respectively.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A New Attribute Reduction Algorithm in Continuous Information Systems\",\"authors\":\"Yuejin Lv, Hong-yun Zhang, Fen Quan, Zhi-cheng Chen\",\"doi\":\"10.1109/CIS.2007.191\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper puts forward a new method of discretizing continuous attributes. Compared with the traditional approach, the method, proposed in this paper, can make the number of the obtained classes be more moderate, as well as the lost information be fewer. And then a simple attribute reduction algorithm is developed in continuous information systems. Finally, a real example is used to illustrate its feasibility and effectiveness, respectively.\",\"PeriodicalId\":127238,\"journal\":{\"name\":\"2007 International Conference on Computational Intelligence and Security (CIS 2007)\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Computational Intelligence and Security (CIS 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS.2007.191\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2007.191","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

提出了一种离散连续属性的新方法。与传统方法相比，本文提出的方法可以使得到的类的数量更加适中，丢失的信息也更少。然后，在连续信息系统中提出了一种简单的属性约简算法。最后，通过实例分别说明了该方法的可行性和有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A New Attribute Reduction Algorithm in Continuous Information Systems

This paper puts forward a new method of discretizing continuous attributes. Compared with the traditional approach, the method, proposed in this paper, can make the number of the obtained classes be more moderate, as well as the lost information be fewer. And then a simple attribute reduction algorithm is developed in continuous information systems. Finally, a real example is used to illustrate its feasibility and effectiveness, respectively.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 International Conference on Computational Intelligence and Security (CIS 2007)

自引率

0.00%

发文量