Managing and Mining Graph Data
Managing and Mining Graph Data
TEDI: efficient shortest path query answering on graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Frequent Subgraph Patterns from Uncertain Graph Data
IEEE Transactions on Knowledge and Data Engineering
Efficient graph reachability query answering using tree decomposition
RP'10 Proceedings of the 4th international conference on Reachability problems
k-nearest neighbors in uncertain graphs
Proceedings of the VLDB Endowment
A family of graph-theory-driven algorithms for managing complex probabilistic graph data efficiently
Proceedings of the 15th Symposium on International Database Engineering & Applications
Efficiently answering probability threshold-based shortest path queries over uncertain graphs
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
| Hi-index | 0.00 |
This paper introduces probabilistic pattern queries over complex probabilistic graphs, a theoretical graph model proposed by us recently for dealing with complex probabilistic graph data of modern applications characterized by uncertainty and imprecision. Effective algorithms implementing such queries are also provided.