Title
A Clustering Based Approach For Query Relaxation In Evidential Databases
Abstract
Queries posed by a user over a database do not always return the desired responses. It may sometimes result an empty set of answers especially when data are pervaded with uncertainty and imprecision. Thus, to address this problem, we propose an approach for relaxing a failing query in the context of evidential databases. The uncertainty in such databases is expressed within the belief function theory. The key idea of our approach is to use a machine learning method more precisely the belief K-modes clustering technique to relax the failing queries by modifying the constraints in order to provide successful alternatives which may be of interest to the user.
Year
Venue
Field
2016
2016 IEEE/ACS 13TH INTERNATIONAL CONFERENCE OF COMPUTER SYSTEMS AND APPLICATIONS (AICCSA)
Empty set,Computer science,Belief function theory,Artificial intelligence,Cluster analysis,Database
DocType
ISSN
Citations 
Conference
2161-5322
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Abir Amami100.34
Zied Elouedi269477.53
Allel Hadjali339149.62