2012
DOI: 10.1016/j.apm.2012.02.005
|View full text |Cite
|
Sign up to set email alerts
|

Solving fully fuzzy matrix equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
25
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 36 publications
(25 citation statements)
references
References 16 publications
0
25
0
Order By: Relevance
“…Muzzioli & Reynaerts (2007) have investigated the non-negative solution procedure of fuzzy system by nonlinear programming approach. Otadi & Mosleh (2012) have applied a linear programming approach to find the non-negative solution of a fully fuzzy matrix equation whose elements of the coefficient matrix are considered as arbitrary triangular fuzzy numbers. There are no restrictions about the elements of the coefficient matrix of the corresponding system.…”
Section: Introductionmentioning
confidence: 99%
“…Muzzioli & Reynaerts (2007) have investigated the non-negative solution procedure of fuzzy system by nonlinear programming approach. Otadi & Mosleh (2012) have applied a linear programming approach to find the non-negative solution of a fully fuzzy matrix equation whose elements of the coefficient matrix are considered as arbitrary triangular fuzzy numbers. There are no restrictions about the elements of the coefficient matrix of the corresponding system.…”
Section: Introductionmentioning
confidence: 99%
“…(1) Set the membership function shown in (1), where, x is the frequency of attribute word, σ is variance of x, a is the frequency threshold. By the membership function, we can get the attributes membership of all text, and the membership value is less than 1 [7].…”
Section: Text Clustering Algorithmmentioning
confidence: 99%
“…In addition, methods to obtain positive solution for FFLS and fully fuzzy matrix equations (FFME) have been proposed [5,20,21,39], where the coefficients are arbitrary. All of the examples in their methods are limited to n = 3 or 3 indicating difficulties in real applications.…”
Section: Introductionmentioning
confidence: 99%