Fuzzy Approximate Reasoning Method based on Least Common Multiple and
its Property Analysis
- URL: http://arxiv.org/abs/2010.05453v1
- Date: Mon, 5 Oct 2020 07:22:28 GMT
- Title: Fuzzy Approximate Reasoning Method based on Least Common Multiple and
its Property Analysis
- Authors: I.M. Son, S.I. Kwak, M.O. Choe
- Abstract summary: The proposed method is called LCM one.
This paper analyzes its some properties, i.e., the reductive property, information loss occurred in reasoning process, and the convergence of fuzzy control.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This paper shows a novel fuzzy approximate reasoning method based on the
least common multiple (LCM). Its fundamental idea is to obtain a new fuzzy
reasoning result by the extended distance measure based on LCM between the
antecedent fuzzy set and the consequent one in discrete SISO fuzzy system. The
proposed method is called LCM one. And then this paper analyzes its some
properties, i.e., the reductive property, information loss occurred in
reasoning process, and the convergence of fuzzy control. Theoretical and
experimental research results highlight that proposed method meaningfully
improve the reductive property and information loss and controllability than
the previous fuzzy reasoning methods.
Related papers
- Causal Order Discovery based on Monotonic SCMs [5.47587439763942]
We introduce a novel sequential procedure that directly identifies the causal order by iteratively detecting the root variable.
This method eliminates the need for sparsity assumptions and the associated optimization challenges.
We demonstrate the effectiveness of our approach in sequentially finding the root variable, comparing it to methods that maximize Jacobian sparsity.
arXiv Detail & Related papers (2024-10-24T03:15:11Z) - A Unified Theory of Stochastic Proximal Point Methods without Smoothness [52.30944052987393]
Proximal point methods have attracted considerable interest owing to their numerical stability and robustness against imperfect tuning.
This paper presents a comprehensive analysis of a broad range of variations of the proximal point method (SPPM)
arXiv Detail & Related papers (2024-05-24T21:09:19Z) - On Minimum Trace Factor Analysis -- An Old Song Sung to a New Tune [0.0]
This paper introduces a relaxed version of Minimum Trace Factor Analysis (MTFA), a convex optimization method with roots dating back to the work of Ledermann in 1940.
We provide theoretical guarantees on the accuracy of the resulting low rank subspace and the convergence rate of the proposed algorithm to compute that matrix.
arXiv Detail & Related papers (2024-02-04T12:15:56Z) - Multi-modal Causal Structure Learning and Root Cause Analysis [67.67578590390907]
We propose Mulan, a unified multi-modal causal structure learning method for root cause localization.
We leverage a log-tailored language model to facilitate log representation learning, converting log sequences into time-series data.
We also introduce a novel key performance indicator-aware attention mechanism for assessing modality reliability and co-learning a final causal graph.
arXiv Detail & Related papers (2024-02-04T05:50:38Z) - Disentanglement Learning via Topology [22.33086299021419]
We propose TopDis, a method for learning disentangled representations via adding a multi-scale topological loss term.
Disentanglement is a crucial property of data representations substantial for the explainability and robustness of deep learning models.
We show how to use the proposed topological loss to find disentangled directions in a trained GAN.
arXiv Detail & Related papers (2023-08-24T10:29:25Z) - Vector-Valued Least-Squares Regression under Output Regularity
Assumptions [73.99064151691597]
We propose and analyse a reduced-rank method for solving least-squares regression problems with infinite dimensional output.
We derive learning bounds for our method, and study under which setting statistical performance is improved in comparison to full-rank method.
arXiv Detail & Related papers (2022-11-16T15:07:00Z) - False Correlation Reduction for Offline Reinforcement Learning [115.11954432080749]
We propose falSe COrrelation REduction (SCORE) for offline RL, a practically effective and theoretically provable algorithm.
We empirically show that SCORE achieves the SoTA performance with 3.1x acceleration on various tasks in a standard benchmark (D4RL)
arXiv Detail & Related papers (2021-10-24T15:34:03Z) - Weakly Supervised Disentangled Generative Causal Representation Learning [21.392372783459013]
We show that previous methods with independent priors fail to disentangle causally related factors even under supervision.
We propose a new disentangled learning method that enables causal controllable generation and causal representation learning.
arXiv Detail & Related papers (2020-10-06T11:38:41Z) - Lower bounds in multiple testing: A framework based on derandomized
proxies [107.69746750639584]
This paper introduces an analysis strategy based on derandomization, illustrated by applications to various concrete models.
We provide numerical simulations of some of these lower bounds, and show a close relation to the actual performance of the Benjamini-Hochberg (BH) algorithm.
arXiv Detail & Related papers (2020-05-07T19:59:51Z) - A Novel Fuzzy Approximate Reasoning Method Based on Extended Distance
Measure in SISO Fuzzy System [0.0]
This paper presents an original method of fuzzy approximate reasoning.
It can open a new direction of research in the uncertainty inference of Artificial Intelligence(AI) and Computational Intelligence(CI)
arXiv Detail & Related papers (2020-03-27T02:31:53Z) - Approximate MMAP by Marginal Search [78.50747042819503]
We present a strategy for marginal MAP queries in graphical models.
The proposed confidence measure is properly detecting instances for which the algorithm is accurate.
For sufficiently high confidence levels, the algorithm gives the exact solution or an approximation whose Hamming distance from the exact one is small.
arXiv Detail & Related papers (2020-02-12T07:41: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.