Classification and Feature Transformation with Fuzzy Cognitive Maps

• URL: http://arxiv.org/abs/2103.05124v1
• Date: Mon, 8 Mar 2021 22:26:24 GMT
• Title: Classification and Feature Transformation with Fuzzy Cognitive Maps
• Authors: Piotr Szwed
• Abstract summary: Fuzzy Cognitive Maps (FCMs) are considered a soft computing technique combining elements of fuzzy logic and recurrent neural networks. In this work we propose an FCM based classifier with a fully connected map structure. Weights were learned with a gradient algorithm and logloss or cross-entropy were used as the cost function.
• Score: 0.3299672391663526
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fuzzy Cognitive Maps (FCMs) are considered a soft computing technique combining elements of fuzzy logic and recurrent neural networks. They found multiple application in such domains as modeling of system behavior, prediction of time series, decision making and process control. Less attention, however, has been turned towards using them in pattern classification. In this work we propose an FCM based classifier with a fully connected map structure. In contrast to methods that expect reaching a steady system state during reasoning, we chose to execute a few FCM iterations (steps) before collecting output labels. Weights were learned with a gradient algorithm and logloss or cross-entropy were used as the cost function. Our primary goal was to verify, whether such design would result in a descent general purpose classifier, with performance comparable to off the shelf classical methods. As the preliminary results were promising, we investigated the hypothesis that the performance of $d$-step classifier can be attributed to a fact that in previous $d-1$ steps it transforms the feature space by grouping observations belonging to a given class, so that they became more compact and separable. To verify this hypothesis we calculated three clustering scores for the transformed feature space. We also evaluated performance of pipelines built from FCM-based data transformer followed by a classification algorithm. The standard statistical analyzes confirmed both the performance of FCM based classifier and its capability to improve data. The supporting prototype software was implemented in Python using TensorFlow library.

Related papers

• Rethinking Few-shot 3D Point Cloud Semantic Segmentation [62.80639841429669]
  This paper revisits few-shot 3D point cloud semantic segmentation (FS-PCS) We focus on two significant issues in the state-of-the-art: foreground leakage and sparse point distribution. To address these issues, we introduce a standardized FS-PCS setting, upon which a new benchmark is built.
  arXiv  Detail & Related papers  (2024-03-01T15:14:47Z)
• Estimation of AMOC transition probabilities using a machine learning based rare-event algorithm [0.0]
  The Atlantic Meridional Overturning Circulation (AMOC) is an important component of the global climate. This study computes the probability that the AMOC collapses within a specified time window. We show that coupling a rare-event algorithm with machine learning allows for a correct estimation of transition probabilities.
  arXiv  Detail & Related papers  (2024-01-19T16:36:27Z)
• Dynamic Perceiver for Efficient Visual Recognition [87.08210214417309]
  We propose Dynamic Perceiver (Dyn-Perceiver) to decouple the feature extraction procedure and the early classification task. A feature branch serves to extract image features, while a classification branch processes a latent code assigned for classification tasks. Early exits are placed exclusively within the classification branch, thus eliminating the need for linear separability in low-level features.
  arXiv  Detail & Related papers  (2023-06-20T03:00:22Z)
• Prediction Calibration for Generalized Few-shot Semantic Segmentation [101.69940565204816]
  Generalized Few-shot Semantic (GFSS) aims to segment each image pixel into either base classes with abundant training examples or novel classes with only a handful of (e.g., 1-5) training images per class. We build a cross-attention module that guides the classifier's final prediction using the fused multi-level features. Our PCN outperforms the state-the-art alternatives by large margins.
  arXiv  Detail & Related papers  (2022-10-15T13:30:12Z)
• Do We Really Need a Learnable Classifier at the End of Deep Neural Network? [118.18554882199676]
  We study the potential of learning a neural network for classification with the classifier randomly as an ETF and fixed during training. Our experimental results show that our method is able to achieve similar performances on image classification for balanced datasets.
  arXiv  Detail & Related papers  (2022-03-17T04:34:28Z)
• Exploring Category-correlated Feature for Few-shot Image Classification [27.13708881431794]
  We present a simple yet effective feature rectification method by exploring the category correlation between novel and base classes as the prior knowledge. The proposed approach consistently obtains considerable performance gains on three widely used benchmarks.
  arXiv  Detail & Related papers  (2021-12-14T08:25:24Z)
• Confusion-based rank similarity filters for computationally-efficient machine learning on high dimensional data [0.0]
  We introduce a novel type of computationally efficient artificial neural network (ANN) called the rank similarity filter (RSF) RSFs can be used to transform and classify nonlinearly separable datasets with many data points and dimensions. Open-source code for RST, RSC and RSPC was written in Python using the popular scikit-learn framework to make it easily accessible.
  arXiv  Detail & Related papers  (2021-09-28T10:53:38Z)
• CIM: Class-Irrelevant Mapping for Few-Shot Classification [58.02773394658623]
  Few-shot classification (FSC) is one of the most concerned hot issues in recent years. How to appraise the pre-trained FEM is the most crucial focus in the FSC community. We propose a simple, flexible method, dubbed as Class-Irrelevant Mapping (CIM)
  arXiv  Detail & Related papers  (2021-09-07T03:26:24Z)
• An evidential classifier based on Dempster-Shafer theory and deep learning [6.230751621285322]
  We propose a new classification system based on Dempster-Shafer (DS) theory and a convolutional neural network (CNN) architecture for set-valued classification. Experiments on image recognition, signal processing, and semantic-relationship classification tasks demonstrate that the proposed combination of deep CNN, DS layer, and expected utility layer makes it possible to improve classification accuracy.
  arXiv  Detail & Related papers  (2021-03-25T01:29:05Z)
• Interpretable Sequence Classification via Discrete Optimization [26.899228003677138]
  In many applications such as healthcare monitoring or intrusion detection, early classification is crucial to prompt intervention. In this work, we learn sequence classifiers that favour early classification from an evolving observation trace. Our classifiers are interpretable---supporting explanation, counterfactual reasoning, and human-in-the-loop modification.
  arXiv  Detail & Related papers  (2020-10-06T15:31:07Z)
• Fine-Grained Visual Classification with Efficient End-to-end Localization [49.9887676289364]
  We present an efficient localization module that can be fused with a classification network in an end-to-end setup. We evaluate the new model on the three benchmark datasets CUB200-2011, Stanford Cars and FGVC-Aircraft.
  arXiv  Detail & Related papers  (2020-05-11T14:07:06Z)

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.