首页    期刊浏览 2024年12月03日 星期二
登录注册

文章基本信息

  • 标题:Relative Reducts and Heuristic Algorithm for Reducts in the Object-Oriented Rough Set Models
  • 作者:M.Srivenkatesh ; P.V.G.D.Prasadreddy ; Y.srinivas
  • 期刊名称:International Journal of Computer Science and Network Security
  • 印刷版ISSN:1738-7906
  • 出版年度:2010
  • 卷号:10
  • 期号:11
  • 页码:194-201
  • 出版社:International Journal of Computer Science and Network Security
  • 摘要:We propose a new reduct in the object-oriented rough set model called relative reduct. In the object?oriented rough set models, objects are treated as instances of classes, and illustrate structural hierarchies among objects based on is-a relationship and has-a relationship[2].We also introduced heuristic-filter base algorithm for finding reducts in the object-oriented rough set model. The reduct finding in the object-oriented rough set models suffer intense computation of discernibility function and positive regions. In order to improve the efficiency, in this paper, we develop a new computation model based on relative class dependency.
  • 关键词:Rough Set; Dynamic Reduct; Core; Indiscernibility Relations; Discernibility Matrices
Loading...
联系我们|关于我们|网站声明
国家哲学社会科学文献中心版权所有