An algorithm for dynamic subset and intersection testing
Theoretical Computer Science
Journal of the ACM (JACM)
Network reliability evaluation
Network performance modeling and simulation
Algorithm 447: efficient algorithms for graph manipulation
Communications of the ACM
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Propagation of trust and distrust
Proceedings of the 13th international conference on World Wide Web
Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
Mining closed relational graphs with connectivity constraints
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Frequent pattern mining: current status and future directions
Data Mining and Knowledge Discovery
Do social networks improve e-commerce?: a study on social marketplaces
Proceedings of the first workshop on Online social networks
Finding reliable subgraphs from large probabilistic graphs
Data Mining and Knowledge Discovery
The Most Reliable Subgraph Problem
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
gApprox: Mining Frequent Approximate Patterns from a Massive Network
ICDM '07 Proceedings of the 2007 Seventh IEEE International Conference on Data Mining
Trend Motif: A Graph Mining Approach for Analysis of Dynamic Complex Networks
ICDM '07 Proceedings of the 2007 Seventh IEEE International Conference on Data Mining
Managing and Mining Uncertain Data
Managing and Mining Uncertain Data
An efficient rigorous approach for identifying statistically significant frequent itemsets
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Fast Discovery of Reliable Subnetworks
ASONAM '10 Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining
k-nearest neighbors in uncertain graphs
Proceedings of the VLDB Endowment
Distance-constraint reachability computation in uncertain graphs
Proceedings of the VLDB Endowment
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
Fast discovery of reliable k-terminal subgraphs
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Injecting uncertainty in graphs for identity obfuscation
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
In this paper, we investigate the highly reliable subgraph problem, which arises in the context of uncertain graphs. This problem attempts to identify all induced subgraphs for which the probability of connectivity being maintained under uncertainty is higher than a given threshold. This problem arises in a wide range of network applications, such as protein-complex discovery, network routing, and social network analysis. Since exact discovery may be computationally intractable, we introduce a novel sampling scheme which enables approximate discovery of highly reliable subgraphs with high probability. Furthermore, we transform the core mining task into a new frequent cohesive set problem in deterministic graphs. Such transformation enables the development of an efficient two-stage approach which combines novel peeling techniques for maximal set discovery with depth-first search for further enumeration. We demonstrate the effectiveness and efficiency of the proposed algorithms on real and synthetic data sets.