共检索到20条结果
学科分类
年份
全部
订阅
收起
  • [会议论文] ,2014 - The 9th International Conference on Rough Sets and Knowledge Technology (RSKT 2014)(第九届粗糙集与知识技术国际会议)
      The minimal test cost attribute reduction is an important component in data mining applications,and plays a key role in cost-sensitive learning.Recently,several algorithms are proposed to address thi...
    Cost-sensitive learningMinimal test costAttribute reductionGranular computingBiologically-inspired algorithm
  • [会议论文] ,2014 - The 9th International Conference on Rough Sets and Knowledge Technology (RSKT 2014)(第九届粗糙集与知识技术国际会议)
      Minimal test cost attribute reduction is an important problem in cost-sensitive learning since it reduces the dimensionality of the attributes space.To address this issue,many heuristic algorithms ha...
    Cost-sensitive learningGranular computingAttribute reductionTest costLogarithmic weighted algorithm
  • [会议论文] ,2014 - The 9th International Conference on Rough Sets and Knowledge Technology (RSKT 2014)(第九届粗糙集与知识技术国际会议)
      Recommender systems are popular in e-commerce as they provide users with items of interest.Existing top-K approaches mine the K strongest granular association rules for each user,and then recommend r...
    Granular computingrecommender systemgranule association rulesconfidencesignificance
  • [会议论文] ,2014 - The 9th International Conference on Rough Sets and Knowledge Technology (RSKT 2014)(第九届粗糙集与知识技术国际会议)
      As a technique for granular computing,rough sets deal with the vagueness and granularity in information systems.Covering-based rough sets are natural extensions of the classical rough sets by relaxin...
    Granular computingcoveringrough setneighborhoodinclusion degreenetwork security
  • [会议论文] ,2014 - The 9th International Conference on Rough Sets and Knowledge Technology (RSKT 2014)(第九届粗糙集与知识技术国际会议)
      As one of three basic theories of granular computing,rough set theory provides a useful tool for dealing with the granularity in information systems.Covering-based rough set theory is a generalizatio...
    CoveringRough setGranular computingApproximation operatorSet-valued information system
  • [会议论文] ,2014 - The 2014 10th International Conference on Natural Computation (ICNC 2014) and the 2014 11th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2014)(第十届自然计算和第十一届模糊系统与知识发现国际会议)
      Rough set theory has been proposed by Pawlak as a useful and powerful tool for dealing with uncertainty,granularity,and incompleteness of knowledge in information systems.Matroid theory is a branch o...
    rough setcoveringapproximation operatormatroidcircuitcovering-circuit matroid
  • [会议论文] ,2012 - 2012 International Conference on Intelligent System Design and Engineering Applications(2012年智能系统设计与工程应用国际会议 ISDEA 2012)
    Rough set theory is an effective mathematical tool for dealing with inconsistencies in information systems. Dominance based rough set (DBRS) is an extension to the original rough set, in which the equi...
    Variable consistencyDominance-based rough setDominance matrix
  • [会议论文] ,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 ...
    粗糙集理论等价关系属性约简
  • [会议论文] ,2008 - 2008 3rd International Conference on Intelligent System and Knowledge Engineering(第三届智能系统与知识工程国际会议)(ISKE 2008)
    Besides scoring function methods,correlation analysisis another index to indicate homology of the sequences.In this paper,the statistical properties of correlationbetween two comparing sequences were a...
回到顶部
选择了条数据