论文信息 - Finding Reliable Subgraphs from Large Probabilistic Graphs

Finding Reliable Subgraphs from Large Probabilistic Graphs

Consider information search or discovery in a large graph of concepts and their weighted relationships. The user initiates a query by specifying some concepts ("search terms"), and wishes to obtain other concepts and relationships that connect the search concepts. An application example is in analysis of biological information, conveniently represented as a graph of biological concepts and their relations. A search engine we envision would allow a life scientist to query for connections between a gene and a phenotype, for instance, to find information supporting a hypothesis, or to help discover new hypothesis.

Hannu Toivonen | Petteri Hintsanen

[1] Subhash Suri,et al. Finding the k shortest simple paths , 2007, ALENEX.

[2] Liam Roditty,et al. On the K-simple shortest paths problem in weighted directed graphs , 2007, SODA '07.

[3] Petteri Hintsanen. The Most Reliable Subgraph Problem , 2007, PKDD.

[4] David Eppstein,et al. Finding the k Shortest Paths , 1999, SIAM J. Comput..

[5] Hannu Toivonen,et al. Finding reliable subgraphs from large probabilistic graphs , 2008, Data Mining and Knowledge Discovery.

[6] Z W Birnbaum,et al. ON THE IMPORTANCE OF DIFFERENT COMPONENTS IN A MULTICOMPONENT SYSTEM , 1968 .

[7] Eugene L. Lawler,et al. The Recognition of Series Parallel Digraphs , 1982, SIAM J. Comput..

[8] E. Lawler. A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .

[9] Hannu Toivonen,et al. Link Discovery in Graphs Derived from Biological Databases , 2006, DILS.

[10] Charles J. Colbourn,et al. The Combinatorics of Network Reliability , 1987 .

[11] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[12] Luc De Raedt,et al. Compressing probabilistic Prolog programs , 2007, Machine Learning.

[13] Christos Faloutsos,et al. Fast discovery of connection subgraphs , 2004, KDD.

[14] R. Duffin. Topology of series-parallel networks , 1965 .