共检索到12条结果
学科分类
按刊分类
全部
订阅
收起
  • [期刊论文] 《电子科技学刊》 - 2011年2期
    In many machine learning applications,data are not free, and there is a test cost for each data item. For the economical reason, some existing works try to minimize the test cost and at the same time,p...
    Cost-sensitive learningconstraintheuristic algorithmtest cost
  • [会议论文] ,2011 - 第二届全国语言动力系统研讨会
      To study with other mathematical theories is an important research direction of rough sets. And this not only enrich the study of rough sets but also may discover some new properties of it. In this p...
    粗糙集边界区域负区域
  • [会议论文] ,2011 - 第二届全国语言动力系统研讨会
      Rough set theory provides a systematical tool for attribute reduction and rule induction in information systems. There is much need to use sophisticated theories or tools to make it more adaptive to ...
    粗糙集理论等价关系属性约简
  • [外文期刊] Shiping Wang William Zhu 《International journal of granular computing, rough sets and intelligent systems》, 2011 2
    Covering-based rough set theory is a generalisation of rough set theory. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. In this paper, we intr...
    coveringmatroidupper approximation numberapproximation operatorrank function
  • [外文期刊] William Zhu Shiping Wang 《International journal of machine learning and cybernetics》, 2011 4
    Rough set theory is a useful tool for dealing with the vagueness, granularity and uncertainty in information systems. This paper connects generalized rough sets based on relations with matroid theory. ...
  • [外文期刊] Aboul Ella Hassanien Hiroshi Sakai Dominik Slezak Michir K. Chakraborty William Zhu 《International journal of hybrid intelligent systems》, 2011 1
    This special issue of International Journal of Hybrid Intelligent Systems (IJHIS) published by IOS Press contains a selection of papers presented initially at the RSFDGrC'09 Conference (Rough Sets, Fuz...
  • [外文会议] Chengyi Yu Fan Min William Zhu 2011
    This paper connects covering-based rough sets with matroids. Firstly, we defined the r-restrict uniform matroid to establish the matroidal structure of covering-based rough sets. Any subset of a univer...
    Rough setsMatroidsReducible MatroidReducible element
  • [外文会议] Guiying Pan Fan Min William Zhu 2011
    Test cost is an important issue in cost-sensitive systems. It is what we pay for obtaining a data item of an object. In some applications, there are some common costs and a cost constraint. The common ...
    Cost-sensitive learningtest costcommon costconstraintheuristic algorithm
  • [外文会议] Shiping Wang William Zhu Fan Min 2011
    In many real world applications, data are organized by coverings, instead of partitions. Covering-based rough sets have been proposed to cope with this type of data. Covering-based rough set theory is ...
    CoveringRough setMatroidBipartite graphIsomorphism
  • [外文会议] Fan Min William Zhu 2011
    Cost-sensitive learning extends classical machine learning by considering various types of costs, such as test costs and misclassification costs, of the data. In many applications, there is a test cost...
    Cost-sensitive learningAttribute reductionTest costConstraintExhaustive algorithm
回到顶部
选择了条数据