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.