PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Fast Discovery of Reliable k-terminal Subgraphs
Melissa Kasari, Hannu Toivonen and Petteri Hintsanen
In: 14th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), Jun 2010, Hyderabad, India.


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 connec- tivity 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 inte- ger 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 max- imized. Previous algorithms for the problem are either computationally demanding, or restricted to only two query nodes. Our algorithm ex- tends a previous algorithm to handle k query nodes, where 2 ≤ k ≤ |V |. We demonstrate experimentally the usefulness of reliable k-terminal sub- graphs, and the accuracy, efficiency and scalability of the proposed algo- rithm on real graphs derived from public biological databases.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:7885
Deposited By:Hannu Toivonen
Deposited On:17 March 2011