Flexible categorization using formal concept analysis and Dempster-Shafer theory

• URL: http://arxiv.org/abs/2408.15012v1
• Date: Fri, 23 Aug 2024 07:28:20 GMT
• Title: Flexible categorization using formal concept analysis and Dempster-Shafer theory
• Authors: Marcel Boersma, Krishna Manoorkar, Alessandra Palmigiano, Mattia Panettiere, Apostolos Tzimoulis, Nachoem Wijnberg,
• Abstract summary: This paper provides a formal ground to obtain and study explainable categorizations from the data represented as bipartite graphs. We use this framework to describe a machine-leaning meta algorithm for detection and classification which can provide local and global explanations of its result.
• Score: 40.30013238421509
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Categorization of business processes is an important part of auditing. Large amounts of transactional data in auditing can be represented as transactions between financial accounts using weighted bipartite graphs. We view such bipartite graphs as many-valued formal contexts, which we use to obtain explainable categorization of these business processes in terms of financial accounts involved in a business process by using methods in formal concept analysis. We use Dempster-Shafer mass functions to represent agendas showing different interest in different set of financial accounts. We also model some possible deliberation scenarios between agents with different interrogative agendas to reach an aggregated agenda and categorization. The framework developed in this paper provides a formal ground to obtain and study explainable categorizations from the data represented as bipartite graphs according to the agendas of different agents in an organization (e.g. an audit firm), and interaction between these through deliberation. We use this framework to describe a machine-leaning meta algorithm for outlier detection and classification which can provide local and global explanations of its result and demonstrate it through an outlier detection algorithm.

Related papers

• FGCE: Feasible Group Counterfactual Explanations for Auditing Fairness [4.749824105387293]
  This paper introduces the first graph-based framework for generating group counterfactual explanations to audit model fairness. Our framework, named Feasible Group Counterfactual Explanations (FGCEs), captures real-world feasibility constraints and constructs subgroups with similar counterfactuals. It also addresses key trade-offs in counterfactual generation, including the balance between the number of counterfactuals, their associated costs, and the breadth of coverage achieved.
  arXiv  Detail & Related papers  (2024-10-29T23:10:01Z)
• Generative Retrieval Meets Multi-Graded Relevance [104.75244721442756]
  We introduce a framework called GRaded Generative Retrieval (GR$2$) GR$2$ focuses on two key components: ensuring relevant and distinct identifiers, and implementing multi-graded constrained contrastive training. Experiments on datasets with both multi-graded and binary relevance demonstrate the effectiveness of GR$2$.
  arXiv  Detail & Related papers  (2024-09-27T02:55:53Z)
• TraCE: Trajectory Counterfactual Explanation Scores [1.149801527015106]
  We propose to extend the use of counterfactuals to evaluate progress in sequential decision making tasks. We introduce a model-agnostic modular framework, TraCE, which is able to distill and condense progress in highly complex scenarios into a single value.
  arXiv  Detail & Related papers  (2023-09-27T19:24:57Z)
• The geometry of financial institutions -- Wasserstein clustering of financial data [0.0]
  We develop methods for condensing granular and big data into a representative and intelligible map. Financial regulation is a field that exemplifies this need, as regulators require diverse and often highly granular data from financial institutions to monitor and assess their activities. We propose a variant of Lloyd's algorithm that applies to probability distributions and uses generalized Wasserstein barycenters to construct a metric space which represents given data in condensed form.
  arXiv  Detail & Related papers  (2023-05-05T14:16:29Z)
• Flexible categorization for auditing using formal concept analysis and Dempster-Shafer theory [55.878249096379804]
  We study different ways to categorize according to different extents of interest in different financial accounts. The framework developed in this paper provides a formal ground to obtain and study explainable categorizations.
  arXiv  Detail & Related papers  (2022-10-31T13:49:16Z)
• A Framework for Auditing Multilevel Models using Explainability Methods [2.578242050187029]
  An audit framework for technical assessment of regressions is proposed. The focus is on three aspects, model, discrimination, and transparency and explainability. It is demonstrated that popular explainability methods, such as SHAP and LIME, underperform in accuracy when interpreting these models.
  arXiv  Detail & Related papers  (2022-07-04T17:53:21Z)
• Exploring the Trade-off between Plausibility, Change Intensity and Adversarial Power in Counterfactual Explanations using Multi-objective Optimization [73.89239820192894]
  We argue that automated counterfactual generation should regard several aspects of the produced adversarial instances. We present a novel framework for the generation of counterfactual examples.
  arXiv  Detail & Related papers  (2022-05-20T15:02:53Z)
• Gaussian process imputation of multiple financial series [71.08576457371433]
  Multiple time series such as financial indicators, stock prices and exchange rates are strongly coupled due to their dependence on the latent state of the market. We focus on learning the relationships among financial time series by modelling them through a multi-output Gaussian process.
  arXiv  Detail & Related papers  (2020-02-11T19:18:18Z)
• End-to-End Models for the Analysis of System 1 and System 2 Interactions based on Eye-Tracking Data [99.00520068425759]
  We propose a computational method, within a modified visual version of the well-known Stroop test, for the identification of different tasks and potential conflicts events. A statistical analysis shows that the selected variables can characterize the variation of attentive load within different scenarios. We show that Machine Learning techniques allow to distinguish between different tasks with a good classification accuracy.
  arXiv  Detail & Related papers  (2020-02-03T17:46:13Z)

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.