MATCHING STRENGTHS OF ANSWERS IN FUZZY RELATIONAL DATABASES

Citation
Da. Chiang et al., MATCHING STRENGTHS OF ANSWERS IN FUZZY RELATIONAL DATABASES, IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 28(3), 1998, pp. 476-481
Citations number
30
Categorie Soggetti
Computer Science Cybernetics","Computer Science Artificial Intelligence","Computer Science Interdisciplinary Applications","Computer Science Cybernetics","Computer Science Artificial Intelligence","Computer Science Interdisciplinary Applications
ISSN journal
10946977
Volume
28
Issue
3
Year of publication
1998
Pages
476 - 481
Database
ISI
SICI code
1094-6977(1998)28:3<476:MSOAIF>2.0.ZU;2-Q
Abstract
In this paper, imprecise information is represented by fuzzy disjuncti ve information, and an extended fuzzy relational model is used to acco mmodate such information. In the presence of imprecise information, an swers to a query can be categorized into two kinds of answers: sure an swers and possible answers. To find more likely answers to a given que ry, we develop a method to measure the matching strength of each tuple as an answer to the query. The quality of an answer is higher in the case where less extra information is required and the more sure inform ation is provided.