Type-1 OWA operators

Last updated March 06, 2024

Type-1 OWA operators^[1]^[2] are a set of aggregation operators that generalise the Yager's OWA (ordered weighted averaging) operators) ^[3] in the interest of aggregating fuzzy sets rather than crisp values in soft decision making and data mining.

Definitions

Definition 1

Let $F(X)$ be the set of fuzzy sets with domain of discourse $X$ , a type-1 OWA operator is defined as follows:^[2]

Given n linguistic weights $\left\{{W^{i}}\right\}_{i=1}^{n}$ in the form of fuzzy sets defined on the domain of discourse $U=[0,1]$ , a type-1 OWA operator is a mapping, $\Phi$ ,

\Phi \colon F(X)\times \cdots \times F(X)\longrightarrow F(X)

(A^{1},\cdots ,A^{n})\mapsto Y

such that

\mu _{Y}(y)=\displaystyle \sup _{\displaystyle \sum _{k=1}^{n}{\bar {w}}_{i}a_{\sigma (i)}=y}\left({\begin{array}{*{1}l}\mu _{W^{1}}(w_{1})\wedge \cdots \wedge \mu _{W^{n}}(w_{n})\wedge \mu _{A^{1}}(a_{1})\wedge \cdots \wedge \mu _{A^{n}}(a_{n})\end{array}}\right)

where ${\bar {w}}_{i}={\frac {w_{i}}{\sum _{i=1}^{n}{w_{i}}}}$ , and $\sigma \colon \{1,\cdots ,n\}\longrightarrow \{1,\cdots ,n\}$ is a permutation function such that $a_{\sigma (i)}\geq a_{\sigma (i+1)},\ \forall i=1,\cdots ,n-1$ , i.e., $a_{\sigma (i)}$ is the $i$ th highest element in the set $\left\{{a_{1},\cdots ,a_{n}}\right\}$ .

Definition 2

Using the alpha-cuts of fuzzy sets:^[2]

Given the n linguistic weights $\left\{{W^{i}}\right\}_{i=1}^{n}$ in the form of fuzzy sets defined on the domain of discourse $U=[0,\;\;1]$ , then for each $\alpha \in [0,\;1]$ , an $\alpha$ -level type-1 OWA operator with $\alpha$ -level sets $\left\{{W_{\alpha }^{i}}\right\}_{i=1}^{n}$ to aggregate the $\alpha$ -cuts of fuzzy sets $\left\{{A^{i}}\right\}_{i=1}^{n}$ is:

\Phi _{\alpha }\left({A_{\alpha }^{1},\ldots ,A_{\alpha }^{n}}\right)=\left\{{{\frac {\sum \limits _{i=1}^{n}{w_{i}a_{\sigma (i)}}}{\sum \limits _{i=1}^{n}{w_{i}}}}\left|{w_{i}\in W_{\alpha }^{i},\;a_{i}}\right.\in A_{\alpha }^{i},\;i=1,\ldots ,n}\right\}

