Attribute reduction and rule acquisition of formal decision context based on two new kinds of decision rules

• URL: http://arxiv.org/abs/2107.03288v1
• Date: Sun, 4 Jul 2021 02:55:24 GMT
• Title: Attribute reduction and rule acquisition of formal decision context based on two new kinds of decision rules
• Authors: Qian Hu, Keyun Qin
• Abstract summary: The premises of I-decision rules and II-decision rules are object-oriented concepts. The attribute reduction approaches to preserve I-decision rules and II-decision rules are presented.
• Score: 1.0914300987810128
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper mainly studies the rule acquisition and attribute reduction for formal decision context based on two new kinds of decision rules, namely I-decision rules and II-decision rules. The premises of these rules are object-oriented concepts, and the conclusions are formal concept and property-oriented concept respectively. The rule acquisition algorithms for I-decision rules and II-decision rules are presented. Some comparative analysis of these algorithms with the existing algorithms are examined which shows that the algorithms presented in this study behave well. The attribute reduction approaches to preserve I-decision rules and II-decision rules are presented by using discernibility matrix.

Related papers

• A Comparison of Decision Algorithms on Newcomblike Problems [0.0]
  Two standard decision algorithms can be shown to fail systematically when faced with aspects of the prisoner's dilemma and so-called "Newcomblike" problems. We describe a new form of decision algorithm, called Timeless Decision Theory, which consistently wins on these problems.
  arXiv  Detail & Related papers  (2023-05-31T20:50:08Z)
• The Statistical Complexity of Interactive Decision Making [126.04974881555094]
  We provide a complexity measure, the Decision-Estimation Coefficient, that is proven to be both necessary and sufficient for sample-efficient interactive learning. A unified algorithm design principle, Estimation-to-Decisions (E2D), transforms any algorithm for supervised estimation into an online algorithm for decision making.
  arXiv  Detail & Related papers  (2021-12-27T02:53:44Z)
• Modularity in Reinforcement Learning via Algorithmic Independence in Credit Assignment [79.5678820246642]
  We show that certain action-value methods are more sample efficient than policy-gradient methods on transfer problems that require only sparse changes to a sequence of previously optimal decisions. We generalize the recently proposed societal decision-making framework as a more granular formalism than the Markov decision process.
  arXiv  Detail & Related papers  (2021-06-28T21:29:13Z)
• SCARI: Separate and Conquer Algorithm for Action Rules and Recommendations Induction [0.0]
  This article describes an action rule induction algorithm based on a sequential covering approach. The algorithm allows the action rule induction from a source and a target decision class point of view. The application of rule quality measures enables the induction of action rules that meet various quality criteria.
  arXiv  Detail & Related papers  (2021-06-09T19:27:30Z)
• Learning Accurate and Interpretable Decision Rule Sets from Neural Networks [5.280792199222362]
  This paper proposes a new paradigm for learning a set of independent logical rules in disjunctive normal form as an interpretable model for classification. We consider the problem of learning an interpretable decision rule set as training a neural network in a specific, yet very simple two-layer architecture.
  arXiv  Detail & Related papers  (2021-03-04T04:10:19Z)
• Decision Rule Elicitation for Domain Adaptation [93.02675868486932]
  Human-in-the-loop machine learning is widely used in artificial intelligence (AI) to elicit labels from experts. In this work, we allow experts to additionally produce decision rules describing their decision-making. We show that decision rule elicitation improves domain adaptation of the algorithm and helps to propagate expert's knowledge to the AI model.
  arXiv  Detail & Related papers  (2021-02-23T08:07:22Z)
• A Scalable Two Stage Approach to Computing Optimal Decision Sets [29.946141040012545]
  Rule-based models, such as decision trees, decision lists, and decision sets, are conventionally deemed to be the most interpretable. Recent work uses propositional satisfiability (SAT) solving to generate minimum-size decision sets. This paper proposes a novel approach to learn minimum-size decision sets by enumerating individual rules of the target decision set independently of each other, and then solving a set cover problem to select a subset of rules.
  arXiv  Detail & Related papers  (2021-02-03T06:51:49Z)
• Identification of Unexpected Decisions in Partially Observable Monte-Carlo Planning: a Rule-Based Approach [78.05638156687343]
  We propose a methodology for analyzing POMCP policies by inspecting their traces. The proposed method explores local properties of policy behavior to identify unexpected decisions. We evaluate our approach on Tiger, a standard benchmark for POMDPs, and a real-world problem related to mobile robot navigation.
  arXiv  Detail & Related papers  (2020-12-23T15:09:28Z)
• Decision-Making Algorithms for Learning and Adaptation with Application to COVID-19 Data [46.71828464689144]
  This work focuses on the development of a new family of decision-making algorithms for adaptation and learning. A key observation is that estimation and decision problems are structurally different and, therefore, algorithms that have proven successful for the former need not perform well when adjusted for decision problems.
  arXiv  Detail & Related papers  (2020-12-14T18:24:45Z)
• Reinforcement Learning as Iterative and Amortised Inference [62.997667081978825]
  We use the control as inference framework to outline a novel classification scheme based on amortised and iterative inference. We show that taking this perspective allows us to identify parts of the algorithmic design space which have been relatively unexplored.
  arXiv  Detail & Related papers  (2020-06-13T16:10:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.