Finding Reliable Subgraphs from Large Probabilistic Graphs

Authors:
Petteri Hintsanen;Hannu Toivonen
Affiliations:
HIIT Basic Research Unit, Department of Computer Science, University of Helsinki, Finland FI---00014;HIIT Basic Research Unit, Department of Computer Science, University of Helsinki, Finland FI---00014
Venue:
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Year:
2008

Citing 1
Cited 0

Finding reliable subgraphs from large probabilistic graphs

Data Mining and Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.