where $W_{\alpha }^{i}=\{w|\mu _{W_{i}}(w)\geq \alpha \},A_{\alpha }^{i}=\{x|\mu _{A_{i}}(x)\geq \alpha \}$ , and ${\displaystyle \sigma$ is a permutation function such that $a_{\sigma (i)}\geq a_{\sigma (i+1)},\;\forall \;i=1,\cdots ,n-1$ , i.e., $a_{\sigma (i)}$ is the $i$ th largest element in the set $\left\{{a_{1},\cdots ,a_{n}}\right\}$ .

Representation theorem of Type-1 OWA operators

Given the n linguistic weights $\left\{{W^{i}}\right\}_{i=1}^{n}$ in the form of fuzzy sets defined on the domain of discourse $U=[0,\;\;1]$ , and the fuzzy sets $A^{1},\cdots ,A^{n}$ , then we have that^[2]

Y=G

where $Y$ is the aggregation result obtained by Definition 1, and $G$ is the result obtained by in Definition 2.

Programming problems for Type-1 OWA operators

According to the Representation Theorem of Type-1 OWA Operators, a general type-1 OWA operator can be decomposed into a series of $\alpha$ -level type-1 OWA operators. In practice, this series of $\alpha$ -level type-1 OWA operators is used to construct the resulting aggregation fuzzy set. So we only need to compute the left end-points and right end-points of the intervals $\Phi _{\alpha }\left({A_{\alpha }^{1},\cdots ,A_{\alpha }^{n}}\right)$ . Then, the resulting aggregation fuzzy set is constructed with the membership function as follows:

\mu _{G}(x)=\operatorname {\bigvee } \limits _{\alpha :x\in \Phi _{\alpha }\left({A_{\alpha }^{1},\cdots ,A_{\alpha }^{n}}\right)_{\alpha }}\alpha

For the left end-points, we need to solve the following programming problem:

\Phi _{\alpha }\left({A_{\alpha }^{1},\cdots ,A_{\alpha }^{n}}\right)_{-}=\operatorname {\min } \limits _{\begin{array}{l}W_{\alpha -}^{i}\leq w_{i}\leq W_{\alpha +}^{i}A_{\alpha -}^{i}\leq a_{i}\leq A_{\alpha +}^{i}\end{array}}\sum \limits _{i=1}^{n}{w_{i}a_{\sigma (i)}/\sum \limits _{i=1}^{n}{w_{i}}}

while for the right end-points, we need to solve the following programming problem:

\Phi _{\alpha }\left({A_{\alpha }^{1},\cdots ,A_{\alpha }^{n}}\right)_{+}=\operatorname {\max } \limits _{\begin{array}{l}W_{\alpha -}^{i}\leq w_{i}\leq W_{\alpha +}^{i}A_{\alpha -}^{i}\leq a_{i}\leq A_{\alpha +}^{i}\end{array}}\sum \limits _{i=1}^{n}{w_{i}a_{\sigma (i)}/\sum \limits _{i=1}^{n}{w_{i}}}

A fast method has been presented to solve two programming problem so that the type-1 OWA aggregation operation can be performed efficiently, for details, please see the paper.^[2]

Alpha-level approach to Type-1 OWA operation

Three-step process:^[2]

Step 1—To set up the $\alpha$ - level resolution in [0, 1].
Step 2—For each $\alpha \in [0,1]$ ,

Step 2.1—To calculate $\rho _{\alpha +}^{i_{0}^{\ast }}$

Let $i_{0}=1$ ;
If $\rho _{\alpha +}^{i_{0}}\geq A_{\alpha +}^{\sigma (i_{0})}$ , stop, $\rho _{\alpha +}^{i_{0}}$ is the solution; otherwise go to Step 2.1-3.
$i_{0}\leftarrow i_{0}+1$ , go to Step 2.1-2.

Step 2.2 To calculate $\rho _{\alpha -}^{i_{0}^{\ast }}$

Let $i_{0}=1$ ;
If $\rho _{\alpha -}^{i_{0}}\geq A_{\alpha -}^{\sigma (i_{0})}$ , stop, $\rho _{\alpha -}^{i_{0}}$ is the solution; otherwise go to Step 2.2-3.
$i_{0}\leftarrow i_{0}+1$ , go to step Step 2.2-2.

Step 3—To construct the aggregation resulting fuzzy set $G$ based on all the available intervals $\left[{\rho _{\alpha -}^{i_{0}^{\ast }},\;\rho _{\alpha +}^{i_{0}^{\ast }}}\right]$ :

\mu _{G}(x)=\operatorname {\bigvee } \limits _{\alpha :x\in \left[{\rho _{\alpha -}^{i_{0}^{\ast }},\;\rho _{\alpha +}^{i_{0}^{\ast }}}\right]}\alpha

Some Examples

The type-1 OWA operator with the weights shown in the top figure is used to aggregate the fuzzy sets (solide lines) in the bottom figure, and the dashed line is the aggregation result.

Special cases

Any OWA operators, like maximum, minimum, mean operators;^[3]
Join operators of (type-1) fuzzy sets,^[4] i.e., fuzzy maximum operators;
Meet operators of (type-1) fuzzy sets,^[4]^[5] i.e., fuzzy minimum operators;
Join-like operators of (type-1) fuzzy sets;^[2]^[6]
Meet-like operators of (type-1) fuzzy sets.^[2]^[6]

Generalizations

Type-2 OWA operators^[7] have been suggested to aggregate the type-2 fuzzy sets for soft decision making.

Applications

Type-1 OWA operators have been applied to different domains for soft decision making.

Improved efficiency of computing approach ^[8];
Type reduction of type-2 fuzzy sets ^[9];
Group decision making ^[10];
Credit risk evaluation ^[11];
Information fusion ^[12];
Linguistic expressions and symbolic translation ^[13]^[14];
Sentiment analysis ^[15];
Route selection in uncertain environments ^[16];
Recommendations on eCommerce ^[17].

Related Research Articles

In particle physics, the Dirac equation is a relativistic wave equation derived by British physicist Paul Dirac in 1928. In its free form, or including electromagnetic interactions, it describes all spin-1⁄2 massive particles, called "Dirac particles", such as electrons and quarks for which parity is a symmetry. It is consistent with both the principles of quantum mechanics and the theory of special relativity, and was the first theory to account fully for special relativity in the context of quantum mechanics. It was validated by accounting for the fine structure of the hydrogen spectrum in a completely rigorous way.

In the mathematical field of differential geometry, the Riemann curvature tensor or Riemann–Christoffel tensor is the most common way used to express the curvature of Riemannian manifolds. It assigns a tensor to each point of a Riemannian manifold. It is a local invariant of Riemannian metrics which measures the failure of the second covariant derivatives to commute. A Riemannian manifold has zero curvature if and only if it is flat, i.e. locally isometric to the Euclidean space. The curvature tensor can also be defined for any pseudo-Riemannian manifold, or indeed any manifold equipped with an affine connection.

Linear elasticity is a mathematical model of how solid objects deform and become internally stressed due to prescribed loading conditions. It is a simplification of the more general nonlinear theory of elasticity and a branch of continuum mechanics.

In mathematics, a Lie algebroid is a vector bundle $together with a Lie bracket on its space of sections and a vector bundle morphism, satisfying a Leibniz rule. A Lie algebroid can thus be thought of as a "many-object generalisation" of a Lie algebra.$

In statistics, the Neyman–Pearson lemma describes the existence and uniqueness of the likelihood ratio as a uniformly most powerful test in certain contexts. It was introduced by Jerzy Neyman and Egon Pearson in a paper in 1933. The Neyman–Pearson lemma is part of the Neyman–Pearson theory of statistical testing, which introduced concepts like errors of the second kind, power function, and inductive behavior. The previous Fisherian theory of significance testing postulated only one hypothesis. By introducing a competing hypothesis, the Neyman–Pearsonian flavor of statistical testing allows investigating the two types of errors. The trivial cases where one always rejects or accepts the null hypothesis are of little interest but it does prove that one must not relinquish control over one type of error while calibrating the other. Neyman and Pearson accordingly proceeded to restrict their attention to the class of all $level tests while subsequently minimizing type II error, traditionally denoted by . Their seminal paper of 1933, including the Neyman-Pearson lemma, comes at the end of this endeavor, not only showing the existence of tests with the most power that retain a prespecified level of type I error, but also providing a way to construct such tests. The Karlin-Rubin theorem extends the Neyman-Pearson lemma to settings involving composite hypotheses with monotone likelihood ratios.$

In differential topology, the jet bundle is a certain construction that makes a new smooth fiber bundle out of a given smooth fiber bundle. It makes it possible to write differential equations on sections of a fiber bundle in an invariant form. Jets may also be seen as the coordinate free versions of Taylor expansions.

When studying and formulating Albert Einstein's theory of general relativity, various mathematical structures and techniques are utilized. The main tools used in this geometrical theory of gravitation are tensor fields defined on a Lorentzian manifold representing spacetime. This article is a general description of the mathematics of general relativity.

In mathematical physics, the gamma matrices, $also called the Dirac matrices, are a set of conventional matrices with specific anticommutation relations that ensure they generate a matrix representation of the Clifford algebra It is also possible to define higher-dimensional gamma matrices. When interpreted as the matrices of the action of a set of orthogonal basis vectors for contravariant vectors in Minkowski space, the column vectors on which the matrices act become a space of spinors, on which the Clifford algebra of spacetime acts. This in turn makes it possible to represent infinitesimal spatial rotations and Lorentz boosts. Spinors facilitate spacetime computations in general, and in particular are fundamental to the Dirac equation for relativistic spin particles. Gamma matrices were introduced by Paul Dirac in 1928.$

In relativistic physics, the electromagnetic stress–energy tensor is the contribution to the stress–energy tensor due to the electromagnetic field. The stress–energy tensor describes the flow of energy and momentum in spacetime. The electromagnetic stress–energy tensor contains the negative of the classical Maxwell stress tensor that governs the electromagnetic interactions.

The covariant formulation of classical electromagnetism refers to ways of writing the laws of classical electromagnetism in a form that is manifestly invariant under Lorentz transformations, in the formalism of special relativity using rectilinear inertial coordinate systems. These expressions both make it simple to prove that the laws of classical electromagnetism take the same form in any inertial coordinate system, and also provide a way to translate the fields and forces from one frame to another. However, this is not as general as Maxwell's equations in curved spacetime or non-rectilinear coordinate systems.

In physics, Maxwell's equations in curved spacetime govern the dynamics of the electromagnetic field in curved spacetime or where one uses an arbitrary coordinate system. These equations can be viewed as a generalization of the vacuum Maxwell's equations which are normally formulated in the local coordinates of flat spacetime. But because general relativity dictates that the presence of electromagnetic fields induce curvature in spacetime, Maxwell's equations in flat spacetime should be viewed as a convenient approximation.

The Newman–Penrose (NP) formalism is a set of notation developed by Ezra T. Newman and Roger Penrose for general relativity (GR). Their notation is an effort to treat general relativity in terms of spinor notation, which introduces complex forms of the usual variables used in GR. The NP formalism is itself a special case of the tetrad formalism, where the tensors of the theory are projected onto a complete vector basis at each point in spacetime. Usually this vector basis is chosen to reflect some symmetry of the spacetime, leading to simplified expressions for physical observables. In the case of the NP formalism, the vector basis chosen is a null tetrad: a set of four null vectors—two real, and a complex-conjugate pair. The two real members often asymptotically point radially inward and radially outward, and the formalism is well adapted to treatment of the propagation of radiation in curved spacetime. The Weyl scalars, derived from the Weyl tensor, are often used. In particular, it can be shown that one of these scalars— $in the appropriate frame—encodes the outgoing gravitational radiation of an asymptotically flat system.$

There are various mathematical descriptions of the electromagnetic field that are used in the study of electromagnetism, one of the four fundamental interactions of nature. In this article, several approaches are discussed, although the equations are in terms of electric and magnetic fields, potentials, and charges with currents, generally speaking.

A ratio distribution is a probability distribution constructed as the distribution of the ratio of random variables having two other known distributions. Given two random variables X and Y, the distribution of the random variable Z that is formed as the ratio Z = X/Y is a ratio distribution.

In mathematics – specifically, in stochastic analysis – an Itô diffusion is a solution to a specific type of stochastic differential equation. That equation is similar to the Langevin equation used in physics to describe the Brownian motion of a particle subjected to a potential in a viscous fluid. Itô diffusions are named after the Japanese mathematician Kiyosi Itô.

In applied mathematics, specifically in fuzzy logic, the ordered weighted averaging (OWA) operators provide a parameterized class of mean type aggregation operators. They were introduced by Ronald R. Yager. Many notable mean operators such as the max, arithmetic average, median and min, are members of this class. They have been widely used in computational intelligence because of their ability to model linguistically expressed aggregation instructions.

In mathematics, the spectral theory of ordinary differential equations is the part of spectral theory concerned with the determination of the spectrum and eigenfunction expansion associated with a linear ordinary differential equation. In his dissertation, Hermann Weyl generalized the classical Sturm–Liouville theory on a finite closed interval to second order differential operators with singularities at the endpoints of the interval, possibly semi-infinite or infinite. Unlike the classical case, the spectrum may no longer consist of just a countable set of eigenvalues, but may also contain a continuous part. In this case the eigenfunction expansion involves an integral over the continuous part with respect to a spectral measure, given by the Titchmarsh–Kodaira formula. The theory was put in its final simplified form for singular differential equations of even degree by Kodaira and others, using von Neumann's spectral theorem. It has had important applications in quantum mechanics, operator theory and harmonic analysis on semisimple Lie groups.

In mathematics, Ricci calculus constitutes the rules of index notation and manipulation for tensors and tensor fields on a differentiable manifold, with or without a metric tensor or connection. It is also the modern name for what used to be called the absolute differential calculus, developed by Gregorio Ricci-Curbastro in 1887–1896, and subsequently popularized in a paper written with his pupil Tullio Levi-Civita in 1900. Jan Arnoldus Schouten developed the modern notation and formalism for this mathematical framework, and made contributions to the theory, during its applications to general relativity and differential geometry in the early twentieth century.

In mathematical physics, the Dirac equation in curved spacetime is a generalization of the Dirac equation from flat spacetime to curved spacetime, a general Lorentzian manifold.

Lagrangian field theory is a formalism in classical field theory. It is the field-theoretic analogue of Lagrangian mechanics. Lagrangian mechanics is used to analyze the motion of a system of discrete particles each with a finite number of degrees of freedom. Lagrangian field theory applies to continua and fields, which have an infinite number of degrees of freedom.

References

↑ Zhou, S. M.; F. Chiclana; R. I. John; J. M. Garibaldi (2008). "Type-1 OWA operators for aggregating uncertain information with uncertain weights induced by type-2 linguistic quantifiers". Fuzzy Sets and Systems. 159 (24): 3281–3296. doi:10.1016/j.fss.2008.06.018. hdl: 10026.1/20374 .
1 2 3 4 5 6 7 8 Zhou, S. M.; F. Chiclana; R. I. John; J. M. Garibaldi (2011). "Alpha-level aggregation: a practical approach to type-1 OWA operation for aggregating uncertain information with applications to breast cancer treatments" (PDF). IEEE Transactions on Knowledge and Data Engineering. 23 (10): 1455–1468. doi:10.1109/TKDE.2010.191. S2CID 14145944.
1 2 Yager, R.R (1988). "On ordered weighted averaging aggregation operators in multi-criteria decision making". IEEE Transactions on Systems, Man, and Cybernetics. 18: 183–190. doi:10.1109/21.87068. hdl: 10338.dmlcz/135605 .
1 2 Mizumoto, M.; K. Tanaka (1976). "Some Properties of fuzzy sets of type 2". Information and Control. 31 (4): 312–40. doi: 10.1016/s0019-9958(76)80011-3 .
↑ Zadeh, L.A. (1975). "The concept of a linguistic variable and its application to approximate reasoning — I". Information Sciences. Elsevier. 8 (3): 199–249. doi:10.1016/0020-0255(75)90036-5. ISSN 0020-0255. Wikidata Q109950743.
1 2 Zhou, S. M.; F. Chiclana; R. I. John; J. M. Garibaldi (2011). "Fuzzification of the OWA Operators for Aggregating Uncertain Information with Uncertain Weights". Recent Developments in the Ordered Weighted Averaging Operators: Theory and Practice. Studies in Fuzziness and Soft Computing. Vol. Springer. pp. 91–109. doi:10.1007/978-3-642-17910-5_5. ISBN 978-3-642-17909-9.{{cite book}}: |journal= ignored (help)
↑ Zhou, S.M.; R. I. John; F. Chiclana; J. M. Garibaldi (2010). "On aggregating uncertain information by type-2 OWA operators for soft decision making" (PDF). International Journal of Intelligent Systems. 25 (6): 540–558. doi:10.1002/int.20420. S2CID 17690161.
↑ Hu, H; Q. Yang; Y. Cai (2013). "An opposite direction searching algorithm for calculating the type-1 ordered weighted average". Knowledge-Based Systems. 52: 176–180. doi:10.1016/j.knosys.2013.07.021.
↑ Chiclana, F.; S. M. Zhou (2013). "Type-reduction of general type-2 fuzzy sets: The type-1 OWA method". International Journal of Intelligent Systems. 28: 505–522. doi: 10.1002/int.21588 . S2CID 11122847.
↑ Mata, F.; L. G. Perez; S. M. Zhou; F. Chiclana (2014). "Type-1 OWA methodology to consensus reaching processes in group decision making with multi-granular linguistic contexts" (PDF). Knowledge-based Systems. 58: 11–22. doi:10.1016/j.knosys.2013.09.017.
↑ Chiclana, C; F. Mata; L. G. Perez; E. Herrera-Viedma (2018). "Type-1 OWA Unbalanced Fuzzy Linguistic Aggregation Methodology: Application to Eurobonds Credit Risk Evaluation". International Journal of Intelligent Systems. 33 (5): 1071–1088. doi:10.1002/int.21912. hdl: 10481/51213 . S2CID 4937006.
↑ He, W.; R. W. Rodríguez; B. Dutta; L. Martínez (2021). "Exploiting the type-1 OWA operator to fuse the ELICIT information". 2021 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). pp. 1–7. doi:10.1109/FUZZ45933.2021.9494400. ISBN 978-1-6654-4407-1. S2CID 236939531.
↑ He, W.; R. W. Rodríguez; B. Dutta; L. Martínez (2021). "A type-1 OWA operator for Extended Comparative Linguistic Expressions with Symbolic Translation". Fuzzy Sets and Systems. 446: 167–192. doi: 10.1016/j.fss.2021.08.002 . S2CID 238679154.
↑ He, W.; R. W. Rodríguez; B. Dutta; L. Martínez (2021). "Induced OWA Operator for Group Decision Making Dealing with Extended Comparative Linguistic Expressions with Symbolic Translation". Mathematics. 9: 20. doi: 10.3390/math9010020 .
↑ Serrano-Guerrero, J.; F. Chiclana; J. A. Olivas; F. P. Romero; E. Homapour (2020). "A T1OWA fuzzy linguistic aggregation methodology for searching feature-based opinions". Knowledge-Based Systems. 189: 105131. doi:10.1016/j.knosys.2019.105131. hdl: 10578/33322 . S2CID 208106950.
↑ Buck, A. R.; J. M. Keller; M. Popescu (2014). "An α-Level OWA Implementation of Bounded Rationality for Fuzzy Route Selection". Advance Trends in Soft Computing. Studies in Fuzziness and Soft Computing. Vol. 312. pp. 91–109. doi:10.1007/978-3-319-03674-8_24. ISBN 978-3-319-03673-1.
↑ Serrano-Guerrero, J.; J. A. Olivas; F. P. Romero (2020). "A T1OWA and aspect-based model for customizing recommendations on eCommerce". Applied Soft Computing. 97: 106768. doi:10.1016/j.asoc.2020.106768. S2CID 224847658.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[fssT1OWA-1] Zhou, S. M.; F. Chiclana; R. I. John; J. M. Garibaldi (2008). "Type-1 OWA operators for aggregating uncertain information with uncertain weights induced by type-2 linguistic quantifiers". Fuzzy Sets and Systems. 159 (24): 3281–3296. doi:10.1016/j.fss.2008.06.018. hdl: 10026.1/20374 .

