On fine-tuning of Autoencoders for Fuzzy rule classifiers

• URL: http://arxiv.org/abs/2106.11182v1
• Date: Mon, 21 Jun 2021 15:20:37 GMT
• Title: On fine-tuning of Autoencoders for Fuzzy rule classifiers
• Authors: Rahul Kumar Sevakula, Nishchal Kumar Verma, Hisao Ishibuchi
• Abstract summary: This paper presents a novel scheme to incorporate the use of autoencoders in Fuzzy rule classifiers (FRC) Autoencoders when stacked can learn the complex non-linear relationships amongst data, and the proposed framework built towards FRC can allow users to input expert knowledge to the system. This paper further introduces four novel fine-tuning strategies for autoencoders to improve the FRC's classification and rule reduction performance.
• Score: 6.80011340736829
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recent discoveries in Deep Neural Networks are allowing researchers to tackle some very complex problems such as image classification and audio classification, with improved theoretical and empirical justifications. This paper presents a novel scheme to incorporate the use of autoencoders in Fuzzy rule classifiers (FRC). Autoencoders when stacked can learn the complex non-linear relationships amongst data, and the proposed framework built towards FRC can allow users to input expert knowledge to the system. This paper further introduces four novel fine-tuning strategies for autoencoders to improve the FRC's classification and rule reduction performance. The proposed framework has been tested across five real-world benchmark datasets. Elaborate comparisons with over 15 previous studies, and across 10-fold cross validation performance, suggest that the proposed methods are capable of building FRCs which can provide state of the art accuracies.

Related papers

• NERFIFY: A Multi-Agent Framework for Turning NeRF Papers into Code [49.610331036334316]
  We introduce NERFIFY, a framework that reliably converts NeRF research papers into trainable Nerfstudio plugins.<n>Code, data and implementations will be publicly released.
  arXiv  Detail & Related papers  (2026-02-28T20:57:32Z)
• An AST-guided LLM Approach for SVRF Code Synthesis [0.0]
  This paper introduces a novel methodology integrating Abstract Syntax Tree (AST) embedding and Retrieval-Augmented Generation (RAG) for enhanced SVRF code synthesis.<n>We demonstrate up to a 40% improvement in code generation accuracy compared to basic text-based fine-tuning process.
  arXiv  Detail & Related papers  (2025-07-01T00:57:45Z)
• DeepFRC: An End-to-End Deep Learning Model for Functional Registration and Classification [6.365405684671285]
  We introduce DeepFRC, an end-to-end deep learning framework for joint functional registration and classification.<n>DeepFRC integrates class-aware elastic warping and a learnable basis representation into a unified architecture.<n>We establish the first theoretical connection between alignment quality and generalization error, and validate our model on synthetic and real-world benchmarks.
  arXiv  Detail & Related papers  (2025-01-30T03:35:03Z)
• FlanEC: Exploring Flan-T5 for Post-ASR Error Correction [25.931773686829796]
  We present an encoder-decoder model leveraging Flan-T5 for post-Automatic Speech Recognition (ASR) Generative Speech Error Correction (GenSEC) We explore its application within the GenSEC framework to enhance ASR outputs by mapping n-best hypotheses into a single output sentence. Specifically, we investigate whether scaling the training data and incorporating diverse datasets can lead to significant improvements in post-ASR error correction.
  arXiv  Detail & Related papers  (2025-01-22T16:06:04Z)
• Fast Context-Biasing for CTC and Transducer ASR models with CTC-based Word Spotter [57.64003871384959]
  This work presents a new approach to fast context-biasing with CTC-based Word Spotter. The proposed method matches CTC log-probabilities against a compact context graph to detect potential context-biasing candidates. The results demonstrate a significant acceleration of the context-biasing recognition with a simultaneous improvement in F-score and WER.
  arXiv  Detail & Related papers  (2024-06-11T09:37:52Z)
