Matrix Inference in Fuzzy Decision Trees
|
|
- Amanda Paula Hardy
- 5 years ago
- Views:
Transcription
1 Matrix Inference in Fuzzy Decision Trees Santiago Aja-Fernández LPI, ETSIT Telecomunicación University of Valladolid, Spain Carlos Alberola-López LPI, ETSIT Telecomunicación University of Valladolid, Spain Abstract A matrix method for fuzzy systems (FITM) is used to perform inferences in fuzzy decision trees (FDT). The method is applied once the tree is designed and built. Using transition matrices the output calculation is faster and some undesired weighted effects of the FDT can be avoided. Keywords: FITM, matrix inference, fuzzy decision trees. 1 Introduction Decision trees have proved to be a simple and robust method to divide the space in attributes and to make decisions based on symbolic inputs. They are by nature readily interpretable and wellsuited to classification problems [1]. A decision tree consists of nodes for testing attributes, edges for branching by values of symbols and leaves for deciding class names to be classified. Different methods have been proposed in order to create the space partitioning that will generate the tree. CART and ID3 [2] are two important algorithms to perform this task. The main ideas behind both of them coincide: partitioning the sample space in a way that depends on the data, and then representing it as a tree. Their aim is to minimize the size of the tree while they optimize some quality criterion. CART does not require an a priori partitioning. It is based on dynamically computed thresholds for continuous domains. ID3 assumes small cardinality domains and requires a priori partitioning. Umano et al [3] proposed a fuzzy extension of ID3, the fuzzy ID3 algorithm. It is to be used on a set of fuzzy data. It generates a fuzzy decision tree using the fuzzy sets defined a priori by the user. Many further studies on fuzzy trees have been reported [1, 2, 4]. In this paper we will focuse on the fuzzy inference performed once the tree is generated. As a starting point we will suppose we have a fuzzy decision tree (FDT) which has been created using some well-known technique. Our purpose is not to modify or to improve any existing algorithm, but to improve the inference method over a welldefined tree. The examples presented have been done using the fuzzy ID3 algorithm. To perform the inference we will use a recently proposed methodology based in transition matrices, known as FITM (Fast Inference using Transition Matrices) [5]. FITM is a procedure initially intended for computing with words (CWW) applications [6], but it may be of interest in other fields, such as control, image processing or hierarchical fuzzy systems (HFSs) modeling [7]. FITM methodology has been proposed to perform inferences in SAM (Standard Additive Model [8]) fuzzy systems (FSs) efficiently; it is based on representing each input to the FS as a vector, the coordinates of which are the contribution to the input of each of the elements of the input linguistic variable (LV). The authors have demonstrated that, with this assumption, a great deal of the operations that SAMs have to carry out can be precomputed and stored as transition matrices, so only a few operations have to be performed on-line, leading to a considerable reduction of the overall computational complexity of the inference 979
2 process. In FITM environments, the inputs to the FSs originally have to satisfy a property; specifically inputs are required to be linear combinations of the fuzzy sets that the input LV consists of. This requirement typically holds in CWW applications. In FDT, when the features of the samples are expressed in some descriptive language, the requirement also holds, so it should be possible to rebuild a FDT using the FITM methodology and to benefit from its associated computational savings. This paper is structured as follows. In section 2 a review of FITM procedure is carried out. In section 3 the use of the FITM methodology in FDT is introduced. Two methods of inference are proposed. In section 4 implicit and explicit rule bases are discussed. 2 FITM Background This methodology was originally proposed in [5] to perform inferences efficiently in CWW environments using SAM-FS. It is totally equivalent to the SAM inference (in terms of the output centroid) with a considerable reduction of the overall computational complexity in the inference process 1. In FITM environments each input is represented as a vector in the input space (as it was shown in [5, 10]). Its coordinates are the contribution of each fuzzy set of the input linguistic variable to the input set. The relation between sets and the rule base is coded in a small amount of matrices. The key of the method is the possibility to precompute a great deal of operations, so only a small fraction of the overall complexity of the SAM system has to be performed on line. In addition, storage needs are moderate, since only the transition matrices defined for each FS are needed to perform the inference. The intermediate data structures needed to obtain the final matrices can be discarded once these transition matrices have been calculated. 1 Although FITM procedure was originally proposed to be used in SAM FSs, a natural extension to non-linear FS has been carried out in [9]. In the following subsection, the method to build a FITM inference engine for a 2 input single output (2-ISO) FS is presented. For a MISO system see [5]. fuzzy inputs FS fuzzy output Figure 1: Input/output distribution in a FITM 2.1 Construction of matrices: 2-ISO Case Assume a 2-input single output fuzzy system as the one in Fig. 1, with inputs X and Y and output Z. The inputs and the output are all fuzzy sets defined on their respective LVs 2. First input LV consists of M possible fuzzy sets A k defined on the universe U R; the second input Y, a LV consisting of N possible fuzzy sets B l defined on the universe V R and the output LV consists of L possible fuzzy sets D n defined on the universe W R. Provided that the inputs can be expressed in vector form [5, 10] : X = Y = then the output is M β k A k = β T A k=1 N l=1 α l B l = α T B L Z = γ n D n = γ T D n=1 The whole SAM inference process can be rewritten using transition matrices as ( N ) γ = α l Ω l β (1) l=1 with Ω l the transition matrix of the system for input Y = B l. In order to build these matrices 2 When the input to a FS is a crisp value x, the activation of each fuzzy set A is µ A(x). When the input is a fuzzy set X (as opposed to a crisp value), the activation is now µ A(X) = A X, or equivalently, µ A(x) µ X(x), with a properly defined activation operator [11, 12]. 980
3 we must define some intermediate data structures that can be discarded once Ω l are calculated. First of all, we must create the activation matrix of each input; for input X it is defined 3 : R A = A 1 A 1 A 1 A M.. A M A 1 A M A M = [A 1... A M ] T [A 1... A M ] = A A T (2) with A j the different fuzzy sets of the input LV and we assume that the operation represents the sum-product composition. R B is defined accordingly for the second input. Next step is to calculate the matrices G l that bear the relation between inputs G l = R A [R B E l ] (3) where is the Kronecker tensor product, and R A and R B the activation matrices of each input. E l is a column selection vector, i.e., a column vector with all entries zero but the one at row l, the value of which is unity. This vector has the purpose of extracting column l from matrix R B. The rule base of the system is coded in matrix C. This is a selection matrix with as many rows as rules in the rule base and, for row j, all the entries are zero but the one at column i if the output consequent for rule j is D i. (If the output is not just one set, but a membership degree to each of the output sets, instead of 1 s or 0 s, each value will be the membership degree to each set). Finally, the transition matrices can be calculated as Ω l = C T G l l = 1, N (4) The output centroid, if desired, can be calculated from the output vector γ by z c = [c 1 c 2 c L ]γ [1 1 1]γ = ct γ 1 T γ (5) with c the vector of the output set centroids c i and γ as defined in (1). As previously mentioned, this centroid totally coincides with the one from the conventional SAM-FS. 3 If the input X is a crisp value instead of a fuzzy set, matrix R A becomes the identity matrix. 2.2 General Case For the case of a Multiple-input single-output (MISO) fuzzy system the expressions are extended accordingly [5]. The relation among coefficients is now given by: N 1 γ = N 2 i 1 =1 i 2 =1 N F αi 1 1 αi 2 2 αi F F Ω F j=1 i F =1 i β j (6) where α i and β are the input vectors and Ω F j=1 i j are the transition matrices of the system. 3 Matrix Inference in FDTs A sample is represented by a set of features expressed with some descriptive language. Samples used as inputs in FDTs usually have non-numeric features, which make these trees suitable for implementation using FITM. We will suppose that the input features have as attributes terms that can be expressed using natural language. The features are defined by A j, and the values they can take by F jl. Each of these values will have an associated fuzzy set. For simplicity. it will be denoted as F jl aswell. For example, if the third feature is Hair Color : A 3 = {Hair color}, F 31 =light and F 32 =dark. The output set will be Z, and Z i will be the different classes. Light Z1=0.2 Z2=0.8 1 light Z1=0.3 Z2=0.7 2 WEIGHT Middle Low dark Z1=0.7 Z2=0.3 3 Heavy Z1=0.8 Z2=0.2 4 HEIGHT Middle light Z1=0.1 Z2=0.9 Figure 2: FDT of the example 5 dark Z1=0.5 Z2=0.5 6 hight Z1=0.1 Z2=0.9 We will work with the example shown in Fig. 2 with three features: A 1 (height)= {low, middle, high}, A 2 (weight)= {light, middle, heavy} and 7 981
4 A 3 (hair)= {light, dark}, and two output classes, Z 1 and Z 2. We consider two possible inference methods using transition matrices; this is now explored. 3.1 Direct tree processing For this first method we keep the tree structure in order not to loose the visual understanding of the process. We make use of the activation matrices defined in (2) to carry out the inference in each node. The steps of the algorithm are as follows: 1. Activation matrix R A is created for each feature, according to (2). In our example: 1 h1 0 1 p1 R height = h 1 1 h 2 R hair = p 0 h w1 0 R weight = w 1 1 w 2 0 w 2 1 with h i, p i and w i the overlap degree between fuzzy sets. 2. Input feature vectors are defined according to section 2: β1 α1 h = w = p = β 2 β 3 γ 1 γ 2 γ 3 α 2 (h for height, w for weight and p for hair). For example, if an input sample is h = low, w = heavy and p = dark the input vectors will be h = [1, 0, 0] T, w = [0, 0, 1] T and p = [0, 1] T. 3. The output of each node is calculated by multiplying matrices R A and the feature vectors: [ ] T β 1 β 2 β 3 = Rheight h Output vector must be normalized by its maximum component to balance the weight of each branch in the whole process. 4. The values obtained are brought to the decision tree, as it is shown in Fig. 3 (only some results are depicted). To get the output value of each leave you just have to multiply the values in all the branches from the root to that leaf. WEIGHT γ 1 γ 2 α 1 β 1 α 2 Z 1 = 0.3α 1 γ 2 β 1 Z 2 = 0.7α 1 γ 2 β 1 γ 3 HEIGHT β 2 β 3 α 1 α 2 Z 1 = 0.1α 1 β 2 Z 2 = 0.9α 1 β 2 Z 1 = 0.1β 3 Z 2 = 0.9β 3 Figure 3: Matrix direct tree processing example. Hence, all the fuzzy inference is replaced by simple matrix multiplication. When the decision tree used is dense, the operation saving is considerable. 3.2 FITM processing Once the decision tree is created (and properly tested) and if it is going to be used in a real application, it is no longer needed to maintain the tree structure. In this section we will propose a method to compress the tree, losing interpretability by gaining compactness, speed and computational saving. The algorithm is as follows: 1. Matrices R A are created as before. 2. Composition matrices are created as in (3). In our example G ij = R height [(R weight (R hair E j )) E i ] i = 1, 2, 3 and j = 1, Construction of transition matrices Ω ij. In FITM, in order to build these matrices we need to define a rule matrix C out of a complete rule base. But usually a decision tree is equivalent to a fuzzy system with an implicit rule base. The one of the example is shown in Table. 1. Only 7 out of the 18 possible rules (3 3 2) are present. Rule 2, for example is a complete rule; it takes on values for all the features. On the other hand, rule 7 takes on values only for the first feature. The blanks for the second and the third means any value. The rule base is completed in fact, but some of its values are implicit. There are 982
5 Rule Height Weight Hair Z 1 Z 2 1 Low Light Low Middle Light Low Middle Dark Low Heavy Middle Light Middle Dark High Table 1: Implicit rule base two equivalent methods to create transition matrices from an implicit rule base: (a) To specify the full rule base. The idea is to fill the blanks in the rule base with all the possible values. In our example, rule 1 would be extended to: Rule Height Weight Hair Z 1 Z 2 1a Low Light Light b Low Light Dark Extending all the rules, we come up with a 18-rule base 4. From this base we may define matrix C C = a b b c and then the transition matrices would be Ω ij = C T G ij. (b) Compression of composition matrices. Matrix C is created according to the rule base. In our example (from Table 1): C = [ Proceeding this way there would be a discrepancy between sizes of matrices G ij and matrix C. Instead of replicating lines in the rule base, now we merge rows in matrices G ij. To do so, we must first understand the meaning of these matrices. In our example, row 1 of matrix G ij is related to the inputs {low,light,light} and row 2 to {low,light,dark}. Both values are implicit in rule 1 of table 1: {low,light,any}={low,light,(light dark)}. 4 The problem of making an implicit rule explicit is briefly studied in section 4. T ] T It is easy to prove that this union operation, if carried out by adding rows 1 and 2 in matrix G ij is totally equivalent to the extension of rules in the base proposed for the previous method. Applying this reasoning to all the rows: G ij = G ij(1) + G ij(2) G ij(3) G ij(4) G ij(5) + G ij(6) G ij(7) + G ij(9) + G ij(11) G ij(8) + G ij(10) + G ij(12) 18 k=13 Gij(k) being G ij (k) the k-th row of matrix G ij. Transition matrices are now calculated Ω ij = C T G ij 4. Output values of the whole tree are calculated using FITM: Z1 3 2 β 1 = γ Z i α j Ω ij β 2 (7) 2 i=1 j=1 β 3 4 About making rules explicit Suppose a 2-input 1-output FS, with A i (i = 1, M), B j (i = 1, N) the fuzzy sets of the input spaces and C k (k = 1, L) the fuzzy sets of the output space. This system will have a rule base with if-then rules such as If X is A i and Y is B j then Z is C k An implicit rule (for a 2ISO system) is such as If X is A i then Z is C k and it must be understood as If X is A i and Y is any then Z is C k. The rule base can be made explicit by changing adding all the possible values of B j : If X is A i and Y is B 1 then Z is C k. If X is A i and Y is B N then Z is C k The output of the system will be the same using the implicit or the explicit sure set if max-min is used. But if SAM is used the output will not be the same. For the SAM equation ωj A j (X)B r(j) (Y )C p(j) Z = ωj A j (X)B r(j) (Y ) 983
6 the implicit rule base has a term such as C k A i (X) and the explicit one C k A i (X)(B 1 (Y ) + + B N (Y )). So, an implicit rule in a SAM system is not equal to an explicit one, in fact it has a lower weight over the final result. This problem can be solved by adding a weight ω i = j B j(y ) to that rule. Note that this can also affect fuzzy decision trees. If linear operators are used, there can be some effects derived from the density of the tree. Leaves reached after a larger number of nodes can have a stronger weight than the ones reached after a small number of them. The completion of the rule base done in section 3.2 for FITM method indirectly adjusts in the best way the different weights of each branch output. 5 Conclusions A new way to work with fuzzy decision trees is introduced. The FITM method is used to carry out the inference in existing trees in two possible ways. The first one keeps the tree structure unaltered and the second makes a fusion of the tree information in a compact array of transition matrices. The key of the method is the fact that a lot of operations can be precomputed off-line to obtain the transition matrices, so actual inferences are reduced to a few on-line matrix additions and multiplications. FITM method can also avoid some weighting effects that can appear in FDT as a product of the implicit rules and the linear operators. Acknowledgments The authors acknowledge the Comisión Interministerial de Ciencia y Tecnología for research grants TIC C02-02 and TEC C03-01 and the European Commission for the funds associated to the Network of Excellence SIMILAR (FP ) References [1] A. Suárez and J. Lutsko, Globally optimal fuzzy decision trees, IEEE Trans. Pattern Anal. Mach. Intell., no. 12, pp , Dec [2] C. Janikow, Fuzzy decision trees: issues and methods, IEEE Trans. on System, Man and Cybernetics - Part B: Cybernetics, vol. 28, no. 1, pp. 1 14, Feb [3] M. Umano, H. Okamoto, I. Hatono, and H. Tamura, Fuzzy decision trees by fuzzy ID3 algorithm and its application to diagnosis systems, in Proc. of FUZZ-IEEE 94, Orlando, FL, USA, June 1994, pp [4] M. Dong and R. Kothari, Look-ahead based fuzzy decision tree induction, IEEE Trans. Fuzzy Systems, no. 3, pp , June [5] S. Aja-Fernández and C. Alberola-López, Fast inference in SAM fuzzy systems using transition matrices, IEEE Trans. Fuzzy Systems, vol. 12, no. 2, pp , Apr [6] L. A. Zadeh, Fuzzy logic = computing with words, IEEE Trans. Fuzzy Systems, vol. 4, no. 2, pp , May [7] S. Aja-Fernández and C. Alberola-López, Fuzzy hierarchical systems wih FITM, in Proc. of FUZZ-IEEE 04, Budapest, Hungary, July [8] B. Kosko, Fuzzy Engineering. New Jersey: Prentice-Hall International, [9] S. Aja-Fernández and C. Alberola-López, Fast inference using transition matrices: An extension to non-linear operators, IEEE Trans. Fuzzy Systems,, In press. [10] S. Aja-Fernández and C. Alberola-López, Inference with fuzzy granules for computing with words: A practical viewpoint, in Proc. of FUZZ-IEEE 03, St. Louis, MO, May 2003, pp [11] S. Aja-Fernández, C. Alberola-López, and G. Cybenko, A fuzzy MHT algorithm applied to text-based information tracking, IEEE Trans. Fuzzy Systems, vol. 10, no. 3, pp , June [12] G. Klir and B. Yuan, Fuzzy Sets and Fuzzy Logic. New Jersey: Prentice-Hall International,
Fuzzy If-Then Rules. Fuzzy If-Then Rules. Adnan Yazıcı
Fuzzy If-Then Rules Adnan Yazıcı Dept. of Computer Engineering, Middle East Technical University Ankara/Turkey Fuzzy If-Then Rules There are two different kinds of fuzzy rules: Fuzzy mapping rules and
More informationOptimal Solution of a Mixed type Fuzzy Transportation Problem
Intern. J. Fuzzy Mathematical Archive Vol. 15, No. 1, 2018, 83-89 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 20 March 2018 www.researchmathsci.org DOI: http://dx.doi.org/10.22457/ijfma.v15n1a8
More informationUnit V. Neural Fuzzy System
Unit V Neural Fuzzy System 1 Fuzzy Set In the classical set, its characteristic function assigns a value of either 1 or 0 to each individual in the universal set, There by discriminating between members
More informationFuzzy if-then rules fuzzy database modeling
Fuzzy if-then rules Associates a condition described using linguistic variables and fuzzy sets to a conclusion A scheme for capturing knowledge that involves imprecision 23.11.2010 1 fuzzy database modeling
More informationCHAPTER 3 FUZZY INFERENCE SYSTEM
CHAPTER 3 FUZZY INFERENCE SYSTEM Fuzzy inference is the process of formulating the mapping from a given input to an output using fuzzy logic. There are three types of fuzzy inference system that can be
More informationApproximate Reasoning with Fuzzy Booleans
Approximate Reasoning with Fuzzy Booleans P.M. van den Broek Department of Computer Science, University of Twente,P.O.Box 217, 7500 AE Enschede, the Netherlands pimvdb@cs.utwente.nl J.A.R. Noppen Department
More informationRetrieval of Web Documents Using a Fuzzy Hierarchical Clustering
International Journal of Computer Applications (97 8887) Volume No., August 2 Retrieval of Documents Using a Fuzzy Hierarchical Clustering Deepti Gupta Lecturer School of Computer Science and Information
More informationA Decision-Theoretic Rough Set Model
A Decision-Theoretic Rough Set Model Yiyu Yao and Jingtao Yao Department of Computer Science University of Regina Regina, Saskatchewan, Canada S4S 0A2 {yyao,jtyao}@cs.uregina.ca Special Thanks to Professor
More informationFUZZY INFERENCE SYSTEMS
CHAPTER-IV FUZZY INFERENCE SYSTEMS Fuzzy inference is the process of formulating the mapping from a given input to an output using fuzzy logic. The mapping then provides a basis from which decisions can
More informationExemplar Learning in Fuzzy Decision Trees
Exemplar Learning in Fuzzy Decision Trees C. Z. Janikow Mathematics and Computer Science University of Missouri St. Louis, MO 63121 Abstract Decision-tree algorithms provide one of the most popular methodologies
More informationUnsupervised Learning
Unsupervised Learning Unsupervised learning Until now, we have assumed our training samples are labeled by their category membership. Methods that use labeled samples are said to be supervised. However,
More informationA Study on Triangular Type 2 Triangular Fuzzy Matrices
International Journal of Fuzzy Mathematics and Systems. ISSN 2248-9940 Volume 4, Number 2 (2014), pp. 145-154 Research India Publications http://www.ripublication.com A Study on Triangular Type 2 Triangular
More informationFuzzy Partitioning with FID3.1
Fuzzy Partitioning with FID3.1 Cezary Z. Janikow Dept. of Mathematics and Computer Science University of Missouri St. Louis St. Louis, Missouri 63121 janikow@umsl.edu Maciej Fajfer Institute of Computing
More informationFUZZY BOOLEAN ALGEBRAS AND LUKASIEWICZ LOGIC. Angel Garrido
Acta Universitatis Apulensis ISSN: 1582-5329 No. 22/2010 pp. 101-111 FUZZY BOOLEAN ALGEBRAS AND LUKASIEWICZ LOGIC Angel Garrido Abstract. In this paper, we analyze the more adequate tools to solve many
More informationFuzzy Reasoning. Linguistic Variables
Fuzzy Reasoning Linguistic Variables Linguistic variable is an important concept in fuzzy logic and plays a key role in its applications, especially in the fuzzy expert system Linguistic variable is a
More informationApplication of fuzzy set theory in image analysis. Nataša Sladoje Centre for Image Analysis
Application of fuzzy set theory in image analysis Nataša Sladoje Centre for Image Analysis Our topics for today Crisp vs fuzzy Fuzzy sets and fuzzy membership functions Fuzzy set operators Approximate
More informationX : U -> [0, 1] R : U x V -> [0, 1]
A Fuzzy Logic 2000 educational package for Mathematica Marian S. Stachowicz and Lance Beall Electrical and Computer Engineering University of Minnesota Duluth, Minnesota 55812-2496, USA http://www.d.umn.edu/ece/lis
More information1. Fuzzy sets, fuzzy relational calculus, linguistic approximation
1. Fuzzy sets, fuzzy relational calculus, linguistic approximation 1.1. Fuzzy sets Let us consider a classical set U (Universum) and a real function : U --- L. As a fuzzy set A we understand a set of pairs
More informationFUZZY SPECIFICATION IN SOFTWARE ENGINEERING
1 FUZZY SPECIFICATION IN SOFTWARE ENGINEERING V. LOPEZ Faculty of Informatics, Complutense University Madrid, Spain E-mail: ab vlopez@fdi.ucm.es www.fdi.ucm.es J. MONTERO Faculty of Mathematics, Complutense
More informationSolving Fuzzy Travelling Salesman Problem Using Octagon Fuzzy Numbers with α-cut and Ranking Technique
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 239-765X. Volume 2, Issue 6 Ver. III (Nov. - Dec.26), PP 52-56 www.iosrjournals.org Solving Fuzzy Travelling Salesman Problem Using Octagon
More informationRanking of Octagonal Fuzzy Numbers for Solving Multi Objective Fuzzy Linear Programming Problem with Simplex Method and Graphical Method
International Journal of Scientific Engineering and Applied Science (IJSEAS) - Volume-1, Issue-5, August 215 ISSN: 2395-347 Ranking of Octagonal Fuzzy Numbers for Solving Multi Objective Fuzzy Linear Programming
More informationUnified PMU Placement Algorithm for Power Systems
Unified PMU Placement Algorithm for Power Systems Kunal Amare, and Virgilio A. Centeno Bradley Department of Electrical and Computer Engineering, Virginia Tech Blacksburg, VA-24061, USA. Anamitra Pal Network
More informationFuzzy Ant Clustering by Centroid Positioning
Fuzzy Ant Clustering by Centroid Positioning Parag M. Kanade and Lawrence O. Hall Computer Science & Engineering Dept University of South Florida, Tampa FL 33620 @csee.usf.edu Abstract We
More informationExploring Gaussian and Triangular Primary Membership Functions in Non-Stationary Fuzzy Sets
Exploring Gaussian and Triangular Primary Membership Functions in Non-Stationary Fuzzy Sets S. Musikasuwan and J.M. Garibaldi Automated Scheduling, Optimisation and Planning Group University of Nottingham,
More informationFuzzy Variable Linear Programming with Fuzzy Technical Coefficients
Sanwar Uddin Ahmad Department of Mathematics, University of Dhaka Dhaka-1000, Bangladesh sanwar@univdhaka.edu Sadhan Kumar Sardar Department of Mathematics, University of Dhaka Dhaka-1000, Bangladesh sadhanmath@yahoo.com
More informationChapter VIII.3: Hierarchical Clustering
Chapter VIII.3: Hierarchical Clustering 1. Basic idea 1.1. Dendrograms 1.2. Agglomerative and divisive 2. Cluster distances 2.1. Single link 2.2. Complete link 2.3. Group average and Mean distance 2.4.
More informationFlexibility and Robustness of Hierarchical Fuzzy Signature Structures with Perturbed Input Data
Flexibility and Robustness of Hierarchical Fuzzy Signature Structures with Perturbed Input Data B. Sumudu U. Mendis Department of Computer Science The Australian National University Canberra, ACT 0200,
More informationIntroducing fuzzy quantification in OWL 2 ontologies
Introducing fuzzy quantification in OWL 2 ontologies Francesca Alessandra Lisi and Corrado Mencar Dipartimento di Informatica, Centro Interdipartimentale di Logica e Applicazioni Università degli Studi
More informationFuzzy Inventory Model without Shortage Using Trapezoidal Fuzzy Number with Sensitivity Analysis
IOSR Journal of Mathematics (IOSR-JM) ISSN: 78-578. Volume 4, Issue 3 (Nov. - Dec. 0), PP 3-37 Fuzzy Inventory Model without Shortage Using Trapezoidal Fuzzy Number with Sensitivity Analysis D. Dutta,
More informationCHAPTER 3 FUZZY RULE BASED MODEL FOR FAULT DIAGNOSIS
39 CHAPTER 3 FUZZY RULE BASED MODEL FOR FAULT DIAGNOSIS 3.1 INTRODUCTION Development of mathematical models is essential for many disciplines of engineering and science. Mathematical models are used for
More informationEfficient Image Compression of Medical Images Using the Wavelet Transform and Fuzzy c-means Clustering on Regions of Interest.
Efficient Image Compression of Medical Images Using the Wavelet Transform and Fuzzy c-means Clustering on Regions of Interest. D.A. Karras, S.A. Karkanis and D. E. Maroulis University of Piraeus, Dept.
More informationCHAPTER 4 FUZZY LOGIC, K-MEANS, FUZZY C-MEANS AND BAYESIAN METHODS
CHAPTER 4 FUZZY LOGIC, K-MEANS, FUZZY C-MEANS AND BAYESIAN METHODS 4.1. INTRODUCTION This chapter includes implementation and testing of the student s academic performance evaluation to achieve the objective(s)
More informationCluster Analysis: Agglomerate Hierarchical Clustering
Cluster Analysis: Agglomerate Hierarchical Clustering Yonghee Lee Department of Statistics, The University of Seoul Oct 29, 2015 Contents 1 Cluster Analysis Introduction Distance matrix Agglomerative Hierarchical
More informationParameterization of triangular meshes
Parameterization of triangular meshes Michael S. Floater November 10, 2009 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to
More informationMulti Attribute Decision Making Approach for Solving Intuitionistic Fuzzy Soft Matrix
Intern. J. Fuzzy Mathematical Archive Vol. 4 No. 2 2014 104-114 ISSN: 2320 3242 (P) 2320 3250 (online) Published on 22 July 2014 www.researchmathsci.org International Journal of Multi Attribute Decision
More informationBias - variance tradeoff of soft decision trees
Bias - variance tradeoff of soft decision trees Cristina Olaru University of Liège Montefiore Institute B28 B4000, Liège, Belgium olaru@montefiore.ulg.ac.be Louis Wehenkel University of Liège Montefiore
More informationFuzzy Mod. Department of Electrical Engineering and Computer Science University of California, Berkeley, CA Generalized Neural Networks
From: AAAI-91 Proceedings. Copyright 1991, AAAI (www.aaai.org). All rights reserved. Fuzzy Mod Department of Electrical Engineering and Computer Science University of California, Berkeley, CA 94 720 1
More informationDesign of an Optimal Nearest Neighbor Classifier Using an Intelligent Genetic Algorithm
Design of an Optimal Nearest Neighbor Classifier Using an Intelligent Genetic Algorithm Shinn-Ying Ho *, Chia-Cheng Liu, Soundy Liu, and Jun-Wen Jou Department of Information Engineering, Feng Chia University,
More informationRough Approximations under Level Fuzzy Sets
Rough Approximations under Level Fuzzy Sets W.-N. Liu J.T. Yao Y.Y.Yao Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: [liuwe200, jtyao, yyao]@cs.uregina.ca
More informationCONTENT ADAPTIVE SCREEN IMAGE SCALING
CONTENT ADAPTIVE SCREEN IMAGE SCALING Yao Zhai (*), Qifei Wang, Yan Lu, Shipeng Li University of Science and Technology of China, Hefei, Anhui, 37, China Microsoft Research, Beijing, 8, China ABSTRACT
More informationfuzzylite a fuzzy logic control library in C++
fuzzylite a fuzzy logic control library in C++ Juan Rada-Vilela jcrada@fuzzylite.com Abstract Fuzzy Logic Controllers (FLCs) are software components found nowadays within well-known home appliances such
More informationINFORMATION RETRIEVAL SYSTEM USING FUZZY SET THEORY - THE BASIC CONCEPT
ABSTRACT INFORMATION RETRIEVAL SYSTEM USING FUZZY SET THEORY - THE BASIC CONCEPT BHASKAR KARN Assistant Professor Department of MIS Birla Institute of Technology Mesra, Ranchi The paper presents the basic
More informationFuzzy Set, Fuzzy Logic, and its Applications
Sistem Cerdas (TE 4485) Fuzzy Set, Fuzzy Logic, and its pplications Instructor: Thiang Room: I.201 Phone: 031-2983115 Email: thiang@petra.ac.id Sistem Cerdas: Fuzzy Set and Fuzzy Logic - 1 Introduction
More informationPartition of a Nonempty Fuzzy Set in Nonempty Convex Fuzzy Subsets
Applied Mathematical Sciences, Vol. 6, 2012, no. 59, 2917-2921 Partition of a Nonempty Fuzzy Set in Nonempty Convex Fuzzy Subsets Omar Salazar Morales Universidad Distrital Francisco José de Caldas, Bogotá,
More informationCS 204 Lecture Notes on Elementary Network Analysis
CS 204 Lecture Notes on Elementary Network Analysis Mart Molle Department of Computer Science and Engineering University of California, Riverside CA 92521 mart@cs.ucr.edu October 18, 2006 1 First-Order
More informationTOPSIS Modification with Interval Type-2 Fuzzy Numbers
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 6, No 2 Sofia 26 Print ISSN: 3-972; Online ISSN: 34-48 DOI:.55/cait-26-2 TOPSIS Modification with Interval Type-2 Fuzzy Numbers
More informationA New and Simple Method of Solving Fully Fuzzy Linear System
Annals of Pure and Applied Mathematics Vol. 8, No. 2, 2014, 193-199 ISSN: 2279-087X (P), 2279-0888(online) Published on 17 December 2014 www.researchmathsci.org Annals of A New and Simple Method of Solving
More informationData Mining Approaches to Characterize Batch Process Operations
Data Mining Approaches to Characterize Batch Process Operations Rodolfo V. Tona V., Antonio Espuña and Luis Puigjaner * Universitat Politècnica de Catalunya, Chemical Engineering Department. Diagonal 647,
More informationFINDING PATTERN BEHAVIOR IN TEMPORAL DATA USING FUZZY CLUSTERING
1 FINDING PATTERN BEHAVIOR IN TEMPORAL DATA USING FUZZY CLUSTERING RICHARD E. HASKELL Oaland University PING LI Oaland University DARRIN M. HANNA Oaland University KA C. CHEOK Oaland University GREG HUDAS
More informationThe Travelling Salesman Problem. in Fuzzy Membership Functions 1. Abstract
Chapter 7 The Travelling Salesman Problem in Fuzzy Membership Functions 1 Abstract In this chapter, the fuzzification of travelling salesman problem in the way of trapezoidal fuzzy membership functions
More informationA Brief Idea on Fuzzy and Crisp Sets
International OPEN ACCESS Journal Of Modern Engineering Research (IJMER) A Brief Idea on Fuzzy and Crisp Sets Rednam SS Jyothi 1, Eswar Patnala 2, K.Asish Vardhan 3 (Asst.Prof(c),Information Technology,
More informationOptical Character Recognition (OCR) for Printed Devnagari Script Using Artificial Neural Network
International Journal of Computer Science & Communication Vol. 1, No. 1, January-June 2010, pp. 91-95 Optical Character Recognition (OCR) for Printed Devnagari Script Using Artificial Neural Network Raghuraj
More informationThe Type-1 OWA Operator and the Centroid of Type-2 Fuzzy Sets
EUSFLAT-LFA 20 July 20 Aix-les-Bains, France The Type- OWA Operator and the Centroid of Type-2 Fuzzy Sets Francisco Chiclana Shang-Ming Zhou 2 Centre for Computational Intelligence, De Montfort University,
More informationWhat is all the Fuzz about?
What is all the Fuzz about? Fuzzy Systems CPSC 433 Christian Jacob Dept. of Computer Science Dept. of Biochemistry & Molecular Biology University of Calgary Fuzzy Systems in Knowledge Engineering Fuzzy
More informationIJISET - International Journal of Innovative Science, Engineering & Technology, Vol. 1 Issue 3, May
Optimization of fuzzy assignment model with triangular fuzzy numbers using Robust Ranking technique Dr. K. Kalaiarasi 1,Prof. S.Sindhu 2, Dr. M. Arunadevi 3 1 Associate Professor Dept. of Mathematics 2
More informationPattern Recognition Lecture Sequential Clustering
Pattern Recognition Lecture Prof. Dr. Marcin Grzegorzek Research Group for Pattern Recognition Institute for Vision and Graphics University of Siegen, Germany Pattern Recognition Chain patterns sensor
More informationAn Application of Fuzzy Matrices in Medical Diagnosis
Intern. J. Fuzzy Mathematical Archive Vol. 9, No. 2, 2015, 211-216 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 8 October 2015 www.researchmathsci.org International Journal of An Application of
More informationHybrid Fuzzy C-Means Clustering Technique for Gene Expression Data
Hybrid Fuzzy C-Means Clustering Technique for Gene Expression Data 1 P. Valarmathie, 2 Dr MV Srinath, 3 Dr T. Ravichandran, 4 K. Dinakaran 1 Dept. of Computer Science and Engineering, Dr. MGR University,
More informationChapter 4 Fuzzy Logic
4.1 Introduction Chapter 4 Fuzzy Logic The human brain interprets the sensory information provided by organs. Fuzzy set theory focus on processing the information. Numerical computation can be performed
More informationEuropean Journal of Science and Engineering Vol. 1, Issue 1, 2013 ADAPTIVE NEURO-FUZZY INFERENCE SYSTEM IDENTIFICATION OF AN INDUCTION MOTOR
ADAPTIVE NEURO-FUZZY INFERENCE SYSTEM IDENTIFICATION OF AN INDUCTION MOTOR Ahmed A. M. Emam College of Engineering Karrary University SUDAN ahmedimam1965@yahoo.co.in Eisa Bashier M. Tayeb College of Engineering
More informationOn the Use of Fuzzy Techniques for Partial Scan Insertion Based on the Testability metrics
On the Use of Fuzzy Techniques for Partial Scan Insertion Based on the Testability metrics Caro Lucas,Naghmeh Karimi Electrical and Computer Engineering University of Tehran Abstract: The chief goal of
More informationImage retrieval based on bag of images
University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 2009 Image retrieval based on bag of images Jun Zhang University of Wollongong
More informationA Compromise Solution to Multi Objective Fuzzy Assignment Problem
Volume 113 No. 13 2017, 226 235 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu A Compromise Solution to Multi Objective Fuzzy Assignment Problem
More informationLesson 3. Prof. Enza Messina
Lesson 3 Prof. Enza Messina Clustering techniques are generally classified into these classes: PARTITIONING ALGORITHMS Directly divides data points into some prespecified number of clusters without a hierarchical
More informationA Framework for Hierarchical Clustering Based Indexing in Search Engines
BIJIT - BVICAM s International Journal of Information Technology Bharati Vidyapeeth s Institute of Computer Applications and Management (BVICAM), New Delhi A Framework for Hierarchical Clustering Based
More informationReview of Fuzzy Logical Database Models
IOSR Journal of Computer Engineering (IOSRJCE) ISSN: 2278-0661, ISBN: 2278-8727Volume 8, Issue 4 (Jan. - Feb. 2013), PP 24-30 Review of Fuzzy Logical Database Models Anupriya 1, Prof. Rahul Rishi 2 1 (Department
More informationAMS /672: Graph Theory Homework Problems - Week V. Problems to be handed in on Wednesday, March 2: 6, 8, 9, 11, 12.
AMS 550.47/67: Graph Theory Homework Problems - Week V Problems to be handed in on Wednesday, March : 6, 8, 9,,.. Assignment Problem. Suppose we have a set {J, J,..., J r } of r jobs to be filled by a
More informationClassification with Diffuse or Incomplete Information
Classification with Diffuse or Incomplete Information AMAURY CABALLERO, KANG YEN Florida International University Abstract. In many different fields like finance, business, pattern recognition, communication
More informationSEGMENTATION OF SATELLITE IMAGES BY MODIFIED MOUNTAIN CLUSTERING
SEGENTATION OF SATELLITE IAGES BY ODIFIED OUNTAIN CLUSTERING.Hanmandlu, Elect. Engg. Dept., IIT Delhi Devendra Jha, SAG(DRDO)etcalfe House,Delhi Rochak Sharma, Elect. Engg. Dept., DCE Delhi Abstract Segmentation
More informationDESIGN AND EVALUATION OF MACHINE LEARNING MODELS WITH STATISTICAL FEATURES
EXPERIMENTAL WORK PART I CHAPTER 6 DESIGN AND EVALUATION OF MACHINE LEARNING MODELS WITH STATISTICAL FEATURES The evaluation of models built using statistical in conjunction with various feature subset
More informationOptimization Approach for Detecting the Critical Data on a Database
Optimization Approach for Detecting the Critical Data on a Database Prashanth Alluvada Department of Electrical Engineering University of Arkansas, Fayetteville Email: palluvad@uark.edu Abstract Through
More informationA Novel Criterion Function in Feature Evaluation. Application to the Classification of Corks.
A Novel Criterion Function in Feature Evaluation. Application to the Classification of Corks. X. Lladó, J. Martí, J. Freixenet, Ll. Pacheco Computer Vision and Robotics Group Institute of Informatics and
More informationComparative Study of Linear and Non-linear Contrast Enhancement Techniques
Comparative Study of Linear and Non-linear Contrast Kalpit R. Chandpa #1, Ashwini M. Jani #2, Ghanshyam I. Prajapati #3 # Department of Computer Science and Information Technology Shri S ad Vidya Mandal
More informationHydraulic pump fault diagnosis with compressed signals based on stagewise orthogonal matching pursuit
Hydraulic pump fault diagnosis with compressed signals based on stagewise orthogonal matching pursuit Zihan Chen 1, Chen Lu 2, Hang Yuan 3 School of Reliability and Systems Engineering, Beihang University,
More informationIdentifying fuzzy systems from numerical data with Xfuzzy
Identifying fuzzy systems from numerical data with Xfuzzy I. Baturone Instituto de Microelectrónica de Sevilla, (IMSE-CNM), y Dept. Electrónica y Electromagnetismo, Univ. de Sevilla (Spain) lumi@imse.cnm.es
More informationLook-Ahead Based Fuzzy Decision Tree Induction
IEEE TRANSACTIONS ON FUZZY SYSTEMS, VOL. 9, NO. 3, JUNE 2001 461 Look-Ahead Based Fuzzy Decision Tree Induction Ming Dong, Student Member, IEEE, and Ravi Kothari, Senior Member, IEEE Abstract Decision
More informationITFOOD: Indexing Technique for Fuzzy Object Oriented Database.
ITFOOD: Indexing Technique for Fuzzy Object Oriented Database. Priyanka J. Pursani, Prof. A. B. Raut Abstract: The Indexing Technique for Fuzzy Object Oriented Database Model is the extension towards database
More informationCLUSTER ANALYSIS. V. K. Bhatia I.A.S.R.I., Library Avenue, New Delhi
CLUSTER ANALYSIS V. K. Bhatia I.A.S.R.I., Library Avenue, New Delhi-110 012 In multivariate situation, the primary interest of the experimenter is to examine and understand the relationship amongst the
More informationA Content Based Image Retrieval System Based on Color Features
A Content Based Image Retrieval System Based on Features Irena Valova, University of Rousse Angel Kanchev, Department of Computer Systems and Technologies, Rousse, Bulgaria, Irena@ecs.ru.acad.bg Boris
More informationFEATURE EXTRACTION USING FUZZY RULE BASED SYSTEM
International Journal of Computer Science and Applications, Vol. 5, No. 3, pp 1-8 Technomathematics Research Foundation FEATURE EXTRACTION USING FUZZY RULE BASED SYSTEM NARENDRA S. CHAUDHARI and AVISHEK
More informationARTIFICIAL INTELLIGENCE. Uncertainty: fuzzy systems
INFOB2KI 2017-2018 Utrecht University The Netherlands ARTIFICIAL INTELLIGENCE Uncertainty: fuzzy systems Lecturer: Silja Renooij These slides are part of the INFOB2KI Course Notes available from www.cs.uu.nl/docs/vakken/b2ki/schema.html
More informationMachine Learning & Statistical Models
Astroinformatics Machine Learning & Statistical Models Neural Networks Feed Forward Hybrid Decision Analysis Decision Trees Random Decision Forests Evolving Trees Minimum Spanning Trees Perceptron Multi
More informationAn Efficient Method for Extracting Fuzzy Classification Rules from High Dimensional Data
Published in J. Advanced Computational Intelligence, Vol., No., 997 An Efficient Method for Extracting Fuzzy Classification Rules from High Dimensional Data Stephen L. Chiu Rockwell Science Center 049
More informationFuzzy rule-based decision making model for classification of aquaculture farms
Chapter 6 Fuzzy rule-based decision making model for classification of aquaculture farms This chapter presents the fundamentals of fuzzy logic, and development, implementation and validation of a fuzzy
More informationDifferent strategies to solve fuzzy linear programming problems
ecent esearch in Science and Technology 2012, 4(5): 10-14 ISSN: 2076-5061 Available Online: http://recent-science.com/ Different strategies to solve fuzzy linear programming problems S. Sagaya oseline
More informationTwiddle Factor Transformation for Pipelined FFT Processing
Twiddle Factor Transformation for Pipelined FFT Processing In-Cheol Park, WonHee Son, and Ji-Hoon Kim School of EECS, Korea Advanced Institute of Science and Technology, Daejeon, Korea icpark@ee.kaist.ac.kr,
More informationOptimization with linguistic variables
Optimization with linguistic variables Christer Carlsson christer.carlsson@abo.fi Robert Fullér rfuller@abo.fi Abstract We consider fuzzy mathematical programming problems (FMP) in which the functional
More informationFuzzy Systems (1/2) Francesco Masulli
(1/2) Francesco Masulli DIBRIS - University of Genova, ITALY & S.H.R.O. - Sbarro Institute for Cancer Research and Molecular Medicine Temple University, Philadelphia, PA, USA email: francesco.masulli@unige.it
More informationON SOLVING A MULTI-CRITERIA DECISION MAKING PROBLEM USING FUZZY SOFT SETS IN SPORTS
ISSN Print): 2320-5504 ISSN Online): 2347-4793 ON SOLVING A MULTI-CRITERIA DECISION MAKING PROBLEM USING FUZZY SOFT SETS IN SPORTS R. Sophia Porchelvi 1 and B. Snekaa 2* 1 Associate Professor, 2* Research
More informationKeywords hierarchic clustering, distance-determination, adaptation of quality threshold algorithm, depth-search, the best first search.
Volume 4, Issue 3, March 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Distance-based
More information3 No-Wait Job Shops with Variable Processing Times
3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select
More informationColor Content Based Image Classification
Color Content Based Image Classification Szabolcs Sergyán Budapest Tech sergyan.szabolcs@nik.bmf.hu Abstract: In content based image retrieval systems the most efficient and simple searches are the color
More informationIncorporating Known Pathways into Gene Clustering Algorithms for Genetic Expression Data
Incorporating Known Pathways into Gene Clustering Algorithms for Genetic Expression Data Ryan Atallah, John Ryan, David Aeschlimann December 14, 2013 Abstract In this project, we study the problem of classifying
More informationIntroduction 2 Fuzzy Sets & Fuzzy Rules. Aleksandar Rakić Contents
Beograd ETF Fuzzy logic Introduction 2 Fuzzy Sets & Fuzzy Rules Aleksandar Rakić rakic@etf.rs Contents Characteristics of Fuzzy Sets Operations Properties Fuzzy Rules Examples 2 1 Characteristics of Fuzzy
More informationInformation Granulation and Approximation in a Decision-theoretic Model of Rough Sets
Information Granulation and Approximation in a Decision-theoretic Model of Rough Sets Y.Y. Yao Department of Computer Science University of Regina Regina, Saskatchewan Canada S4S 0A2 E-mail: yyao@cs.uregina.ca
More informationFuzzy Logic-Based Image Processing Using Graphics Processor Units
Fuzzy Logic-Based Processing Using Graphics Processor Units R. H. Luke, D. T. Anderson, J. M. Keller Department of Computer Engineering University of Missouri Columbia, Missouri, USA {rhl3db, dtaxtd}@mizzou.edu,
More informationNovel Intuitionistic Fuzzy C-Means Clustering for Linearly and Nonlinearly Separable Data
Novel Intuitionistic Fuzzy C-Means Clustering for Linearly and Nonlinearly Separable Data PRABHJOT KAUR DR. A. K. SONI DR. ANJANA GOSAIN Department of IT, MSIT Department of Computers University School
More informationα-pareto optimal solutions for fuzzy multiple objective optimization problems using MATLAB
Advances in Modelling and Analysis C Vol. 73, No., June, 18, pp. 53-59 Journal homepage:http://iieta.org/journals/ama/ama_c α-pareto optimal solutions for fuzzy multiple objective optimization problems
More informationUsing level-2 fuzzy sets to combine uncertainty and imprecision in fuzzy regions
Using level-2 fuzzy sets to combine uncertainty and imprecision in fuzzy regions Verstraete Jörg Abstract In many applications, spatial data need to be considered but are prone to uncertainty or imprecision.
More information- A Study of Value-Added Tax -The Cases of National Taxation Bureau in the Central Area, Ministry of Finance
2014 6 14-32 - A Study of Value-Added Tax -The Cases of National Taxation Bureau in the Central Area, Ministry of Finance Chong-Si You 100 101 187 145 10 N01 101 99 101 99 1,565,847,055 100 1,703,988,545
More information