[kdeT1OWA-2] 1 2 3 4 5 6 7 8 Zhou, S. M.; F. Chiclana; R. I. John; J. M. Garibaldi (2011). "Alpha-level aggregation: a practical approach to type-1 OWA operation for aggregating uncertain information with applications to breast cancer treatments" (PDF). IEEE Transactions on Knowledge and Data Engineering. 23 (10): 1455–1468. doi:10.1109/TKDE.2010.191. S2CID 14145944.

[yagerOWA-3] 1 2 Yager, R.R (1988). "On ordered weighted averaging aggregation operators in multi-criteria decision making". IEEE Transactions on Systems, Man, and Cybernetics. 18: 183–190. doi:10.1109/21.87068. hdl: 10338.dmlcz/135605 .

[MT-4] 1 2 Mizumoto, M.; K. Tanaka (1976). "Some Properties of fuzzy sets of type 2". Information and Control. 31 (4): 312–40. doi: 10.1016/s0019-9958(76)80011-3 .

[zadehJ-5] Zadeh, L.A. (1975). "The concept of a linguistic variable and its application to approximate reasoning — I". Information Sciences. Elsevier. 8 (3): 199–249. doi:10.1016/0020-0255(75)90036-5. ISSN 0020-0255. Wikidata Q109950743.

