共检索到121条结果
全部
订阅
收起
  • 通过定义抽象相关关系这一概念来研究覆盖粗糙集.借助群论中的思想,在覆盖上进行抽象,从而在覆盖粗糙集中定义了元素与元素的抽象相关关系,元素与集合的依赖关系.进而在粗糙集上定义了独立集、基、秩甬数等概念,并在此基础...
    独立集秩函数覆盖粗糙集
  • [外文期刊] Fan Min Qinghua Hu William Zhu 《International journal of approximate reasoning》, ISTIC EI SCI PKU CSSCI 2014 1 Pt.2
    Feature selection is an important preprocessing step in machine learning and data mining. In real-world applications, costs, including money, time and other resources, are required to acquire the featu...
    Feature selectionCost-sensitive learningConstraint satisfaction problemBacktracking algorithmHeuristic algorithmDecision-theoretic rough sets
  • [外文期刊] 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
  • [外文期刊] 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
  • [期刊论文] 《电子科技学刊》 - 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
  • [外文期刊] Shiping Wang William Zhu Qingxin Zhu Fan Min 《International journal of approximate reasoning》, ISTIC EI SCI PKU CSSCI 2013 9
    Covering is a common form of data representation, and covering-based rough sets serve as an efficient technique to process this type of data. However, many important problems such as covering reduction...
    CoveringRough setMatroidGraphRank functionMatching
  • [外文期刊] Jianguo Tang Kun She Fan Min William Zhu 《Theoretical computer science》, ISTIC EI SCI PKU CSSCI 2013
    Rough set theory has been successfully applied to vague and uncertain data due to its approximation ability. Matroid is a sophisticated mathematical structure to provide a unifying abstract treatment f...
    Rough setMatroidP-UMSDirect sumBoundary region
  • [会议论文] ,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
回到顶部
选择了条数据