Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Cooperative Answering through Controlled Query Relaxation
IEEE Expert: Intelligent Systems and Their Applications
On the Weakening of Fuzzy Relational Queries
ISMIS '94 Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems
Concepts in fuzzy scaling theory: order and granularity
Fuzzy Sets and Systems - Possibility theory and fuzzy logic
Machine learning for online query relaxation
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
IDFQ: An Interface for Database Flexible Querying
ADBIS '08 Proceedings of the 12th East European conference on Advances in Databases and Information Systems
Using FCA to Answer Fuzzy Queries in Cooperative Systems
FSKD '08 Proceedings of the 2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03
Incremental controlled relaxation of failing flexible queries
Journal of Intelligent Information Systems
Cooperative answering to flexible queries via a tolerance relation
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
| Hi-index | 0.00 |
The developed topic in this paper deals with a proposal of an approach based on Formal Concept Analysis to solve the problem of empty answers in the case of fuzzy conjunctive queries. Unlike our previous approach [1], which handles the whole context, our new one handles smaller contexts, determined after a pretreatment step. Thus, we suggest two algorithms. The first one detects the failure reasons of a flexible query whereas the second one provides neighbor answers. The neighbor answers are always in the first context, so we do not need to check the entire context. Similarly, to detect the failure reasons, we find frequent cases which can happen in one of the two contexts. Hence, we can reduce the search space and ensure the improvement of the response time of our previous algorithms.