Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
BMC: an efficient method to evaluate probabilistic reachability queries
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Discovering highly reliable subgraphs in uncertain graphs
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Frequent approximate subgraphs as features for graph-based image classification
Knowledge-Based Systems
Efficient subgraph similarity search on large probabilistic graph databases
Proceedings of the VLDB Endowment
Probabilistic pattern queries over complex probabilistic graphs
Proceedings of the 2012 Joint EDBT/ICDT Workshops
Injecting uncertainty in graphs for identity obfuscation
Proceedings of the VLDB Endowment
Mining frequent subgraphs over uncertain graph databases under probabilistic semantics
The VLDB Journal — The International Journal on Very Large Data Bases
A novel model for medical image similarity retrieval
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Database research challenges and opportunities of big graph data
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Discovering frequent itemsets on uncertain data: a systematic review
MLDM'13 Proceedings of the 9th international conference on Machine Learning and Data Mining in Pattern Recognition
Aggregate nearest neighbor queries in uncertain graphs
World Wide Web
| Hi-index | 0.00 |
In many real applications, graph data is subject to uncertainties due to incompleteness and imprecision of data. Mining such uncertain graph data is semantically different from and computationally more challenging than mining conventional exact graph data. This paper investigates the problem of mining uncertain graph data and especially focuses on mining frequent subgraph patterns on an uncertain graph database. A novel model of uncertain graphs is presented, and the frequent subgraph pattern mining problem is formalized by introducing a new measure, called expected support. This problem is proved to be NP-hard. An approximate mining algorithm is proposed to find a set of approximately frequent subgraph patterns by allowing an error tolerance on expected supports of discovered subgraph patterns. The algorithm uses efficient methods to determine whether a subgraph pattern can be output or not and a new pruning method to reduce the complexity of examining subgraph patterns. Analytical and experimental results show that the algorithm is very efficient, accurate, and scalable for large uncertain graph databases. To the best of our knowledge, this paper is the first one to investigate the problem of mining frequent subgraph patterns from uncertain graph data.