[bookT1OWA-6] 1 2 Zhou, S. M.; F. Chiclana; R. I. John; J. M. Garibaldi (2011). "Fuzzification of the OWA Operators for Aggregating Uncertain Information with Uncertain Weights". Recent Developments in the Ordered Weighted Averaging Operators: Theory and Practice. Studies in Fuzziness and Soft Computing. Vol. Springer. pp. 91–109. doi:10.1007/978-3-642-17910-5_5. ISBN 978-3-642-17909-9.{{cite book}}: |journal= ignored (help)

[Zhou-7] Zhou, S.M.; R. I. John; F. Chiclana; J. M. Garibaldi (2010). "On aggregating uncertain information by type-2 OWA operators for soft decision making" (PDF). International Journal of Intelligent Systems. 25 (6): 540–558. doi:10.1002/int.20420. S2CID 17690161.

[newimp-8] Hu, H; Q. Yang; Y. Cai (2013). "An opposite direction searching algorithm for calculating the type-1 ordered weighted average". Knowledge-Based Systems. 52: 176–180. doi:10.1016/j.knosys.2013.07.021.

[reduction-9] Chiclana, F.; S. M. Zhou (2013). "Type-reduction of general type-2 fuzzy sets: The type-1 OWA method". International Journal of Intelligent Systems. 28: 505–522. doi: 10.1002/int.21588 . S2CID 11122847.

