共检索到21条结果
全部
订阅
收起
  • [外文期刊] 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
  • [会议论文] ,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
回到顶部
选择了条数据