4.5 Article

Hierarchical sequential three-way decision model

期刊

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ijar.2021.10.004

关键词

Decision rule mining; Sequential three-way decisions; Hierarchical rough set model; Concept hierarchy tree

资金

  1. National Natural Science Foundation of China [62066014, 62076111, 62163016]
  2. Double thousand plan of Jiangxi Province of China
  3. Jiangxi Province Natural Science Foundation of China [20202BABL202018]
  4. Qinglan Project of Jiangsu Province of China

向作者/读者索取更多资源

This paper proposes a hierarchical sequential three-way decision model that combines sequential three-way decisions with hierarchical rough set model, generalizes conditional attributes concepts through concept hierarchy tree, designs multi-level granularity multi-hierarchical decision tables, and illustrates the algorithm for acquiring generalized rules step by step. Experimental results demonstrate that the model can mine hierarchical sequential three-way decision rules under different levels of granularity.
Knowledge acquisition is one of the important issues in granular computing. In recent years, scholars have paid much attention to this problem and proposed the rule-based acquisition algorithms. However, a large number of the decision rules mined by the ex -isting algorithms are not comprehensible. At the same time, the long detailed rules are easy to lead to over-fitting. In order to generate simpler and easier-to-comprehensible rules and improve human decision-making, a hierarchical sequential three-way decision model is proposed by combining sequential three-way decisions with hierarchical rough set model. Specifically, we generalize the concepts of the conditional attributes through the concept hierarchy tree, design the multi-hierarchical decision table with multiple levels of granu-larity, and illustrate the corresponding algorithm to acquire the generalized rules step by step. The experimental results demonstrate that the proposed model can mine hierarchical sequential three-way decision rules under different levels of granularity. (C) 2021 Elsevier Inc. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
Article Computer Science, Artificial Intelligence

Change in quantitative bipolar argumentation: Sufficient, necessary, and counterfactual explanations

Timotheus Kampik, Kristijonas Cyras, Jose Ruiz Alarcon

Summary: This paper presents a formal approach to explaining changes in inference in Quantitative Bipolar Argumentation Frameworks (QBAFs). The approach traces the causes of strength inconsistencies and provides explanations for them.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)

Article Computer Science, Artificial Intelligence

A direct approach to representing algebraic domains by formal contexts

Xiangnan Zhou, Longchun Wang, Qingguo Li

Summary: This paper aims to establish a closer connection between domain theory and Formal Concept Analysis (FCA) by introducing the concept of an optimized concept for a formal context. With the utilization of optimized concepts, it is demonstrated that the class of formal contexts directly corresponds to algebraic domains. Additionally, two subclasses of formal contexts are identified to characterize algebraic L-domains and Scott domains. An application is presented to address the open problem of reconstructing bounded complete continuous domains using attribute continuous contexts, and the presentation of algebraic domains is extended to a categorical equivalence.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)

Article Computer Science, Artificial Intelligence

Exploiting fuzzy rough entropy to detect anomalies

Sihan Wang, Zhong Yuan, Chuan Luo, Hongmei Chen, Dezhong Peng

Summary: Anomaly detection is widely used in various fields, but most current methods only work for specific data and ignore uncertain information such as fuzziness. This paper proposes an anomaly detection algorithm based on fuzzy rough entropy, which effectively addresses the similarity between high-dimensional objects using distance and correlation measures. The algorithm is compared and analyzed with mainstream anomaly detection algorithms on publicly available datasets, showing superior performance and flexibility.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)

Article Computer Science, Artificial Intelligence

A preferential interpretation of MultiLayer Perceptrons in a conditional logic with typicality

Mario Alviano, Francesco Bartoli, Marco Botta, Roberto Esposito, Laura Giordano, Daniele Theseider Dupre

Summary: This paper investigates the relationships between a multipreferential semantics in defeasible reasoning and a multilayer neural network model. Weighted knowledge bases are considered for a simple description logic with typicality under a concept-wise multipreference semantics. The semantics is used to interpret MultiLayer Perceptrons (MLPs) preferentially. Model checking and entailment based approach are employed in verifying conditional properties of MLPs.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)

Article Computer Science, Artificial Intelligence

Polyadic relational concept analysis

Bazin Alexandre, Galasso Jessie, Kahn Giacomo

Summary: Formal concept analysis is a mathematical framework that represents the information in binary object-attribute datasets using a lattice of formal concepts. It has been extended to handle more complex data types, such as relational data and n-ary relations. This paper presents a framework for polyadic relational concept analysis, which extends relational concept analysis to handle relational datasets consisting of n-ary relations.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)

Article Computer Science, Artificial Intelligence

Verified propagation of imprecise probabilities in non-linear ODEs

Ander Gray, Marcelo Forets, Christian Schilling, Scott Ferson, Luis Benet

Summary: The presented method combines reachability analysis and probability bounds analysis to handle imprecisely known random variables. It can rigorously compute the temporal evolution of p-boxes and provide interval probabilities for formal verification problems. The method does not impose strict constraints on the input probability distribution or p-box and can handle multivariate p-boxes with a consonant approximation method.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)

Article Computer Science, Artificial Intelligence

How to choose a completion method for pairwise comparison matrices with missing entries: An axiomatic result

Laszlo Csato

Summary: This paper studies a special type of incomplete pairwise comparison matrices and proposes a new method to determine the missing elements without violating the ordinal property.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)