[groupdm-10] Mata, F.; L. G. Perez; S. M. Zhou; F. Chiclana (2014). "Type-1 OWA methodology to consensus reaching processes in group decision making with multi-granular linguistic contexts" (PDF). Knowledge-based Systems. 58: 11–22. doi:10.1016/j.knosys.2013.09.017.

[credit-11] Chiclana, C; F. Mata; L. G. Perez; E. Herrera-Viedma (2018). "Type-1 OWA Unbalanced Fuzzy Linguistic Aggregation Methodology: Application to Eurobonds Credit Risk Evaluation". International Journal of Intelligent Systems. 33 (5): 1071–1088. doi:10.1002/int.21912. hdl: 10481/51213 . S2CID 4937006.

[fusion-12] He, W.; R. W. Rodríguez; B. Dutta; L. Martínez (2021). "Exploiting the type-1 OWA operator to fuse the ELICIT information". 2021 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). pp. 1–7. doi:10.1109/FUZZ45933.2021.9494400. ISBN 978-1-6654-4407-1. S2CID 236939531.

[trans1-13] He, W.; R. W. Rodríguez; B. Dutta; L. Martínez (2021). "A type-1 OWA operator for Extended Comparative Linguistic Expressions with Symbolic Translation". Fuzzy Sets and Systems. 446: 167–192. doi: 10.1016/j.fss.2021.08.002 . S2CID 238679154.

