共检索到121条结果
全部
订阅
收起
  • [外文期刊] Aiping Huang William Zhu 《Journal of applied mathematics》, 2014 Pt.1
    The reduction of covering decision systems is an important problem in data mining, and covering-based rough sets serve as an efficient technique to process the problem. Geometric lattices have been wid...
    MatroidsLatticeGeometric
  • [外文期刊] Shiping Wang Qingxin Zhu William Zhu Fan Min 《Fundamenta Informaticae》, ISTIC EI SCI PKU CSSCI 2014 4
    Rough sets are efficient to extract rules from information systems. Matroids generalize the linear independency in vector spaces and the cycle in graphs. Specifically, matroids provide well-established...
    Rough setmatroid2-circuit matroiddualityrestrictioncontraction
  • [外文期刊] Li Li Huiping Chen William Zhu Xiaozhong Zhu 《Journal of information and computational science》, 2014 2
    Research in machine learning, statistics and related fields has produced a wide variety of algorithms for cost-sensitive learning. Some of these algorithms are devoted to minimal test cost reduction fo...
    Cost-sensitive LearningAttribute ReductionTesting Time CostWaiting Cost
  • [外文期刊] Zhongyi Sun Haijun Ding William Zhu Xiaozhong Zhu 《Journal of information and computational science》, 2014 1
    Feature selection is an important task in machine learning and data mining. In real world applications, time and money are required to obtain features of objects. Many existing works have been develope...
    Feature SelectionTesting Time CostWaiting CostConstraintConditional Entropy
  • [外文期刊] Shiping Wang William Zhu Qingxin Zhu Fan Min 《Information Sciences: An International Journal》, ISTIC EI SCI PKU CSSCI 2014
    Covering-based rough sets provide an efficient means of dealing with covering data, which occur widely in practical applications. Boolean matrix decomposition has frequently been applied to data mining...
    CoveringRough setBoolean matrix decompositionCharacteristic matrixApproximation operator
  • [外文期刊] Aiping Huang Hong Zhao William Zhu 《Information Sciences: An International Journal》, ISTIC EI SCI PKU CSSCI 2014
    Rough sets were proposed to deal with vagueness and incompleteness of knowledge in information systems. In this field, there are many optimization issues such as attribute reduction. Matroids generaliz...
    Rough setMatroidNullityMatrixAttribute reduction
  • [外文会议] Yanqing Zhu William Zhu 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
  • [外文会议] Bin Yang William Zhu 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
  • [外文会议] Junxia Niu Hong Zhao William Zhu 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
  • [外文会议] Anjing Fan Hong Zhao William Zhu 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 th...
    Cost-sensitive learningMinimal test costAttribute reductionGranular computingBiologically-inspired algorithm
回到顶部
选择了条数据