Detecting Important Patterns Using Conceptual Relevance Interestingness Measure

• URL: http://arxiv.org/abs/2110.11262v1
• Date: Thu, 21 Oct 2021 16:45:01 GMT
• Title: Detecting Important Patterns Using Conceptual Relevance Interestingness Measure
• Authors: Mohamed-Hamza Ibrahim, Rokia Missaoui and Jean Vaillancourt
• Abstract summary: We introduce the Conceptual Relevance (CR) score, a new scalable interestingness measurement for the identification of actionable concepts. From a conceptual perspective, the minimal generators provide key information about their associated concept intent. As such, the CR index quantifies both the amount of conceptually relevant attributes and the number of the minimal generators per concept intent.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Discovering meaningful conceptual structures is a substantial task in data mining and knowledge discovery applications. While off-the-shelf interestingness indices defined in Formal Concept Analysis may provide an effective relevance evaluation in several situations, they frequently give inadequate results when faced with massive formal contexts (and concept lattices), and in the presence of irrelevant concepts. In this paper, we introduce the Conceptual Relevance (CR) score, a new scalable interestingness measurement for the identification of actionable concepts. From a conceptual perspective, the minimal generators provide key information about their associated concept intent. Furthermore, the relevant attributes of a concept are those that maintain the satisfaction of its closure condition. Thus, the guiding idea of CR exploits the fact that minimal generators and relevant attributes can be efficiently used to assess concept relevance. As such, the CR index quantifies both the amount of conceptually relevant attributes and the number of the minimal generators per concept intent. Our experiments on synthetic and real-world datasets show the efficiency of this measure over the well-known stability index.

Related papers

• Discover-then-Name: Task-Agnostic Concept Bottlenecks via Automated Concept Discovery [52.498055901649025]
  Concept Bottleneck Models (CBMs) have been proposed to address the 'black-box' problem of deep neural networks. We propose a novel CBM approach -- called Discover-then-Name-CBM (DN-CBM) -- that inverts the typical paradigm. Our concept extraction strategy is efficient, since it is agnostic to the downstream task, and uses concepts already known to the model.
  arXiv  Detail & Related papers  (2024-07-19T17:50:11Z)
• The Foundations of Tokenization: Statistical and Computational Concerns [51.370165245628975]
  Tokenization is a critical step in the NLP pipeline. Despite its recognized importance as a standard representation method in NLP, the theoretical underpinnings of tokenization are not yet fully understood. The present paper contributes to addressing this theoretical gap by proposing a unified formal framework for representing and analyzing tokenizer models.
  arXiv  Detail & Related papers  (2024-07-16T11:12:28Z)
• Knowledge graphs for empirical concept retrieval [1.06378109904813]
  Concept-based explainable AI is promising as a tool to improve the understanding of complex models at the premises of a given user. Here, we present a workflow for user-driven data collection in both text and image domains. We test the retrieved concept datasets on two concept-based explainability methods, namely concept activation vectors (CAVs) and concept activation regions (CARs)
  arXiv  Detail & Related papers  (2024-04-10T13:47:22Z)
• Enhancing Actionable Formal Concept Identification with Base-Equivalent Conceptual-Relevance [0.0]
  We introduce the Base-Equivalent Conceptual Relevance (BECR) score, a novel conceptual relevance interestingness measure for improving the identification of actionable concepts. The basic idea of BECR is that the more base and equivalent attributes and minimal generators a concept intent has, the more relevant it is. Preliminary experiments on synthetic and real-world datasets show the efficiency of BECR compared to the well-known stability index.
  arXiv  Detail & Related papers  (2023-12-22T03:57:40Z)
• A Unified Concept-Based System for Local, Global, and Misclassification Explanations [13.321794212377949]
  We present a unified concept-based system for unsupervised learning of both local and global concepts. Our primary objective is to uncover the intrinsic concepts underlying each data category by training surrogate explainer networks. Our approach facilitates the explanation of both accurate and erroneous predictions.
  arXiv  Detail & Related papers  (2023-06-06T09:28:37Z)
• Towards Robust Metrics for Concept Representation Evaluation [25.549961337814523]
  Concept learning models have been shown to be prone to encoding impurities in their representations. We propose novel metrics for evaluating the purity of concept representations in both approaches.
  arXiv  Detail & Related papers  (2023-01-25T00:40:19Z)
• ZeroC: A Neuro-Symbolic Model for Zero-shot Concept Recognition and Acquisition at Inference Time [49.067846763204564]
  Humans have the remarkable ability to recognize and acquire novel visual concepts in a zero-shot manner. We introduce Zero-shot Concept Recognition and Acquisition (ZeroC), a neuro-symbolic architecture that can recognize and acquire novel concepts in a zero-shot way.
  arXiv  Detail & Related papers  (2022-06-30T06:24:45Z)
• Translational Concept Embedding for Generalized Compositional Zero-shot Learning [73.60639796305415]
  Generalized compositional zero-shot learning means to learn composed concepts of attribute-object pairs in a zero-shot fashion. This paper introduces a new approach, termed translational concept embedding, to solve these two difficulties in a unified framework.
  arXiv  Detail & Related papers  (2021-12-20T21:27:51Z)
• Entity Concept-enhanced Few-shot Relation Extraction [35.10974511223129]
  Few-shot relation extraction (FSRE) is of great importance in long-tail distribution problem. Most existing FSRE algorithms fail to accurately classify the relations merely based on the information of the sentences together with the recognized entity pairs. We propose a novel entity-enhanced FEw-shot Relation Extraction scheme (ConceptFERE), which introduces the inherent concepts of entities to provide clues for relation prediction.
  arXiv  Detail & Related papers  (2021-06-04T10:36:49Z)
• Generative Counterfactuals for Neural Networks via Attribute-Informed Perturbation [51.29486247405601]
  We design a framework to generate counterfactuals for raw data instances with the proposed Attribute-Informed Perturbation (AIP) By utilizing generative models conditioned with different attributes, counterfactuals with desired labels can be obtained effectively and efficiently. Experimental results on real-world texts and images demonstrate the effectiveness, sample quality as well as efficiency of our designed framework.
  arXiv  Detail & Related papers  (2021-01-18T08:37:13Z)
• A general framework for defining and optimizing robustness [74.67016173858497]
  We propose a rigorous and flexible framework for defining different types of robustness properties for classifiers. Our concept is based on postulates that robustness of a classifier should be considered as a property that is independent of accuracy. We develop a very general robustness framework that is applicable to any type of classification model.
  arXiv  Detail & Related papers  (2020-06-19T13:24:20Z)

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.