[trans2-14] He, W.; R. W. Rodríguez; B. Dutta; L. Martínez (2021). "Induced OWA Operator for Group Decision Making Dealing with Extended Comparative Linguistic Expressions with Symbolic Translation". Mathematics. 9: 20. doi: 10.3390/math9010020 .

[sentiment-15] Serrano-Guerrero, J.; F. Chiclana; J. A. Olivas; F. P. Romero; E. Homapour (2020). "A T1OWA fuzzy linguistic aggregation methodology for searching feature-based opinions". Knowledge-Based Systems. 189: 105131. doi:10.1016/j.knosys.2019.105131. hdl: 10578/33322 . S2CID 208106950.

[fuzzyroute-16] Buck, A. R.; J. M. Keller; M. Popescu (2014). "An α-Level OWA Implementation of Bounded Rationality for Fuzzy Route Selection". Advance Trends in Soft Computing. Studies in Fuzziness and Soft Computing. Vol. 312. pp. 91–109. doi:10.1007/978-3-319-03674-8_24. ISBN 978-3-319-03673-1.

[eComm-17] Serrano-Guerrero, J.; J. A. Olivas; F. P. Romero (2020). "A T1OWA and aspect-based model for customizing recommendations on eCommerce". Applied Soft Computing. 97: 106768. doi:10.1016/j.asoc.2020.106768. S2CID 224847658.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

[14]

[15]

[16]

[17]