• Enhancing Intrusion Detection In Internet Of Vehicles Through Federated Learning [0.0]
  Federated learning allows multiple parties to collaborate and learn a shared model without sharing their raw data. Our paper proposes a federated learning framework for intrusion detection in Internet of Vehicles (IOVs) using the CIC-IDS 2017 dataset.
  arXiv  Detail & Related papers  (2023-11-23T04:04:20Z)
• The Cascaded Forward Algorithm for Neural Network Training [61.06444586991505]
  We propose a new learning framework for neural networks, namely Cascaded Forward (CaFo) algorithm, which does not rely on BP optimization as that in FF. Unlike FF, our framework directly outputs label distributions at each cascaded block, which does not require generation of additional negative samples. In our framework each block can be trained independently, so it can be easily deployed into parallel acceleration systems.
  arXiv  Detail & Related papers  (2023-03-17T02:01:11Z)
• Fast Rule-Based Decoding: Revisiting Syntactic Rules in Neural Constituency Parsing [9.858565876426411]
  Previous research has demonstrated that probabilistic statistical methods based on syntactic rules are particularly effective in constituency parsing. In this paper, we first implement a fast CKY decoding procedure harnessing GPU acceleration, based on which we further derive a syntactic rule-based (rule-constrained) CKY decoding.
  arXiv  Detail & Related papers  (2022-12-16T13:07:09Z)
• Supervised Dimensionality Reduction and Classification with Convolutional Autoencoders [1.1164202369517053]
  A Convolutional Autoencoder is combined to simultaneously produce supervised dimensionality reduction and predictions. The resulting Latent Space can be utilized to improve traditional, interpretable classification algorithms. The proposed methodology introduces advanced explainability regarding, not only the data structure through the produced latent space, but also about the classification behaviour.
  arXiv  Detail & Related papers  (2022-08-25T15:18:33Z)
• KG-FiD: Infusing Knowledge Graph in Fusion-in-Decoder for Open-Domain Question Answering [68.00631278030627]
  We propose a novel method KG-FiD, which filters noisy passages by leveraging the structural relationship among the retrieved passages with a knowledge graph. We show that KG-FiD can improve vanilla FiD by up to 1.5% on answer exact match score and achieve comparable performance with FiD with only 40% of computation cost.
  arXiv  Detail & Related papers  (2021-10-08T18:39:59Z)
• DeFRCN: Decoupled Faster R-CNN for Few-Shot Object Detection [17.326702469604676]
  Few-shot object detection aims at detecting novel objects rapidly from extremely few examples of previously unseen classes. Most existing approaches employ the Faster R-CNN as basic detection framework. We propose a simple yet effective architecture named Decoupled Faster R-CNN (DeFRCN)
  arXiv  Detail & Related papers  (2021-08-20T06:12:55Z)
• A Generalizable Model-and-Data Driven Approach for Open-Set RFF Authentication [74.63333951647581]
  Radio-frequency fingerprints(RFFs) are promising solutions for realizing low-cost physical layer authentication. Machine learning-based methods have been proposed for RFF extraction and discrimination. We propose a new end-to-end deep learning framework for extracting RFFs from raw received signals.
  arXiv  Detail & Related papers  (2021-08-10T03:59:37Z)
• A Meta-embedding-based Ensemble Approach for ICD Coding Prediction [64.42386426730695]
  International Classification of Diseases (ICD) are the de facto codes used globally for clinical coding. These codes enable healthcare providers to claim reimbursement and facilitate efficient storage and retrieval of diagnostic information. Our proposed approach enhances the performance of neural models by effectively training word vectors using routine medical data as well as external knowledge from scientific articles.
  arXiv  Detail & Related papers  (2021-02-26T17:49:58Z)
• AP-Loss for Accurate One-Stage Object Detection [49.13608882885456]
  One-stage object detectors are trained by optimizing classification-loss and localization-loss simultaneously. The former suffers much from extreme foreground-background imbalance due to the large number of anchors. This paper proposes a novel framework to replace the classification task in one-stage detectors with a ranking task.
  arXiv  Detail & Related papers  (2020-08-17T13:22:01Z)

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.