2008 IEEE International Conference on Signal Image Technology and Internet Based Systems 2008
DOI: 10.1109/sitis.2008.90
|View full text |Cite
|
Sign up to set email alerts
|

Fuzzy Ontology Based Document Feature Vector Modification Using Fuzzy Tree Transducer

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
3

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 17 publications
0
3
0
Order By: Relevance
“…Usually, synthesis and analysis of systems by computational models is associated with uncertainty modeling, and approximate reasoning [2,10]. Fuzzy logic is capable of overcoming the vagueness, imprecision and absence of concrete data for generating robust models to drive decisions from uncertainties [41].…”
Section: Related Workmentioning
confidence: 99%
“…Usually, synthesis and analysis of systems by computational models is associated with uncertainty modeling, and approximate reasoning [2,10]. Fuzzy logic is capable of overcoming the vagueness, imprecision and absence of concrete data for generating robust models to drive decisions from uncertainties [41].…”
Section: Related Workmentioning
confidence: 99%
“…Now, the proof is straightforward. δ(q 1 , α) = 0.9, r 2 : δ(q 1 , q 4 , λ) = 0.8, r 3 : δ(q 2 , q 4 , λ) = 0.8, r 4 : δ(q 3 , q 4 , λ) = 0.8, r 5 : δ(q 4 , q 2 , λ) = 0.8, r 6 : δ(q 1 , q 1 , q 3 , σ ) = 0.7, r 7 : δ(q 1 , q 2 , q 3 , σ ) = 0.7, r 8 : δ(q 1 , q 3 , q 2 , σ ) = 0.6, r 9 : δ(q 1 , q 4 , q 4 , σ ) = 0.6, r 10 : δ(q 2 , q 1 , q 3 , σ ) = 0.6, r 11 : δ(q 2 , q 2 , q 3 , σ ) = 0.6, r 12 : δ(q 2 , q 3 , q 2 , σ ) = 0.6, r 13 : δ(q 2 , q 4 , q 4 , σ ) = 0.2, r 14 : δ(q 3 , q 1 , q 2 , σ ) = 0.3, r 15 : δ(q 3 , q 2 , q 2 , σ ) = 0.3, r 16 : δ(q 3 , q 3 , q 3 , σ ) = 0.3, r 17 : δ(q 3 , q 4 , q 4 , σ ) = 0.2, r 18 : δ(q 4 , q 1 , q 4 , σ ) = 0.1, r 19 : δ(q 4 , q 2 , q 4 , σ ) = 0.1, r 20 : δ(q 4 , q 3 , q 4 , σ ) = 0.1, r 21 : δ(q 4 , q 4 , q 4 , σ ) = 1}. Now, for each i ∈ {1, 2, 3, 4} we have f * (q i ) = i − 1 and then f * (r 16 M = ( , Q, , δ, , ρ, β) be an FFTA.…”
Section: Lemmamentioning
confidence: 99%
“…This paper introduces the concept of similarity-based minimizing DFFTA and a method for handeling the trade-off between the amount of states that can be merged and the quality of preserving the behavior of system. Similarity plays an essential role in taxonomy, recognition, case based reasoning and many other fields [15,38,40]. We use the concept of similarity or approximate equality [31,41] modeled on classes of fuzzy sets to define similarity between some DFFTA that approximately accept the same fuzzy tree language.…”
mentioning
confidence: 99%