Computing a Transitive Opening of a Reflexive and Symmetric Fuzzy Relation
|
|
- Homer Murphy
- 5 years ago
- Views:
Transcription
1 Computing a Transitive Opening of a Reflexive and Symmetric Fuzzy Relation Luis Garmendia and Adela Salvador 2 Facultad de Informática, Dpto. de Lenguajes y Sistemas Informáticos, Universidad Complutense of Madrid, Madrid, Spain lgarmend@fdi.ucm.es 2 E.T.S.I. Caminos Canales y Puertos, Dpto. de Matemática Aplicada, Technical University of Madrid, Madrid, Spain ma09@caminos.upm.es Abstract. There are fast algorithms to compute the transitive closure of a fuzzy relation, but there are only a few different algorithms that compute transitive openings from a given fuzzy relation. In this paper a method to compute a transitive opening of a reflexive and symmetric fuzzy relation is given. Even though there is not a unique transitive opening of a fuzzy relation, it is proved that the computed transitive opening closure is maximal. Introduction The transitivity property of fuzzy relations can be understood as a threshold of a degree of relation (for example, a degree of equality) between two elements, when a degree of relation between those elements with a third one in a universe of discourse is known. The classical concept of transitivity is generalised in fuzzy logic by the T- transitivity property of fuzzy relations. Fuzzy relations are useful to represent degrees of relations between elements of a universe, and can be used to obtain consequences from a set of premises by the use of the fuzzy compositional rule of inference. Some properties of fuzzy relations give a lot of information of how the consequences are going to be. For example, when an inference is done making a fuzzy composition of a fuzzy set with a reflexive and T-transitive fuzzy relation (called T-preorder), the output contains all the inferable information. The consequences C(A) drawn by making fuzzy inference from a fuzzy set A with T- preorders are Tarski consequences that verify the fuzzy inclusion, so A C(A), monotony, so if A B then C(A) C(B), and idempotence, so C(C(A)) = C(A). Similarities can be used to represent the concept of equality, neighbourhood, generalising the classical equivalence relations. In fact, the α-cut of a similarity is a classical equivalence relation for any value α. Some applications of similarities can be found in some classification and clusterization methods to distinguish and classify objects. Fuzzy relations on a finite set can also represent labelled directed graphs. Symmetric fuzzy relations can represent weighted complete undirected graphs where the set L. Godo (Ed.): ECSQARU 2005, LNAI 357, pp , Springer-Verlag Berlin Heidelberg 2005
2 588 L. Garmendia and A. Salvador of nodes is the universe of discourse and the weighs of the edges are the relationship degrees. Given a fuzzy relation, it is well known that a unique transitive closure exists. Some proposed algorithms to compute the transitive closure of a fuzzy relation are given in Dunn [974], Kander and Yelowitz [974], Larsen and Yager [990], Guoyao Fu [992], Lee [200], Naessens, De Meyer and De Baets [2002]. An algorithms to compute T-transitive openings of fuzzy relations for any t-norm T and any fuzzy relation is given by Garmendia and Salvador [2000]. Other algorithms are given by Baets [2003] and Dawyndt [2003]. There are transitive opening of a fuzzy relation, but in general the highest transitive opening cannot be found. This paper puts forward the existence of a maximal Mintransitive opening from a reflexive and symmetric fuzzy relations, which is not unique, but there is not a transitive fuzzy relation that contains the opening and is contained in the fuzzy relation. It is given an algorithm to compute it and it is proved that such transitive opening is maximal. 2 Preliminaries Let E = {a,..., a n } be a finite set. Given a fuzzy relation R: E E [0, ], let a ij be the value of the relation degree of the elements a i and a j in E. So a ij = R(a i, a j ). A fuzzy relation R is reflexive if a ii = for all i n. The relation R is symmetric if a ij = a ji for all i, j n. Definition 2.. A fuzzy relation R: E E [0, ] is transitive (or Min-transitive) if Min(R(a, b), R(b, c)) R(a, c) for all a, b, c in E. So Min(a ik, a kj ) a ij for all i, j n. Definition 2.2. A reflexive and symmetric fuzzy relation is called a proximity relation. A similarity is a reflexive, symmetric and min-transitive fuzzy relation. Definition 2.3. The relation A includes the relation B (A B) if a ij b ij for all i, j n. Definition 2.4. Given a t-norm T and a fuzzy relation B on a finite universe there exists a unique fuzzy T-transitive relation A, called the T-transitive closure of B, that includes B, and if a fuzzy T-transitive relation includes B then it also includes A. Definition 5. Given a reflexive and symmetric fuzzy relation A on a finite universe, the a transitive opening of A is a fuzzy similarity relation B satisfying: B is included in A (B A) If any fuzzy similarity relation H includes B and is included in A then it is B. (If H; B H A then H = B). Note that it can be several maximal transitive openings of a fuzzy relations, as it is shown in figure :
3 Computing a Transitive Opening of a Reflexive and Symmetric Fuzzy Relation 589 transitive closure T R R Other transitive aproximations of R not comparable with R by the set inclusion transitive openings R T... R T n R T i Fig.. Relation of the T-transitive closure, T-transitive openings and other T-transitive approximations not comparable by In this paper it is proven that in the case of reflexive and symmetric fuzzy relations and t-norm minimum, there exists at least a maximal transitive opening. It also provides an algorithm to compute the maximal transitive opening of a reflexive and symmetric fuzzy relation. Lemma 2.. Let π be a permutation on E. If A is a similarity then the fuzzy relation P π (A) is also a fuzzy similarity. Proof. It is obvious. P π (A) is reflexive and symmetric. If a ij Min{a ik, a kj } for all i, j, k then a rs = a π(i) π(j) Min{a π(i) k, a kπ(j) } = T{a rk, a ks } for all r, s, k Example. Let π be the permutation. An example of a similarity A and its permuted similarity P π (A) is the following: 0,5 0,6 0,6 0,5 0,5 0, 6 A =, P π (A) = 0, 6 0,5 0,5 0,5 0,5 0,6 0,6 0,5 0,6 0,6 0,5 0,5 0,5 0,5 A method to build a similarity of lower dimension is given. This method allows to have an easier understanding of the algorithm to compute a transitive closure given at the end of this paper.
4 590 L. Garmendia and A. Salvador As the permutations of similarities are also similarities, it is possible to sort the elements of the universe of discourse E to decompose a similarity in boxes of subsimilarities. 3 Construction of a Fuzzy Similarity from Subsimilarities of Lower Dimension Let C and D be two similarities with dim(c) = n and dim(d) = n 2. A similarity relation R(F; C, D) of dimension n + n 2 can be constructed with the following form: C R (F; C, D) = F F T D A method for giving the bridging values e ij in F, (when j n < i ) is the assignation of a unique value, f, in all the n n 2 values if F. This value must be chosen in an interval [0, a] where a = min{min(c), min(d) }. The values in F T are the symmetric values f of the computed F. So the computed values in F are equal and satisfy that f = e ij min{min(c), min(d)}. Lemma 3.. If C and D are fuzzy similarities, then R(f; C, D) is also a fuzzy similarity, f [0, min(min(c), min(d))]. Proof. The proof is in Lee [200]. Example 2. The similarity given in example is constructed from other subsimilarities. Let T = Min, let C = and D = () be two similarities. The construction of R(F; C, D) is given by assigning equal values to a 3 and a 32 in the interval [0, ]. Those values can be, for example, a 3 = a 32 = 0,6 = f. Then R(f; C, D) = 0,6 0,6 0,6 0,6 0,6 Now let C2 = 0,6 and D = (), then the new values in F must be chosen equal in the interval [0, 0,6]. If a 4 = a 42 = a 43 = 0,5 = f is chosen then 0,6 0,6 0,6 0,5 R2(f; C2, D) = 0,6 0,5, which is the similarity given in example. 0,6 0,6 0,5 0,5 0,5 0,5
5 Computing a Transitive Opening of a Reflexive and Symmetric Fuzzy Relation 59 The lowest similarity constructed from C and D is the following: 0 R3(f; C, D) = 0 and R4(f; R3, D) = The highest similarity constructed from C and D is the following: R5(f; C, D) = and R6(f; R5, D) = Lemma 3.2. If B n n is a fuzzy similarity, then there exists a decomposition such that B n n = P π (R(f; C n n, D n2 n2 )). Proof. The proof is in Lee [200]. 4 Generation and Decomposition of a Given Similarity A similarity with dimension greater than one can be generated from two subsimilarities. If those subsimilarities are also of dimension greater than one, it is possible to decompose them on other subsimilarities, and so on. The following method of reasoning generates a given similarity using this decomposability concept in a reverse order. A first similarity of dimension two is created by using the greatest non-diagonal values and more similarities keep adding in such a way that the desired similarity is obtained. Method to Generate a Given Similarity Let A be a similarity on an universe E. Let U(A) be the set of the upper triangular values of A sorted in a decreasing order. The method gives sub similarities B k on the elements of E with the highest values in A. First step: Let a ij be the highest value in the list U(A). The first dimension 2 similarity A is created on the Cartesian Product of {e i, e j }, forcing it to be reflexive and symmetric. So A = B = a ij a ij Step k: Let a ij k be the highest value in U(A) not already computed. Then a similarity B k+ and other similarity A k whose dimension n k depends on the position (i, j) of a ij k are created from B k. Such position defines a partition of the subset of natural numbers
6 592 L. Garmendia and A. Salvador E k = {, 2,..., n +n 2 + +n k } into two disjoint sets I and I in a way that the elements a ij in B k- verify that (i, j) I I, the elements of the new similarity box A k verify that (i, j) I I, and so the elements in the bridging box F are f ij = b ij, where (i, j) I I. B The step 2 makes a similarity B 2 with the shape A 2 And step k makes a similarity with the shape B k- A k B F B F k- F A F A T T k 2 or with the shape or with the shape The sets I and I are defined from the indexes (i, j) of the chosen highest not computed a ij k in U(A) as follows: I = {j; b rj is computed in B k- } and I = {i; b is is computed in B k- }. As the generated similarities B k must be always reflexive, it must be considered that all the values of the diagonal of B k are already computed. Then the elements of F and F T can be computed in every step as follows: Set b ij = b ji = min{a ij, where i I and j I }, for all (i, j) I I. Example 3. Let A be the similarity given by the following matrix: A = 0,3 0,3 0,7 0,3 0,7 0,3 0,3 0,3 0,3 0,3 To generate A (or to decompose A in similarities) the greatest element in U(A), which is = a 2 is chosen, so A = = B. In the second step the second greatest element in U(A), which is 0,7 = a 34 is chosen, so I = {j; b 3j is computed in the new B}={3} and I = {i; b i4 is computed in the new B}={4}. Then b 34 = b 43 = min {a ij, where i I and j I } = 0,7 for all (i, j) I I. So B 2 = 0,7 0,7
7 Computing a Transitive Opening of a Reflexive and Symmetric Fuzzy Relation 593 In the next step the next greatest element in U(A), which is = a 3 is chosen, so I = {j; b j is computed in B 2 }={, 2} and I = {i; b i3 is not computed in B 2 }={3, 4}. Then b ij = b ji = min {a ij, where i I and j I } = for all (i, j) I I. So B 3 = 0,7 0,7 In the next step, the greatest element in U(A) is 0,3 = a 5, so I={5} and I ={, 2, 3, 4} So B 4 = 0,3 0,3 0,7 0,7 0,3 0,3 0,7 F 0,3 0,3 = A. 0,3 0,3 () 0,7 F T = 5 Algorithm to Compute a Maximal Transitive Opening of a Reflexive and Symmetric Fuzzy Relation Input: a reflexive and symmetric fuzzy relation A = [aij] Output: a similarity B that is a transitive opening of A Step. Set B to be initially blank. Step 2. Sort the elements of U(A) in descendent order. Step 3. Set b ii = for i from to n. Step 4. While there is a blank in B do Let a rs be the highest value of the list U(A). If b rs is blank, Let I = {j; b rj is not blank} and I = {i; b is is not blank}. Let f = Min{a ij, i I, j I }. Set b ij = b ji = f where i I and j I. Delete the highest value from U(A).
8 594 L. Garmendia and A. Salvador Example 4. Given the following proximity fuzzy relation: 0,7 0,8 A = 0,7 0, 2 0,3 0,8 0, 2 0,7 0,3 0, 7 The algorithm is applied to compute a transitive opening B as follows. Step : Set B to be blank Step 2: Let U(A) be the set of elements of the upper triangular matrix of A sorted in descending order. U(A) = {; 0,8; 0,7; 0,7; 0,3; 0,2}. Step 3: Set b ii = for all i. Step 4: The greatest value of U(A), a 4 =, is taken. Let I = {j; b j that are not blank values in matrix B} = {} and let I = {i; b i4 that are not blank in matrix B} = {4}. The values b 4 = b 4 = a 4 = are computed in B. B = The next highest element in U(A) is 0,8 = a 3. I = {j; b j are not blank in B} = {, 4} and I = {i; b i3 is not blank in B} = {3} are defined and the values b 3, b 43 and its symmetric values, having b 3 = b 43 = Min{a ij, i I, j I } = Min{0,8; 0,7} = 0,7 are computed in B. B = 0,7 0,7 0,7 0,7 The next non-blank highest element in U(A) is 0,7 = a 2. I = {j; b j are not blank in B} = {, 3, 4} and I = {i; b i2 is not blank in B } = {2} are defined and the values b 2, b 32, b 42 and its symmetric values, having b 2 = b 32 = b 42 = Min{a ij, i I, j I } = Min{0,7; 0,3; 0,2} = 0,2 are computed in B. So B = 0,2 0,7 0,2 0,2 0,2 0,7 0,2 0,7 0,2 is a transitive opening of A. 0,7
9 Computing a Transitive Opening of a Reflexive and Symmetric Fuzzy Relation 595 An easier aspect of the similarity is shown making boxes of subsimilarities after 0,8 0, applying the permutation π =, then P π (A)= 0,7 0, ,8 0,7 0,2 0,7 0,3 0,2 and a maximal transitive opening is P π (B) = 0,7 0,2 0,7 0,7 0,7 0,2 0,2 0,2 0,2 0,2 Example 5. Given the following proximity fuzzy relation: 0, 0,2 0,5 A = 0, 0, 4 0, 0, 2 0, 4 0, 0, 5 0, 0, The algorithm is applied to compute a transitive opening B. Step : Set B to be blank Step 2: Let U(A) be the set of elements of the upper triangular matrix of A, sorted in descending order. U(A) = {0,5; ; 0,2; 0,; 0,; 0,}. Step 3: Set b ii = for all i. Step 4: The highest value of U(A), a 4 = 0,5 is taken t. Let I = {j; b j that are not blank values in matrix B} = {} and let I = {i; b i4 that are not blank in matrix B} = {4}. The values b 4 = b 4 = a 4 = 0,5 are computed in B. B = 0,5 0,5 The following highest element in U(A) is = a 23. I = {j; b 2j are not blank in B} = {2} and I = {i; b i3 is not blank in B} = {3} are defined. It is computed in B the value b 23 and its symmetric value, having b 23 = a 23 =. B = 0,5 0,5
10 596 L. Garmendia and A. Salvador The following non-blank highest element in U(A) is 0,2 = a 3. I = {j; b j are not blank in B} = {, 4} and I = {i; b i3 is not blank in B } = {2, 3} are defined. The values b 2, b 3, b 42, b 43 and its symmetric values, having b 2 = b 3 = b 42 = b 43 = Min{a ij, i I, j I } = Min{0,; 0,2; 0,; 0,} = 0, are computed in B. B = 0, 0, 0,5 0, 0, 0, 0, 0,5 0, 0, An easier view of the similarity is shown after applying the permutation π = 0,5 0,2 0, 2 3 4, then P π (A)= 0,5 0, 0, and a maximal transitive opening is ,2 0, 0, 0, P π (B) = 0,5 0, 0, 0,5 0, 0, 0, 0, 0, 0, The following lemmas show that the previous algorithm gives a maximal transitive opening of a reflexive and symmetric fuzzy relation. Lemma 5.. The output of the Algorithm applied to a reflexive and symmetric fuzzy relation is a fuzzy similarity relation Proof. The proof is trivial from lemma 3. and lemma 3.2. Lemma 5.2. Let A be a reflexive and symmetric fuzzy relation, and let B be the output of the previous algorithm applied to A. If any fuzzy similarity relation H includes B and is included in A then it is B (for all similarity H, if B H A then H = B. Proof. Let H = (h ij ) be a fuzzy similarity relation such that B H A. So b ij h ij a ij for all i, j. If B H then (r, s) such that b rs < h rs a rs. (2) Let I, I be the set of indexes given by the algorithm in the step in which b rs is generated. Then (r, s) I I. As B is computed by the algorithm, b rs is generated from the value of some a kl. (k, l) I I such that b kl = a kl = f = Min{a ij, i I, j I } = b rs. (3) H is transitive, so h kl max{min{h k, h l },..., min{h kn, h nl }}
11 Computing a Transitive Opening of a Reflexive and Symmetric Fuzzy Relation 597 B H A, and the values in the indexes I I are always lower than the values in I I and I I, so h kl max{min{h k, h l },..., min{h kn, h nl }} = max{h kj, h il } i I, j I For i = r it is held that h kl h rl, so h rl max{min{h r, h l },..., min{h rn, h nl }} = max{h rj, h il } i I, j I In particular, for j = s, it is held that h kl h rl h rs. But H A, so h rs h kl a kl = b kl = b rs. This is contradictory to (2). Thus, any fuzzy similarity H such that B H A verifies that H = B. Therefore, the algorithm computes a maximal similarity from a reflexive and symmetric fuzzy relation, which is a transitive opening. Lemma 5.3. A maximal transitive opening of a reflexive and symmetric fuzzy relation can be computed in O(n 2 log n) time in the worst case. Proof. The computational complexity of the time consumed by the given algorithm is analysed as follows: Step 2 sorts n 2 n 2 values, so it takes O(n 2 log n) time. The loop in step 4 iterates at most n- times, so it iterates O(n) times in the worst case. When a dimension box is added in an iteration, the maximum number of computed bridging elements is n-, so the computation of the bridging elements takes O(n) time in the worst case. Hence the total time spent in step 4 when all new boxes are of dimension one is O(n 2 ) time in the worst case. When the new box has dimension k, then the computation is on (n-) k values in the worst case, which have the same computational complexity than computing sorting at most (n-) values k times, so the total computational complexity of step 4 is O(n 2 ) time in the worst case. Therefore, the complexity of the time consumed by the algorithm is O(n 2 log n) time. 6 Conclusions Giving a proximity relation on a finite universe, there exists a unique transitive similarity (called transitive closure) that contains it and that is contained in any similarity that contains the proximity relation. It is well know how to compute the transitive closure of a fuzzy relation, but there exists several maximal similarities that are contained in the original proximity relation, that are called transitive openings. An open problem is the computation of transitive openings, but in general there is not a unique solution, and so in general it is not possible to find the highest transitive opening a given fuzzy relation. In this paper it is proven that in the case of reflexive and symmetric fuzzy relations (proximity relation) that there exists at least a transitive opening (a maximal similarity relation). An O(n 2 log n) time algorithm to compute a transitive opening of a prox-
12 598 L. Garmendia and A. Salvador imity relation is given, and it is proven that the output is maximal, showing that there are not transitive solutions in between the initial reflexive and symmetric fuzzy relation and the computed similarity. Acknowledgment This research is partially supported by the Spanish MCyT project BFM References. Alsina, C., Trillas, E., Valverde, L. On some logical connectives for fuzzy set theory, J. Math. Ann. Appl. 93 (983) De Baets, B. and De Meyer, H, Transitive approximation of fuzzy relations by alternating closures and openings, Soft Computing 7 (2003) Esteva, F, Garcia, P., Godo, L., Rodriguez, R. O., Fuzzy approximation relations, modal structures and possibilistic logic, Mathware and Soft Computing 5 (2-3) (998) Dawyndt, P., De Meyer, H., De Baets, B. The complete linkage clustering algorithm revisited, Soft Computing, in press (available on-line). 5. Di Nola, A., Kolodziejczyk, W., Sessa, S. Transitive solutions of relational equations on finite sets and linear latices. Lecture Notes in Computer Science, Vol.52 Springer, Berlin (99) Dunn, J. C. Some recent investigations of a new fuzzy partitioning algorithm and its application to pattern classification problems, J. Cybernet. 4 (974) Garmendia, L., Campo, C., Cubillo, S., Salvador, A. A Method to Make Some Fuzzy Relations T-Transitive. International Journal of Intelligence Systems. Vol. 4, Nº 9, (999) Garmendia, L., Salvador, A. On a new method to T-transitivize fuzzy relations, Information Processing and Management of Uncertainty in Knowledge - based Systems, IPMU (2000) Garmendia, L., Salvador, A. On a new method to T-transitivize fuzzy relations, in Technologies for Constructing Intelligent Systems 2, Springer. Edited by Bouchon-Meunier, B., Gutierrez-Rios, J., Magdalena, L., Yager, R. R, (2000) Guoyao Fu, An algorithm for computing the transitive closure of a fuzzy similarity matrix, Fuzzy Sets and Systems 5 (992) Hashimoto, H. Transitivity of generalised fuzzy matrices, Fuzzy Sets and Systems. Vol. 7, no., (985) Jacas, J., Similarity relations. The calculation of minimal generating families. Fuzzy Sets and Systems 35 (990) Kandel, L. Yelowitz, Fuzzy chains, IEEE Trans. Systems Man Cybernet. 4 (974) Larsen H., R. Yager, Efficient computation of transitive closures, Fuzzy Sets Syst., vol. 38 (990) Lee, H.-S. An optimal algorithm for computing the max min transitive closure of a fuzzy similarity matrix, Fuzzy Sets and Systems 23 (200) Naessens, H., De Meyer, H., De Baets, B., Algorithms for the Computation of T- Transitive Closures, IEEE Trans Fuzzy Systems 0:4 (2002) Ovchinnikov, S. Representations of Transitive Fuzzy Relations, in Aspects of Vagueness, H. J. Skala, S. Termini and E. Trillas (Eds.), Reidel Pubs. (984) 05-8.
13 Computing a Transitive Opening of a Reflexive and Symmetric Fuzzy Relation Rodriguez, R. O., Esteva, F, Garcia, P., Godo, L. On implicative closure operators in approximate reasoning. International Journal of Approximate Reasoning 33 (2003) Wagenknecht, M., On pseudo-transitive approximations of fuzzy relations. Fuzzy Sets and Systems 44 (99) Wagenknecht, M., On transitive solutions of fuzzy equations, inequalities and lower approximation of fuzzy relations. Fuzzy Sets and Systems 75 (995) Xian Xiao, An algorithm for calculating fuzzy transitive closure, Fuzzy Math. 5 (4) (985) Zadeh, L. A., Similarity relations and fuzzy orderings, Inform. Sci. 3 (97)
An Algorithm to compute a T-transitive approximation of a reflexive and symmetric fuzzy relation
An Algorithm to compute a T-transitive approximation of a reflexive and symmetric fuzzy relation Luis Garmendia Facultad de Informática Dept. Sistemas Informáticos y Programación Universidad Complutense
More informationA CLASSIFICATION METHOD BASED ON INDISTINGUISHABILITIES
A CLASSIFICATION METHOD BASED ON INDISTINGUISHABILITIES Luis Garmendia E.T.S.I. Caminos Dpto. de Matemática Aplicada. and IBM Learning Services. luisgarmendia@es.ibm.com Adela Salvador E.T.S.I. Caminos
More informationAggregation Operators and Fuzzy Measures. Classifying Fuzzy Measures, L.Garmendia. On a characterization of IF probability, J.Petrovicova, B.
MDAI 2006 file://d:\index.htm Página 1 de 1 15/03/2007 Modelin List of papers Preface Support General chairs and program committee Organising Committee List of papers Program ISBN: 84-00-08415-2 NIPO:
More informationThe Evolution of the Concept of Fuzzy Measure.
The Evolution of the Concept of Fuzzy Measure. Luis Garmendia Facultad de Informática, Dep. Sistemas Informáticos y Programación, Universidad Complutense of. Madrid, Spain, E-mail: lgarmend@fdi.ucm.es,
More informationConditional Belief Functions: a Comparison among Different Definitions
Conditional Belief Functions: a Comparison among Different Definitions Giulianella Coletti Marcello Mastroleo Dipartimento di Matematica e Informatica University of Perugia (coletti,mastroleo)@dipmat.unipg.it
More informationSolution of Fuzzy Maximal Flow Network Problem Based on Generalized Trapezoidal Fuzzy Numbers with Rank and Mode
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 9, Issue 7 (January 2014), PP. 40-49 Solution of Fuzzy Maximal Flow Network Problem
More informationFuzzy relation equations with dual composition
Fuzzy relation equations with dual composition Lenka Nosková University of Ostrava Institute for Research and Applications of Fuzzy Modeling 30. dubna 22, 701 03 Ostrava 1 Czech Republic Lenka.Noskova@osu.cz
More informationThe Domination Relation Between Continuous T-Norms
The Domination Relation Between Continuous T-Norms Susanne Saminger Department of Knowledge-Based Mathematical Systems, Johannes Kepler University Linz, Altenbergerstrasse 69, A-4040 Linz, Austria susanne.saminger@jku.at
More informationFinitely Valued Indistinguishability Operators
Finitely Valued Indistinguishability Operators Gaspar Mayor 1 and Jordi Recasens 2 1 Department of Mathematics and Computer Science, Universitat de les Illes Balears, 07122 Palma de Mallorca, Illes Balears,
More informationMathematical Approach to Vagueness
International Mathematical Forum, 2, 2007, no. 33, 1617-1623 Mathematical Approach to Vagueness Angel Garrido Departamento de Matematicas Fundamentales Facultad de Ciencias de la UNED Senda del Rey, 9,
More informationMatrices and Vectors
Matrices and Vectors James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University November 11, 2013 Outline 1 Matrices and Vectors 2 Vector Details 3 Matrix
More informationKybernetika. Margarita Mas; Miquel Monserrat; Joan Torrens QL-implications versus D-implications. Terms of use:
Kybernetika Margarita Mas; Miquel Monserrat; Joan Torrens QL-implications versus D-implications Kybernetika, Vol. 42 (2006), No. 3, 35--366 Persistent URL: http://dml.cz/dmlcz/3579 Terms of use: Institute
More informationThe problem of distributivity between binary operations in bifuzzy set theory
The problem of distributivity between binary operations in bifuzzy set theory Pawe l Drygaś Institute of Mathematics, University of Rzeszów ul. Rejtana 16A, 35-310 Rzeszów, Poland e-mail: paweldr@univ.rzeszow.pl
More informationThe doubly negative matrix completion problem
The doubly negative matrix completion problem C Mendes Araújo, Juan R Torregrosa and Ana M Urbano CMAT - Centro de Matemática / Dpto de Matemática Aplicada Universidade do Minho / Universidad Politécnica
More informationIntuitionistic Fuzzy Sets: Spherical Representation and Distances
Intuitionistic Fuzzy Sets: Spherical Representation and Distances Y. Yang, F. Chiclana Centre for Computational Intelligence, School of Computing, De Montfort University, Leicester LE1 9BH, UK Most existing
More information5. Partitions and Relations Ch.22 of PJE.
5. Partitions and Relations Ch. of PJE. We now generalize the ideas of congruence classes of Z to classes of any set X. The properties of congruence classes that we start with here are that they are disjoint
More informationFavoring Consensus and Penalizing Disagreement in Group Decision Making
Favoring Consensus and Penalizing Disagreement in Group Decision Making Paper: jc*-**-**-**** Favoring Consensus and Penalizing Disagreement in Group Decision Making José Luis García-Lapresta PRESAD Research
More informationIntuitionistic Fuzzy Sets: Spherical Representation and Distances
Intuitionistic Fuzzy Sets: Spherical Representation and Distances Y. Yang, F. Chiclana Abstract Most existing distances between intuitionistic fuzzy sets are defined in linear plane representations in
More informationAlgorithms for Increasing of the Effectiveness of the Making Decisions by Intelligent Fuzzy Systems
Journal of Electrical Engineering 3 (205) 30-35 doi: 07265/2328-2223/2050005 D DAVID PUBLISHING Algorithms for Increasing of the Effectiveness of the Making Decisions by Intelligent Fuzzy Systems Olga
More informationNumerical Solution of Fuzzy Differential Equations
Applied Mathematical Sciences, Vol. 1, 2007, no. 45, 2231-2246 Numerical Solution of Fuzzy Differential Equations Javad Shokri Department of Mathematics Urmia University P.O. Box 165, Urmia, Iran j.shokri@mail.urmia.ac.ir
More informationAggregation and Non-Contradiction
Aggregation and Non-Contradiction Ana Pradera Dept. de Informática, Estadística y Telemática Universidad Rey Juan Carlos. 28933 Móstoles. Madrid. Spain ana.pradera@urjc.es Enric Trillas Dept. de Inteligencia
More informationMax-max operation on intuitionistic fuzzy matrix. Riyaz Ahmad Padder, P. Murugadas
Annals of Fuzzy Mathematics and Informatics Volume x, No. x, (Month 201y), pp. 1 xx ISSN: 2093 9310 (print version) ISSN: 2287 6235 (electronic version) http://www.afmi.or.kr @FMI c Kyung Moon Sa Co. http://www.kyungmoon.com
More informationDEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix to upper-triangular
form) Given: matrix C = (c i,j ) n,m i,j=1 ODE and num math: Linear algebra (N) [lectures] c phabala 2016 DEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix
More informationA NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES
Journal of Mathematical Sciences: Advances and Applications Volume, Number 2, 2008, Pages 3-322 A NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES Department of Mathematics Taiyuan Normal University
More informationMatrix period in max-drast fuzzy algebra
Matrix period in max-drast fuzzy algebra Martin Gavalec 1, Zuzana Němcová 2 Abstract. Periods of matrix power sequences in max-drast fuzzy algebra and methods of their computation are considered. Matrix
More informationGroup Decision-Making with Incomplete Fuzzy Linguistic Preference Relations
Group Decision-Making with Incomplete Fuzzy Linguistic Preference Relations S. Alonso Department of Software Engineering University of Granada, 18071, Granada, Spain; salonso@decsai.ugr.es, F.J. Cabrerizo
More informationComputing and Communicating Functions over Sensor Networks
Computing and Communicating Functions over Sensor Networks Solmaz Torabi Dept. of Electrical and Computer Engineering Drexel University solmaz.t@drexel.edu Advisor: Dr. John M. Walsh 1/35 1 Refrences [1]
More informationInverted Fuzzy Implications in Backward Reasoning Without Yager Implication
Inverted Fuy Implications in Backward Reasoning Without Yager Implication Zbigniew Suraj 1 and Agnieska Lasek 1 Chair of Computer Science, Faculty of Mathematics and Natural Sciences, University of Resow,
More informationProperties of intuitionistic fuzzy line graphs
16 th Int. Conf. on IFSs, Sofia, 9 10 Sept. 2012 Notes on Intuitionistic Fuzzy Sets Vol. 18, 2012, No. 3, 52 60 Properties of intuitionistic fuzzy line graphs M. Akram 1 and R. Parvathi 2 1 Punjab University
More informationAn Analysis on Consensus Measures in Group Decision Making
An Analysis on Consensus Measures in Group Decision Making M. J. del Moral Statistics and Operational Research Email: delmoral@ugr.es F. Chiclana CCI Faculty of Technology De Montfort University Leicester
More informationFuzzy Modal Like Approximation Operations Based on Residuated Lattices
Fuzzy Modal Like Approximation Operations Based on Residuated Lattices Anna Maria Radzikowska Faculty of Mathematics and Information Science Warsaw University of Technology Plac Politechniki 1, 00 661
More informationRepresenting Independence Models with Elementary Triplets
Representing Independence Models with Elementary Triplets Jose M. Peña ADIT, IDA, Linköping University, Sweden jose.m.pena@liu.se Abstract An elementary triplet in an independence model represents a conditional
More informationResolution of fuzzy relation equations with sup-inf composition over complete Brouwerian lattices a review
Resolution of fuzzy relation equations with sup-inf composition over complete Brouwerian lattices a review Xue-ping Wang 1 Feng Sun 1 1.Department of Mathematics, Sichuan Normal University Chengdu, Sichuan
More informationTriple-acyclicity in majorities based on difference in support
MPRA Munich Personal RePEc Archive Triple-acyclicity in majorities based on difference in support Bonifacio Llamazares and Patrizia Pérez-Asurmendi University of Valladolid 01 Online at http://mpra.ub.uni-muenchen.de/518/
More informationRelations Graphical View
Introduction Relations Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Recall that a relation between elements of two sets is a subset of their Cartesian
More informationTransformation-Based Constraint-Guided Generalised Modus Ponens
Transformation-Based Constraint-Guided Generalised Modus Ponens Michaël Blot, Marie-Jeanne Lesot, Marcin Detyniecki Sorbonne Universités, LIP6, UPMC Univ Paris 06, CNRS, UMR 7606 F-75005, Paris, France
More informationFuzzy Function: Theoretical and Practical Point of View
EUSFLAT-LFA 2011 July 2011 Aix-les-Bains, France Fuzzy Function: Theoretical and Practical Point of View Irina Perfilieva, University of Ostrava, Inst. for Research and Applications of Fuzzy Modeling,
More informationNON-MONOTONIC FUZZY REASONING J.L. CASTRO, E. TRILLAS, J.M. ZURITA. Technical Report #DECSAI-951
NON-MONOTONIC FUZZY REASONING J.L. CASTRO, E. TRILLAS, J.M. ZURITA Technical Report #DECSAI-951 NOVEMBER, 1995 Non-Monotonic Fuzzy Reasoning J.L Castro, E. Trillas, J.M. Zurita Depto. Ciencias de la Computacion
More informationApplying Bayesian networks in the game of Minesweeper
Applying Bayesian networks in the game of Minesweeper Marta Vomlelová Faculty of Mathematics and Physics Charles University in Prague http://kti.mff.cuni.cz/~marta/ Jiří Vomlel Institute of Information
More informationA note on W 1,p estimates for quasilinear parabolic equations
200-Luminy conference on Quasilinear Elliptic and Parabolic Equations and Systems, Electronic Journal of Differential Equations, Conference 08, 2002, pp 2 3. http://ejde.math.swt.edu or http://ejde.math.unt.edu
More informationENERGY OF A COMPLEX FUZZY GRAPH
International J. of Math. Sci. & Engg. Appls. (IJMSEA) ISSN 0973-9424, Vol. 10 No. I (April, 2016), pp. 243-248 ENERGY OF A COMPLEX FUZZY GRAPH P. THIRUNAVUKARASU 1, R. SURESH 2 AND K. K. VISWANATHAN 3
More informationIntrinsic products and factorizations of matrices
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences
More informationarxiv:math/ v1 [math.fa] 21 Mar 2000
SURJECTIVE FACTORIZATION OF HOLOMORPHIC MAPPINGS arxiv:math/000324v [math.fa] 2 Mar 2000 MANUEL GONZÁLEZ AND JOAQUÍN M. GUTIÉRREZ Abstract. We characterize the holomorphic mappings f between complex Banach
More informationAnn. Funct. Anal. 5 (2014), no. 2, A nnals of F unctional A nalysis ISSN: (electronic) URL:
Ann Funct Anal 5 (2014), no 2, 127 137 A nnals of F unctional A nalysis ISSN: 2008-8752 (electronic) URL:wwwemisde/journals/AFA/ THE ROOTS AND LINKS IN A CLASS OF M-MATRICES XIAO-DONG ZHANG This paper
More informationEfficient Approximate Reasoning with Positive and Negative Information
Efficient Approximate Reasoning with Positive and Negative Information Chris Cornelis, Martine De Cock, and Etienne Kerre Fuzziness and Uncertainty Modelling Research Unit, Department of Applied Mathematics
More informationREVERSALS ON SFT S. 1. Introduction and preliminaries
Trends in Mathematics Information Center for Mathematical Sciences Volume 7, Number 2, December, 2004, Pages 119 125 REVERSALS ON SFT S JUNGSEOB LEE Abstract. Reversals of topological dynamical systems
More informationMoore Penrose inverses and commuting elements of C -algebras
Moore Penrose inverses and commuting elements of C -algebras Julio Benítez Abstract Let a be an element of a C -algebra A satisfying aa = a a, where a is the Moore Penrose inverse of a and let b A. We
More informationWEAKLY COMPACT WEDGE OPERATORS ON KÖTHE ECHELON SPACES
Annales Academiæ Scientiarum Fennicæ Mathematica Volumen 29, 2004, 223 231 WEAKLY COMPACT WEDGE OPERATORS ON KÖTHE ECHELON SPACES José Bonet and Miguel Friz Universidad Politécnica de Valencia, E.T.S.I.
More informationAN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC
Iranian Journal of Fuzzy Systems Vol. 9, No. 6, (2012) pp. 31-41 31 AN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC E. ESLAMI Abstract. In this paper we extend the notion of degrees of membership
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 194 (015) 37 59 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: wwwelseviercom/locate/dam Loopy, Hankel, and combinatorially skew-hankel
More informationNotes. Relations. Introduction. Notes. Relations. Notes. Definition. Example. Slides by Christopher M. Bourke Instructor: Berthe Y.
Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 7.1, 7.3 7.5 of Rosen cse235@cse.unl.edu
More informationRANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA
Discussiones Mathematicae General Algebra and Applications 23 (2003 ) 125 137 RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA Seok-Zun Song and Kyung-Tae Kang Department of Mathematics,
More informationFeature Selection by Reordering *
Feature Selection by Reordering * Marcel Jirina and Marcel Jirina jr. 2 Institute of Computer Science, Pod vodarenskou vezi 2, 82 07 Prague 8 Liben, Czech Republic marcel@cs.cas.cz 2 Center of Applied
More informationMarkov Chains and Spectral Clustering
Markov Chains and Spectral Clustering Ning Liu 1,2 and William J. Stewart 1,3 1 Department of Computer Science North Carolina State University, Raleigh, NC 27695-8206, USA. 2 nliu@ncsu.edu, 3 billy@ncsu.edu
More informationA study on vague graphs
DOI 10.1186/s40064-016-2892-z RESEARCH Open Access A study on vague graphs Hossein Rashmanlou 1, Sovan Samanta 2*, Madhumangal Pal 3 and R. A. Borzooei 4 *Correspondence: ssamantavu@gmail.com 2 Department
More informationA Neuro-Fuzzy Scheme for Integrated Input Fuzzy Set Selection and Optimal Fuzzy Rule Generation for Classification
A Neuro-Fuzzy Scheme for Integrated Input Fuzzy Set Selection and Optimal Fuzzy Rule Generation for Classification Santanu Sen 1 and Tandra Pal 2 1 Tejas Networks India Ltd., Bangalore - 560078, India
More informationMaximum union-free subfamilies
Maximum union-free subfamilies Jacob Fox Choongbum Lee Benny Sudakov Abstract An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called
More informationLU Factorization. LU Decomposition. LU Decomposition. LU Decomposition: Motivation A = LU
LU Factorization To further improve the efficiency of solving linear systems Factorizations of matrix A : LU and QR LU Factorization Methods: Using basic Gaussian Elimination (GE) Factorization of Tridiagonal
More informationSOLVING FUZZY LINEAR SYSTEMS OF EQUATIONS
ROMAI J, 4, 1(2008), 207 214 SOLVING FUZZY LINEAR SYSTEMS OF EQUATIONS A Panahi, T Allahviranloo, H Rouhparvar Depart of Math, Science and Research Branch, Islamic Azad University, Tehran, Iran panahi53@gmailcom
More informationOn Regularity of Incline Matrices
International Journal of Algebra, Vol. 5, 2011, no. 19, 909-924 On Regularity of Incline Matrices A. R. Meenakshi and P. Shakila Banu Department of Mathematics Karpagam University Coimbatore-641 021, India
More informationBoolean Inner-Product Spaces and Boolean Matrices
Boolean Inner-Product Spaces and Boolean Matrices Stan Gudder Department of Mathematics, University of Denver, Denver CO 80208 Frédéric Latrémolière Department of Mathematics, University of Denver, Denver
More informationDefinition 2.3. We define addition and multiplication of matrices as follows.
14 Chapter 2 Matrices In this chapter, we review matrix algebra from Linear Algebra I, consider row and column operations on matrices, and define the rank of a matrix. Along the way prove that the row
More informationDistance Connectivity in Graphs and Digraphs
Distance Connectivity in Graphs and Digraphs M.C. Balbuena, A. Carmona Departament de Matemàtica Aplicada III M.A. Fiol Departament de Matemàtica Aplicada i Telemàtica Universitat Politècnica de Catalunya,
More informationComparison of two versions of the Ferrers property of fuzzy interval orders
Comparison of two versions of the Ferrers property of fuzzy interval orders Susana Díaz 1 Bernard De Baets 2 Susana Montes 1 1.Dept. Statistics and O. R., University of Oviedo 2.Dept. Appl. Math., Biometrics
More informationInjective semigroup-algebras
Injective semigroup-algebras J. J. Green June 5, 2002 Abstract Semigroups S for which the Banach algebra l (S) is injective are investigated and an application to the work of O. Yu. Aristov is described.
More informationFunction Approximation through Fuzzy Systems Using Taylor Series Expansion-Based Rules: Interpretability and Parameter Tuning
Function Approximation through Fuzzy Systems Using Taylor Series Expansion-Based Rules: Interpretability and Parameter Tuning Luis Javier Herrera 1,Héctor Pomares 1, Ignacio Rojas 1, Jesús González 1,
More informationA Linear Regression Model for Nonlinear Fuzzy Data
A Linear Regression Model for Nonlinear Fuzzy Data Juan C. Figueroa-García and Jesus Rodriguez-Lopez Universidad Distrital Francisco José de Caldas, Bogotá - Colombia jcfigueroag@udistrital.edu.co, e.jesus.rodriguez.lopez@gmail.com
More informationImplications from data with fuzzy attributes
Implications from data with fuzzy attributes Radim Bělohlávek, Martina Chlupová, and Vilém Vychodil Dept. Computer Science, Palacký University, Tomkova 40, CZ-779 00, Olomouc, Czech Republic Email: {radim.belohlavek,
More informationTactical Decompositions of Steiner Systems and Orbits of Projective Groups
Journal of Algebraic Combinatorics 12 (2000), 123 130 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Tactical Decompositions of Steiner Systems and Orbits of Projective Groups KELDON
More informationJ-SPECTRAL FACTORIZATION
J-SPECTRAL FACTORIZATION of Regular Para-Hermitian Transfer Matrices Qing-Chang Zhong zhongqc@ieee.org School of Electronics University of Glamorgan United Kingdom Outline Notations and definitions Regular
More informationNear-domination in graphs
Near-domination in graphs Bruce Reed Researcher, Projet COATI, INRIA and Laboratoire I3S, CNRS France, and Visiting Researcher, IMPA, Brazil Alex Scott Mathematical Institute, University of Oxford, Oxford
More informationMonomial subdigraphs of reachable and controllable positive discrete-time systems
Monomial subdigraphs of reachable and controllable positive discrete-time systems Rafael Bru a, Louis Caccetta b and Ventsi G. Rumchev b a Dept. de Matemàtica Aplicada, Univ. Politècnica de València, Camí
More informationOn MPT-implication functions for Fuzzy Logic
RACSA M Rev. R. Acad. Cien. Serie A. Mat. VOL. 98 (1), 2004, pp. 259 271 Ciencias de la Computación / Computational Sciences On MPT-implication functions for Fuzzy Logic Enric Trillas, Claudi Alsina and
More informationTHE BOOLEAN IDEMPOTENT MATRICES. Hong Youl Lee and Se Won Park. 1. Introduction
J. Appl. Math. & Computing Vol. 15(2004), No. 1-2. pp. 475-484 THE BOOLEAN IDEMPOTENT MATRICES Hong Youl Lee and Se Won Park Abstract. In general, a matrix A is idempotent if A 2 = A. The idempotent matrices
More informationTHE MEASURE-THEORETIC ENTROPY OF LINEAR CELLULAR AUTOMATA WITH RESPECT TO A MARKOV MEASURE. 1. Introduction
THE MEASURE-THEORETIC ENTROPY OF LINEAR CELLULAR AUTOMATA WITH RESPECT TO A MARKOV MEASURE HASAN AKIN Abstract. The purpose of this short paper is to compute the measure-theoretic entropy of the onedimensional
More informationInderjit Dhillon The University of Texas at Austin
Inderjit Dhillon The University of Texas at Austin ( Universidad Carlos III de Madrid; 15 th June, 2012) (Based on joint work with J. Brickell, S. Sra, J. Tropp) Introduction 2 / 29 Notion of distance
More informationIntroduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)
More informationCopyright 1972, by the author(s). All rights reserved.
Copyright 1972, by the author(s). All rights reserved. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are
More informationTHE STRUCTURE OF A RING OF FORMAL SERIES AMS Subject Classification : 13J05, 13J10.
THE STRUCTURE OF A RING OF FORMAL SERIES GHIOCEL GROZA 1, AZEEM HAIDER 2 AND S. M. ALI KHAN 3 If K is a field, by means of a sequence S of elements of K is defined a K-algebra K S [[X]] of formal series
More informationAn O(n 2 ) algorithm for maximum cycle mean of Monge matrices in max-algebra
Discrete Applied Mathematics 127 (2003) 651 656 Short Note www.elsevier.com/locate/dam An O(n 2 ) algorithm for maximum cycle mean of Monge matrices in max-algebra Martin Gavalec a;,jan Plavka b a Department
More informationCONTRIBUCIÓ A L ESTUDI DELS MORFISMES ENTRE OPERADORS D INDISTINGIBILITAT. APLICACIÓ AL RAONAMENT APROXIMAT.
UNIVERSITAT POLITÈCNICA DE CATALUNYA Programa de doctorat de Matemàtica Aplicada CONTRIBUCIÓ A L ESTUDI DELS MORFISMES ENTRE OPERADORS D INDISTINGIBILITAT. APLICACIÓ AL RAONAMENT APROXIMAT. Autor: Dionís
More informationThe matrix approach for abstract argumentation frameworks
The matrix approach for abstract argumentation frameworks Claudette CAYROL, Yuming XU IRIT Report RR- -2015-01- -FR February 2015 Abstract The matrices and the operation of dual interchange are introduced
More informationDETECTION OF FXM ARBITRAGE AND ITS SENSITIVITY
DETECTION OF FXM ARBITRAGE AND ITS SENSITIVITY SFI FINANCIAL ALGEBRA PROJECT AT UCC: BH, AM & EO S 1. Definitions and basics In this working paper we have n currencies, labeled 1 through n inclusive and
More informationHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
Opuscula Mathematica Vol. 6 No. 006 Hanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS Abstract. A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a
More informationA REPRESENTATION THEOREM FOR ORTHOGONALLY ADDITIVE POLYNOMIALS ON RIESZ SPACES
A REPRESENTATION THEOREM FOR ORTHOGONALLY ADDITIVE POLYNOMIALS ON RIESZ SPACES A. IBORT, P. LINARES AND J.G. LLAVONA Abstract. The aim of this article is to prove a representation theorem for orthogonally
More informationP-Spaces and the Prime Spectrum of Commutative Semirings
International Mathematical Forum, 3, 2008, no. 36, 1795-1802 P-Spaces and the Prime Spectrum of Commutative Semirings A. J. Peña Departamento de Matemáticas, Facultad Experimental de Ciencias, Universidad
More informationLecture #8: We now take up the concept of dynamic programming again using examples.
Lecture #8: 0.0.1 Dynamic Programming:(Chapter 15) We now take up the concept of dynamic programming again using examples. Example 1 (Chapter 15.2) Matrix Chain Multiplication INPUT: An Ordered set of
More informationPractical implementation of possibilistic probability mass functions
Soft Computing manuscript No. (will be inserted by the editor) Practical implementation of possibilistic probability mass functions Leen Gilbert, Gert de Cooman 1, Etienne E. Kerre 2 1 Universiteit Gent,
More informationFuzzy Closure Operators with Truth Stressers
Fuzzy Closure Operators with Truth Stressers RADIM BĚLOHLÁVEK, Dept. Computer Science, Palacký University, Tomkova 40, CZ-779 00, Olomouc, Czech Republic. Email: radim.belohlavek@upol.cz TAŤÁNA FUNIOKOVÁ,
More informationScientific/Technical Approach
Network based Hard/Soft Information Fusion: Soft Information and its Fusion Ronald R. Yager, Tel. 212 249 2047, E Mail: yager@panix.com Objectives: Support development of hard/soft information fusion Develop
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More informationOn (Weighted) k-order Fuzzy Connectives
Author manuscript, published in "IEEE Int. Conf. on Fuzzy Systems, Spain 2010" On Weighted -Order Fuzzy Connectives Hoel Le Capitaine and Carl Frélicot Mathematics, Image and Applications MIA Université
More informationLecture 4 October 18th
Directed and undirected graphical models Fall 2017 Lecture 4 October 18th Lecturer: Guillaume Obozinski Scribe: In this lecture, we will assume that all random variables are discrete, to keep notations
More informationCOMP 182 Algorithmic Thinking. Relations. Luay Nakhleh Computer Science Rice University
COMP 182 Algorithmic Thinking Relations Luay Nakhleh Computer Science Rice University Chapter 9, Section 1-6 Reading Material When we defined the Sorting Problem, we stated that to sort the list, the elements
More informationRoots and Root Spaces of Compact Banach Lie Algebras
Irish Math. Soc. Bulletin 49 (2002), 15 22 15 Roots and Root Spaces of Compact Banach Lie Algebras A. J. CALDERÓN MARTÍN AND M. FORERO PIULESTÁN Abstract. We study the main properties of roots and root
More informationIntegrating induced knowledge in an expert fuzzy-based system for intelligent motion analysis on ground robots
Integrating induced knowledge in an expert fuzzy-based system for intelligent motion analysis on ground robots José M. Alonso 1, Luis Magdalena 1, Serge Guillaume 2, Miguel A. Sotelo 3, Luis M. Bergasa
More informationS-MEASURES, T -MEASURES AND DISTINGUISHED CLASSES OF FUZZY MEASURES
K Y B E R N E T I K A V O L U M E 4 2 ( 2 0 0 6 ), N U M B E R 3, P A G E S 3 6 7 3 7 8 S-MEASURES, T -MEASURES AND DISTINGUISHED CLASSES OF FUZZY MEASURES Peter Struk and Andrea Stupňanová S-measures
More informationGeneralised Atanassov Intuitionistic Fuzzy Sets
eknow 23 : The Fifth International Conference on Information, Process, and Knowledge Management Generalised Atanassov Intuitionistic Fuzzy Sets Ioan Despi School of Science and Technology University of
More informationHierarchical Structures on Multigranulation Spaces
Yang XB, Qian YH, Yang JY. Hierarchical structures on multigranulation spaces. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 27(6): 1169 1183 Nov. 2012. DOI 10.1007/s11390-012-1294-0 Hierarchical Structures
More informationImplications from data with fuzzy attributes vs. scaled binary attributes
Implications from data with fuzzy attributes vs. scaled binary attributes Radim Bělohlávek, Vilém Vychodil Dept. Computer Science, Palacký University, Tomkova 40, CZ-779 00, Olomouc, Czech Republic Email:
More information