Method to determine α in rough set model based on connection degree |
| |
Authors: | Li Huaxiong Zhou Xianzhong Huang Bing |
| |
Institution: | 1. School of Management and Engineering, Nanjing Univ., Nanjing 210093, P. R. China 2. School of Management and Engineering, Nanjing Univ., Nanjing 210093, P. R. China;State Key Lab. for Novel Software Technology, Nanjing Univ., Nanjing 210093, P. R. China 3. School of Information Science, Nanjing Audit Univ., Nanjing 210029, P. R. China |
| |
Abstract: | An improvement of tolerance relation is proposed in regard to rough set model based on connection degree by which reflexivity of relation can be assured without loss of information. Then, a method to determine optimal identity degree based on relative positive region is proposed so that the identity degree can be computed in an objective method without any preliminary or additional information about data, which is consistent with the notion of objectivity in rough set theory and data mining theory. Subsequently, an algorithm is proposed, and in two examples, the global optimum identity degree is found out. Finally, in regard to optimum connection degree, the method of rules extraction for connection degree rough set model baaed on generalization function is presented by which the rules extracted from a decision table are enumerated. |
| |
Keywords: | rough set data mining connection degree identity degree set pair relative positive region |
本文献已被 维普 万方数据 等数据库收录! |
| 点击此处可从《系统工程与电子技术(英文版)》浏览原始摘要信息 |
| 点击此处可从《系统工程与电子技术(英文版)》下载免费的PDF全文 |
|