Fast discovery of reliable k-terminal subgraphs

Authors:
Melissa Kasari;Hannu Toivonen;Petteri Hintsanen
Affiliations:
Department of Computer Science and, Helsinki Institute for Information Technology HIIT, University of Helsinki, Finland;Department of Computer Science and, Helsinki Institute for Information Technology HIIT, University of Helsinki, Finland;Department of Computer Science and, Helsinki Institute for Information Technology HIIT, University of Helsinki, Finland
Venue:
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Year:
2010

Citing 9
Cited 2

The Combinatorics of Network Reliability

The Combinatorics of Network Reliability
Fast discovery of connection subgraphs

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Measuring and extracting proximity in networks

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Center-piece subgraphs: problem definition and fast solutions

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Compressing probabilistic Prolog programs

Machine Learning
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
ProbLog: a probabilistic prolog and its application in link discovery

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Link discovery in graphs derived from biological databases

DILS'06 Proceedings of the Third international conference on Data Integration in the Life Sciences

Discovering highly reliable subgraphs in uncertain graphs

Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Patterns and logic for reasoning with networks

Bisociative Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel and efficient algorithm for solving the most reliable subgraph problem with multiple query nodes on undirected random graphs Reliable subgraphs are useful for summarizing connectivity between given query nodes Formally, we are given a graph G=(V, E), a set of query (or terminal) nodes Q⊂V, and a positive integer B The objective is to find a subgraph H⊂G containing Q, such that H has at most B edges, and the probability that H is connected is maximized Previous algorithms for the problem are either computationally demanding, or restricted to only two query nodes Our algorithm extends a previous algorithm to handle k query nodes, where 2≤k≤|V| We demonstrate experimentally the usefulness of reliable k-terminal subgraphs, and the accuracy, efficiency and scalability of the proposed algorithm on real graphs derived from public biological databases.