首页> 外文会议>Workshop on mining and learning with graphs >Querying Graphs with Uncertain Predicates
【24h】

Querying Graphs with Uncertain Predicates

机译:查询具有不确定谓词的图表

获取原文

摘要

In many applications the available data give rise to an attributed graph, with the nodes corresponding to the entities of interest, edges to their relationships and attributes on both provide additional characteristics. To mine such data structures we have proposed a visual analytic algebra that enhances the atomic operators of selection, aggregation and a visualization step that allows the user to interact with the data. However, in many settings the user has a certain degree of uncertainty about the desired query; the problem is further compounded if the final results are the product of a series of such uncertain queries. To address this issue, we introduce a probabilistic framework that incorporates uncertainty in the queries and provides a probabilistic assessment of the likelihood of the obtained outcomes. We discuss its technical characteristics and illustrate it on a number of examples.
机译:在许多应用中,可用数据导致归因图,其中与感兴趣的实体对应的节点,对其关系的边缘以及两者都提供附加特征。为了挖掘这种数据结构,我们提出了一种可视化学分析代数,该代数增强了选择,聚合和可视化步骤的原子操作者,允许用户与数据交互。但是,在许多设置中,用户对所需查询具有一定程度的不确定性;如果最终结果是一系列这种不确定的查询的产物,则该问题进一步复杂化。为了解决这个问题,我们介绍了一个概率框架,该框架在查询中融入了不确定性,并提供了对所获得的结果的可能性的概率评估。我们讨论其技术特征,并在许多例子上说明。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号