{"title":"Study on discretization based on rough set theory","authors":"Jian-hua Dai, Yuan-xiang Li","doi":"10.1109/ICMLC.2002.1167430","DOIUrl":null,"url":null,"abstract":"Discretization of attributes with real values is an important problem in data mining based on rough set. And discretization based on rough set has some particular characteristics. The method of discretization based on rough set and Boolean reasoning is discussed. Determination of. candidate cuts is discussed in detail. A theorem is proposed. to show that all bound cuts can discern the same objects pairs as the whole initial cuts. A strategy to select candidate cuts is proposed based on the theorem. Under the strategy, the space complexity and time complexity of improved algorithm decline obviously. The experiments results also confirm that.","PeriodicalId":90702,"journal":{"name":"Proceedings. International Conference on Machine Learning and Cybernetics","volume":"8 1","pages":"1371-1373 vol.3"},"PeriodicalIF":0.0000,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. International Conference on Machine Learning and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMLC.2002.1167430","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31
Abstract
Discretization of attributes with real values is an important problem in data mining based on rough set. And discretization based on rough set has some particular characteristics. The method of discretization based on rough set and Boolean reasoning is discussed. Determination of. candidate cuts is discussed in detail. A theorem is proposed. to show that all bound cuts can discern the same objects pairs as the whole initial cuts. A strategy to select candidate cuts is proposed based on the theorem. Under the strategy, the space complexity and time complexity of improved algorithm decline obviously. The experiments results also confirm that.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
