首页> 外文会议>IEEE/ACS International Conference of Computer Systems and Applications >A Clustering Based Approach for Query Relaxation in Evidential Databases
【24h】

A Clustering Based Approach for Query Relaxation in Evidential Databases

机译:基于群集的证据数据库查询放松方法

获取原文

摘要

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.
机译:用户通过数据库构成的查询并不总是返回所需的响应。有时可能会导致空组答案,特别是当数据遍及不确定性和不确定时。因此,为了解决这个问题,我们提出了一种在证据数据库的上下文中放宽失败查询的方法。此类数据库中的不确定性在信仰功能理论中表达。我们方法的关键思想是更精确地使用机器学习方法来通过修改约束来放宽失败的查询,以便提供用户可能感兴趣的成功替代方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号