Fuzzy Intersection, Theory and Applications

Total Page:16

File Type:pdf, Size:1020Kb

Fuzzy Intersection, Theory and Applications Fuzzy Intersection, Theory and Applications Matteo Zanotto 1 Background classes young and old, leads to the following a = h + " 2 Old b = h − " 2 Y oung After being proposed by L.A. Zadeh in 1965 even when " ! 0, classifying two people with an [11][link] fuzzy set theory has been applied to a va- infinitely small difference in age as belonging to dif- riety of different fields. While debate is still ongoing ferent classes. about the rigour of this theory, several studies have Fuzzy set theory, on the other hand, guarantees been conducted on algebraic foundations of many- a smooth transition between adjacent classes al- valued logics (e.g. [5][link]) and many researchers lowing a continuous degree of membership ranging have converged to agree that, keeping clear the con- from 0, element completely out of the set, to 1, ele- ceptual distinction between many-valued logics and ment completely in the set, so that two contiguous probability theory, the subject can be approached sets overlap over a certain region in which elements with mathematical rigour. do not entirely belong to one of them. The concept The idea behind fuzzy sets theory is that of solving of degree of membership is central to fuzzy set the- some of the problems arising in the classical West- ory. For a given fuzzy set A defined over a space ern logic paradigm deriving by Aristotelian logic. X, with x being a generic element, the membership This logic proposes a binary truth value which leads function f (x) is defined as a function assigning to to the principle known as law of excluded middle A each element x its degree of membership µ (x) to which states that given any proposition either it A set A, so or its negation must be true. In terms of set the- ory this translates into a binary inclusion of ele- fA(x): x 2 X ! µA(x) 2 [0; 1] ments in a set so that given set A, either a 2 A or The ideas of degree of membership and member- a2 = A (and hence belongs to its complement). Such ship function will be widely used in the follow- a principle, though, gives rise to several well known ing sections. Further material on fuzzy set the- paradoxes generally grouped under the class of the ory can be found in the websites proposed in the Sorites paradox which suggests that if we accept \Websites" section. It is important to understand, the assumption that removing a grain from a heap though, that fuzzy set theory and fuzzy logic are of sand does not cause it to loose its state of being a not trying to offer an alternative to probability the- heap, the successive removal of one grain at a time ory since they are modelling vagueness rather then makes us categorise one grain as a heap of sand uncertainty. Keeping in mind this distinction is unless we allow the removal of a specific grain to paramount to understand which one is more appro- trigger the change in classification of the quantity priate to model the aspects of interest (see [11][link] to \some grains of sand", which is unrealistic. An- for further details). other important aspect which fuzzy set theory and fuzzy logic try to address is how to deal with the intrinsic vagueness of commonly used words such 2 Fuzzy Intersection as cold, high, big which cannot be defined in clas- sical (or crisp) set theory without introducing un- The concept of intersection in the fuzzy set frame- reasonable jumps in proximity of the boundary of work relies upon that of triangular norm (gener- the classes. As an example, it is clear that setting ally referred to as t-norm). A t-norm is a generali- a specific age (say h) as a boundary between the sation of intersection for lattices and can be defined 1 in different functional forms as long as the following fundamental properties are guaranteed: 1. Commutativity t(A; B) = t(B; A) 2. Monotonicity t(A; B) ≤ t(C; D) if A ≤ C and B ≤ D 3. Associativity t(A; t(B; C)) = t(t(A; B);C) (a) Minimum (G¨oedel-Dummett)t-norm 4. Neutrality of 1 t(A; 1) = A moreover in fuzzy logic the t-norm is also required to be a continuous function. Given these proper- ties, different types of t-norms have been proposed to implement the intersection in fuzzy set theory and three of them are by far the most important. The definitions are here given in terms of member- ship functions of x 2 X w.r.t. fuzzy sets A, B and (b) Product t-norm C = A \ B: 1. G¨oedel-Dummettt-norm fC (x) = min(fA(x); fB(x)) 2. Product t-norm fC (x) = fA(x) · fB(x) 3. Lukasiewicz t-norm fC (x) = max(0; fA(x) + fB(x) − 1) The results obtained using different t-norms on the (c)Lukasiewicz t-norm same application case can be found in some of the examples provided in a review paper by Isabelle Figure 1: Graph of different types of t-norms Bloch [3][link] regarding the application of fuzzy set (Source: [1]) theory in the field of image analysis, while some visual examples of their effects are shown in fig- ure1 where the horizontal axes represent fA(x) strict t-norm. and fB(x), and the vertical axis shows the resulting The t-norm originally proposed by Zadeh [11][link] value of fC (x). Apart from continuity, which can is the G¨oedel-Dummettt-norm (also known as the be separated in left and right continuity, t-norms minimum t-norm) and it is still the most com- can have other properties. A t-norm is said to be monly used in fuzzy sets theory. It is important Archimedean if 8x; y 2 (0; 1) 9 n 2 N such that to highlight that given this definition of intersec- tn(x) ≤ y where tn(x) indicates the application of tion and adding the corresponding definitions of the t-norm t for n times on x itself. Continuous the t-conorm used for the union operation (keep- Archimedean t-norms, then, can be divided in two ing the G¨oedel-Dummettframework for x 2 X classes: strict and nilpotent t-norms. The former and fuzzy sets A, B and C = A [ B we obtain is different from the latter having 0 as the only fC (x) = max(fA(x); fB(x))) and that of comple- nilpotent element. According to this classification ment (if c(A) is the complement of A in X we have Lukasiewicz t-norm is a nilpotent Archimedean t- fc(A)(x) = 1−fA(x)) most of the properties defined norm, while the product t-norm is an Archimedean for ordinary sets (such as De Morgan's Laws and 2 Distributive Laws of intersection w.r.t. union and background to fully understand them, the follow- vice versa) extend to fuzzy sets theory which is im- ing paragraphs are meant to give an idea of the portant for practical applications. Attention must practical use of the theoretical aspects previously be paid, though, since from the given definition of introduced. The reader is encouraged to read the complementation follows that A \ c(A) 6= ; since cited papers in order to get a detailed insight into an overlap between the two sets exists in those re- the actual implementations. gions where 0 < fA(x) < 1. This is a substantial difference from classical sets theory. 3.1 Mathematical Morphology Interestingly some work have even been proposed to extend the concepts of intersection and union Mathematical morphology is a well known theoret- to fuzzy sets defined on different universes [4][link] ical approach, mainly based on sets theory, which and the authors claim that all the usual properties allowed to create a series of techniques used in the still hold. analysis of images. Mathematical morphology had been originally formalised to work on binary (black 2.1 Extension to Logic and white) images, but has been subsequently ex- tended to grey-scale images [7][link]. While initially As for classical set theory, fuzzy set theory has this extension was based on crisp set theory, several a natural extension in logic. Therefore, the var- authors proposed to use fuzzy sets to deal more ef- ious concepts have been generalised to guarantee fectively with the grey levels which can be seen as the implementation of a structured logic. As an different degrees of membership to the black and example the degree of membership is extended to white sets [2][link][6][link][8][link]. As a result, the be the degree of truth of a proposition, intersec- original dilation and erosion in universe S of set X tion and union become and and or conjunctions, with structuring element SE and SEx representing the complement is turned into the negation of the its translation to x corresponding proposition. According to the defini- tion used for the t-norm, different propositional log- DSE(X) = fx 2 S; X \ SEx 6= ;g ics are derived. Listing applications of fuzzy logic ESE(X) = fx 2 S; SEx ⊆ Xg would leave the focus of this work on fuzzy inter- section, but plenty of literature can be found. It needed to be redefined, in fuzzy set theory, to be must be said, though, that papers rarely put much for all x 2 S attention on the formal theory and focus more on the practical aspects of applications (another rea- DSE(X)(x) = sup ft [fSE(y − x); fX (y)] ; y 2 Sg son why they will not be reported here).
Recommended publications
  • The Orthogonality Between Complex Fuzzy Sets and Its Application to Signal Detection
    Article The Orthogonality between Complex Fuzzy Sets and Its Application to Signal Detection Bo Hu 1 ID , Lvqing Bi 2 and Songsong Dai 3,* ID 1 School of Mechanical and Electrical Engineering, Guizhou Normal University, Guiyang 550025, China; [email protected] 2 School of Electronics and Communication Engineering, Yulin Normal University, Yulin 537000, China; [email protected] 3 School of Information Science and Engineering, Xiamen University, Xiamen 361005, China * Correspondence: [email protected]; Tel.: +86-592-258-0135 Academic Editor: Hsien-Chung Wu Received: 25 July 2017; Accepted: 25 August 2017; Published: 31 August 2017 Abstract: A complex fuzzy set is a set whose membership values are vectors in the unit circle in the complex plane. This paper establishes the orthogonality relation of complex fuzzy sets. Two complex fuzzy sets are said to be orthogonal if their membership vectors are perpendicular. We present the basic properties of orthogonality of complex fuzzy sets and various results on orthogonality with respect to complex fuzzy complement, complex fuzzy union, complex fuzzy intersection, and complex fuzzy inference methods. Finally, an example application of signal detection demonstrates the utility of the orthogonality of complex fuzzy sets. Keywords: orthogonality; complex fuzzy sets; complex fuzzy operations; complex fuzzy inference 1. Introduction Complex fuzzy sets [1] are an important extension of fuzzy set theory. In recent years, complex fuzzy sets have been successfully used in complex fuzzy inference systems for various applications, such as time series prediction [2–8], function approximation [9–11], and image restoration [12,13]. A complex fuzzy set A on a universe of discourse U is a mapping from U to the unit disc in the complex plane.
    [Show full text]
  • Zerohack Zer0pwn Youranonnews Yevgeniy Anikin Yes Men
    Zerohack Zer0Pwn YourAnonNews Yevgeniy Anikin Yes Men YamaTough Xtreme x-Leader xenu xen0nymous www.oem.com.mx www.nytimes.com/pages/world/asia/index.html www.informador.com.mx www.futuregov.asia www.cronica.com.mx www.asiapacificsecuritymagazine.com Worm Wolfy Withdrawal* WillyFoReal Wikileaks IRC 88.80.16.13/9999 IRC Channel WikiLeaks WiiSpellWhy whitekidney Wells Fargo weed WallRoad w0rmware Vulnerability Vladislav Khorokhorin Visa Inc. Virus Virgin Islands "Viewpointe Archive Services, LLC" Versability Verizon Venezuela Vegas Vatican City USB US Trust US Bankcorp Uruguay Uran0n unusedcrayon United Kingdom UnicormCr3w unfittoprint unelected.org UndisclosedAnon Ukraine UGNazi ua_musti_1905 U.S. Bankcorp TYLER Turkey trosec113 Trojan Horse Trojan Trivette TriCk Tribalzer0 Transnistria transaction Traitor traffic court Tradecraft Trade Secrets "Total System Services, Inc." Topiary Top Secret Tom Stracener TibitXimer Thumb Drive Thomson Reuters TheWikiBoat thepeoplescause the_infecti0n The Unknowns The UnderTaker The Syrian electronic army The Jokerhack Thailand ThaCosmo th3j35t3r testeux1 TEST Telecomix TehWongZ Teddy Bigglesworth TeaMp0isoN TeamHav0k Team Ghost Shell Team Digi7al tdl4 taxes TARP tango down Tampa Tammy Shapiro Taiwan Tabu T0x1c t0wN T.A.R.P. Syrian Electronic Army syndiv Symantec Corporation Switzerland Swingers Club SWIFT Sweden Swan SwaggSec Swagg Security "SunGard Data Systems, Inc." Stuxnet Stringer Streamroller Stole* Sterlok SteelAnne st0rm SQLi Spyware Spying Spydevilz Spy Camera Sposed Spook Spoofing Splendide
    [Show full text]
  • Fuzzy Relational Maps and Neutrosophic Relational Maps
    University of New Mexico UNM Digital Repository Faculty and Staff Publications Mathematics 2004 FUZZY RELATIONAL MAPS AND NEUTROSOPHIC RELATIONAL MAPS Florentin Smarandache University of New Mexico, [email protected] W.B. Vasantha Kandasamy [email protected] Follow this and additional works at: https://digitalrepository.unm.edu/math_fsp Part of the Algebraic Geometry Commons, Analysis Commons, and the Set Theory Commons Recommended Citation W.B. Vasantha Kandasamy & F. Smarandache. FUZZY RELATIONAL MAPS AND NEUTROSOPHIC RELATIONAL MAPS. Church Rock: Hexis, 2004. This Book is brought to you for free and open access by the Mathematics at UNM Digital Repository. It has been accepted for inclusion in Faculty and Staff Publications by an authorized administrator of UNM Digital Repository. For more information, please contact [email protected], [email protected], [email protected]. W. B. VASANTHA KANDASAMY FLORENTIN SMARANDACHE FUZZY RELATIONAL MAPS AND NEUTROSOPHIC RELATIONAL MAPS HEXIS Church Rock 2004 FUZZY RELATIONAL MAPS AND NEUTROSOPHIC RELATIONAL MAPS W. B. Vasantha Kandasamy Department of Mathematics Indian Institute of Technology, Madras Chennai – 600036, India e-mail: [email protected] web: http://mat.iitm.ac.in/~wbv Florentin Smarandache Department of Mathematics University of New Mexico Gallup, NM 87301, USA e-mail: [email protected] HEXIS Church Rock 2004 1 This book can be ordered in a paper bound reprint from: Books on Demand ProQuest Information & Learning (University of Microfilm International) 300 N. Zeeb Road P.O. Box 1346, Ann Arbor MI 48106-1346, USA Tel.: 1-800-521-0600 (Customer Service) http://wwwlib.umi.com/bod/ and online from: Publishing Online, Co.
    [Show full text]
  • Proceedings of the Third International Workshop on Neural Networks and Fuzzy Logic
    NASA Conference Publication 10111 Proceedings of the Third - _ International Workshop on Neural Networks and T_ Fuzzy Logic , k ('_ASA-CP-1OIII-Vol-2) PRQCEEOINGS N93-22206 i]F ThE TH[_O INTERNATIONAL WORKSHOP --THRU-- ON NEURAL NETWORKS AND FUZZY LOGIC, N93-22223 V_LU_E 2 (NASA) i83 p Unclas Volume II G3/63 0150400 a workshop held at ,nson Space Center Houston, Texas June 1 - 3, 1992 p_ _q_r NASA Conference Publication 10111 Proceedings of the Third International Workshop on Neural Networks and Fuzzy Logic Volume II Christopher J. Culbert, Editor NASA Lyndon B. Johnson Space Center Houston, Texas Proceedings of a workshop held at Lyndon B. Johnson Space Center Houston, Texas June 1 - 3, 1992 National Aeronautics and Space Administration January 1993 THIRD INTERNATIONAL WORKSHOP ON NEURAL NETWORKS AND FUZZY LOGIC Program Schedule Monday June 1, 1992 7:30-8:00 Registration 8:00-8:30 Robed T. Savely, Chief Scientist, Information Systems Directorate, NASA/Lyndon B. Johnson Space Center, Houston, TX. Welcoming Remarks. 8:30-9:30 Jon Erickson, Chief Scientist, Automation and Robotics Division, NASNLyndon B. Johnson Space Center, Houston, TX. Space Exploration Needs for Supervised Intelligent Systems. 9:30-9:45 Break Plenary Speakers 9:45-10:30 Piero P. Bonnisone, General Electric, Fuzzy Logic Controllers: A Knowledge-Based Systems Perspective. 10:30-11:15 Robed Farber, Los Alamos National Laboratory, Efficiently Modeling Neural Networks on Massively Parallel Computers. 11:15-1:00 Lunch pRLI_EOING P.._SE BLANK NOT RLMIED iii. w 1:00-1:30 Lawrence O. Hall and Steve G. Romaniuk, University of South Florida, Learning Fuzzy Information in a Hybrid Connectionist, Symbolic Model.
    [Show full text]
  • An Introduction to Fuzzy & Annotated Semantic Web Languages Arxiv
    An Introduction to Fuzzy & Annotated Semantic Web Languages∗ Umberto Straccia ISTI - CNR, Pisa, ITALY [email protected] Abstract We present the state of the art in representing and reasoning with fuzzy knowledge in Semantic Web Languages such as triple languages RDF/RDFS, conceptual languages of the OWL 2 family and rule languages. We further show how one may generalise them to so-called annotation domains, that cover also e.g. temporal and provenance extensions. 1 Introduction Managing uncertainty and fuzziness is growing in importance in Semantic Web re- search as recognised by a large number of research efforts in this direction [279, 285, 287, 288, 291]. Semantic Web Languages (SWL) are the languages used to provide a formal description of concepts, terms, and relationships within a given domain, among which the OWL 2 family of languages [221], triple languages RDF & RDFS [64] and rule languages (such as RuleML [138], Datalog± [68] and RIF [237]) are major players. While their syntactic specification is based on XML [313], their semantics is based arXiv:1811.05724v1 [cs.AI] 14 Nov 2018 on logical formalisms: briefly, • RDFS is a logic having intensional semantics and the logical counterpart is ρdf [219]; ∗This is an updated version of [291] and acts as accompanying material to my invited talk and slides at the 2018 Artificial Intelligence International Conference (A2IC-18). 1 • OWL 2 is a family of languages that relate to Description Logics (DLs) [4]; • rule languages relate roughly to the Logic Programming (LP) paradigm [177]; • both OWL 2 and rule languages have an extensional semantics.
    [Show full text]
  • Fuzzy Inference Systems for Risk Appraisal in Military Operational Planning Curtis B
    Air Force Institute of Technology AFIT Scholar Theses and Dissertations Student Graduate Works 3-21-2019 Fuzzy Inference Systems for Risk Appraisal in Military Operational Planning Curtis B. Nelson Follow this and additional works at: https://scholar.afit.edu/etd Part of the Operations and Supply Chain Management Commons Recommended Citation Nelson, Curtis B., "Fuzzy Inference Systems for Risk Appraisal in Military Operational Planning" (2019). Theses and Dissertations. 2311. https://scholar.afit.edu/etd/2311 This Thesis is brought to you for free and open access by the Student Graduate Works at AFIT Scholar. It has been accepted for inclusion in Theses and Dissertations by an authorized administrator of AFIT Scholar. For more information, please contact [email protected]. FUZZY INFERENCE SYSTEMS FOR RISK APPRAISAL IN MILITARY OPERATIONAL PLANNING THESIS Curtis B. Nelson, Major, USA AFIT-ENS-MS-19-M-141 DEPARTMENT OF THE AIR FORCE AIR UNIVERSITY AIR FORCE INSTITUTE OF TECHNOLOGY Wright-Patterson Air Force Base, Ohio DISTRIBUTION STATEMENT A. APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED. The views expressed in this thesis are those of the author and do not reflect the official policy or position of the United States Army, United States Air Force, Department of Defense, or the United States Government. This material is declared a work of the U.S. Government and is not subject to copyright protection in the United States. AFIT-ENS-MS-19-M-141 FUZZY INFERENCE SYSTEMS FOR RISK APRAISAL IN MILITARY OPERATIONAL PLANNING THESIS Presented to the Faculty Department of Operational Sciences Graduate School of Engineering and Management Air Force Institute of Technology Air University Air Education and Training Command In Partial Fulfillment of the Requirements for the Degree of Master of Science in Operations Research Curtis B.
    [Show full text]
  • A Fuzzy Model for Representing Uncertain, Subjective and Vague Temporal Knowledge in Ontologies
    A Fuzzy Model for Representing Uncertain, Subjective and Vague Temporal Knowledge in Ontologies G´abor Nagyp´aland Boris Motik FZI Research Center for Information Technologies at the University of Karlsruhe? Haid-und-Neu-Str. 10-14 76131 Karlsruhe, Germany fnagypal,[email protected] http://www.fzi.de Abstract. Time modeling is a crucial feature in many application do- mains. However, temporal information often is not crisp, but is uncertain, subjective and vague. This is particularly true when representing histori- cal information, as historical accounts are inherently imprecise. Similarly, we conjecture that in the Semantic Web representing uncertain temporal information will be a common requirement. Hence, existing approaches for temporal modeling based on crisp representation of time cannot be applied to these advanced modeling tasks. To overcome these difficulties, in this paper we present fuzzy interval-based temporal model capable of representing imprecise temporal knowledge. Our approach naturally subsumes existing crisp temporal models, i.e. crisp temporal relation- ships are intuitively represented in our system. Apart from presenting the fuzzy temporal model, we discuss how this model is integrated with the ontology model to allow annotating ontology definitions with time specifications. 1 Introduction Time modeling is a crucial feature in many application domains, such as medicine, history, criminal and financial applications. Its importance is shown by the nu- merous works in the area of temporal databases [1, 2] and temporal reasoning [3]. Our experience from the EU-IST sponsored VICODI project1 supports this claim fully. The main aim of this project is to develop an ontology of European history used for semantical indexing of historical documents.
    [Show full text]
  • The Implementation of Intelligent Oos Networking by the Development
    Florida State University Libraries Electronic Theses, Treatises and Dissertations The Graduate School 2003 The Implementation of Intelligent QoS Networking by the Development and Utilization of Novel Cross-Disciplinary Soft Computing Theories and Techniques Ahmed Shawky Moussa Follow this and additional works at the FSU Digital Library. For more information, please contact [email protected] THE FLORIDA STATE UNIVERSITY COLLEGE OF ARTS AND SCIENCES THE IMPLEMENTATION OF INTELLIGENT QoS NETWORKING BY THE DEVELOPMENT AND UTILIZATION OF NOVEL CROSS-DISCIPLINARY SOFT COMPUTING THEORIES AND TECHNIQUES By AHMED SHAWKY MOUSSA A Dissertation submitted to the Department of Computer Science In partial fulfillment of the requirements for The degree of Doctor of Philosophy Degree Awarded: Fall Semester, 2003 The members of the committee approve the dissertation of Ahmed Shawky Moussa Defended on September 19, 2003. ______________________ Ladislav Kohout Major Professor ______________________ Michael Kasha Outside Committee Member ______________________ Lois Wright Hawkes Committee Member ______________________ Ernest McDuffie Committee Member ______________________ Xin Yuan Committee Member The Office of Graduate Studies has verified and approved the above named committee members ii Optimization is not just a technique, or even a whole science; it is an attitude and a way of life. My mother’s life is a great example of optimization, making the best out of every thing, sometimes out of nothing. She has also been the greatest example of sacrifice, dedication, selfishness, and many other qualities, more than can be listed. I dedicate this work and all my past and future works to the strongest person I have ever known, the one who taught me, by example, what determination is, Fawkeya Ibrahim, my mother.
    [Show full text]
  • Fuzzy Inference Engi
    Blending Methodologies for Optimizing Fuzzy Inference Engine Designs Rob Chapman, Adam F. Gobi and Witold Pedrycz Department of Electrical and Computer Engineering University of Alberta Edmonton, AB T6G 2V4 {rchapman,gobia,pedrycz}@ece.ualberta.ca Abstract -- The software paradigm of writing sequential pro- the rooms, but you can not easily change the number of rooms, gramming tasks executed on a single processor has pervaded turrets or add other novel structures. computers since their dawning. In spite of progress, sequential Our development platform is a granular computer (GC): a execution of certain algorithms remain limited by this paradigm. flexible architecture and methodology for combining software In particular, fuzzy control systems involve fuzzy set operations programs and hardware engines in programmable hardware. which require significant amounts of vector and matrix computa- This ability to blend the domains of software and hardware, as tion. This computation can be considered an inherently parallel task, and performing these operations in software results in ineffi- well as program with data, will be exploited later in the paper. cient execution, severely limiting the use of fuzzy operations in The GC model for programming is a simplified, parameter- real-time systems where fast responses are required. This paper ized processor with no instruction set. As part of a design, will explore solutions to this problem using software, hardware instructions and instruction sequences, known as primitives, and finally a hybrid approach with a proposed computing archi- are either created or included from a library set, and are used to tecture and platform known as a granular computer (GC). construct sequential programs.
    [Show full text]
  • Omolbanin Yazdanbakhsh Poodeh
    Applications of Complex Fuzzy Sets in Time-Series Prediction by Omolbanin Yazdanbakhsh Poodeh A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy In Software Engineering and Intelligent Systems Department of Electrical and Computer Engineering University of Alberta © Omolbanin Yazdanbakhsh Poodeh, 2017 Abstract Complex fuzzy sets are a recent extension of type-1 fuzzy sets, whose membership functions have the unit disc of the complex plane as their co-domain. In the same vein, complex fuzzy logic is a new multi-valued logic whose truth valuation set is the unit disc. Prior research has indicated that machine-learning algorithms built using complex fuzzy logic could be very accurate in time-series forecasting. This Ph.D. dissertation investigates different designs of machine learning algorithms based on complex fuzzy logic to develop reliable and fast algorithms for time-series prediction. The machine learning algorithms designed in this dissertation are inferred from Adaptive Neuro-Complex Fuzzy Inferential System (ANCFIS). ANCFIS was the first neuro-fuzzy system to combine complex fuzzy sets and rule interference for time-series forecasting. ANCFIS uses a hybrid learning rule where consequent parameters are updated on the forward pass, and antecedent parameters on the backward pass. Some recent findings, however, indicate that published results on ANCFIS are sub-optimal. First, we propose to improve the performance of the ANCFIS by changing how we define an input window, or even using sub-sampled windows. We compare the performance of ANCFIS using three different approaches to defining an input window, across six time-series data sets.
    [Show full text]
  • Patterns of Fuzzy Rule-Based Inference Valerie Cross Systems Analysis Department, Miami University, Oxford, Ohio
    Patterns of Fuzzy Rule-Based Inference Valerie Cross Systems Analysis Department, Miami University, Oxford, Ohio Thomas Sudkamp Department of Computer Science, Wright State University, Dayton, Ohio ABSTRACT Processing information in fuzzy rule-based systems generally employs one of two patterns of inference: composition or compatibility modification. Composition origi- nated as a generalization of binary logical deduction to fuzzy logic, while compatibility modification was developed to facilitate the evaluation of rules by separating the evaluation of the input from the generation of the output. The first step in compatibility modification inference is to assess the degree to which the input matches the antecedent of a rule. The result of this assessment is then combined with the consequent of the rule to produce the output. This paper examines the relationships between these two patterns of inference and establishes conditions under which they produce equivalent results. The separation of the evaluation of input from the generation of output permits a flexibility in the methods used to compare the input with the antecedent of a rule with multiple clauses. In this case, the degree to which the input and the rule antecedent match is determined by the application of a compatibility measure and an aggregation operator. The order in which these operations are applied may affect the assessment of the degree of matching, which in turn may cause the production of different results. Separability properties are introduced to define conditions under which compatibility modification inference is independent of the input evaluation strategy. KEYWORDS: fuz~ inference, compatibility measures, approximate analogi- cal reasoning, fuzzy if-then rules 1.
    [Show full text]
  • L-Fuzzy Sets and Isomorphic Lattices: Are All the “New” Results Really New? †
    mathematics Article L-Fuzzy Sets and Isomorphic Lattices: Are All the “New” Results Really New? † Erich Peter Klement 1,* ID and Radko Mesiar 2 1 Department of Knowledge-Based Mathematical Systems, Johannes Kepler University, 4040 Linz, Austria 2 Department of Mathematics and Descriptive Geometry, Faculty of Civil Engineering, Slovak University of Technology, 810 05 Bratislava, Slovakia; [email protected] * Correspondence: [email protected]; Tel.: +43-650-2468290 † These authors contributed equally to this work. Received: 23 June 2018; Accepted: 20 August 2018; Published: 23 August 2018 Abstract: We review several generalizations of the concept of fuzzy sets with two- or three-dimensional lattices of truth values and study their relationship. It turns out that, in the two-dimensional case, several of the lattices of truth values considered here are pairwise isomorphic, and so are the corresponding families of fuzzy sets. Therefore, each result for one of these types of fuzzy sets can be directly rewritten for each (isomorphic) type of fuzzy set. Finally we also discuss some questionable notations, in particular, those of “intuitionistic” and “Pythagorean” fuzzy sets. Keywords: fuzzy set; interval-valued fuzzy set; “intuitionistic” fuzzy set; “pythagorean” fuzzy set; isomorphic lattices; truth values 1. Introduction In the paper “Fuzzy sets” [1] L. A. Zadeh suggested the unit interval [0, 1] (which we shall denote by I throughout the paper) as set of truth values for fuzzy sets, in a generalization of Boolean logic and Cantorian set theory where the two-element Boolean algebra 0, 1 is used. f g Soon after a further generalization was proposed in J.
    [Show full text]