Author of the publication

Finding Reliable Subgraphs from Large Probabilistic Graphs.

, and . ECML/PKDD (1), volume 5211 of Lecture Notes in Computer Science, page 15. Springer, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Fast Discovery of Reliable Subnetworks., , and . ASONAM, page 104-111. IEEE Computer Society, (2010)Fast Discovery of Reliable k-terminal Subgraphs., , and . PAKDD (2), volume 6119 of Lecture Notes in Computer Science, page 168-177. Springer, (2010)Link Discovery in Graphs Derived from Biological Databases., , , , and . DILS, volume 4075 of Lecture Notes in Computer Science, page 35-49. Springer, (2006)Making Sense of Large-Scale Kinase Inhibitor Bioactivity Data Sets: A Comparative and Integrative Analysis., , , , , , and . J. Chem. Inf. Model., 54 (3): 735-743 (2014)Biomine: A Network-Structured Resource of Biological Entities for Link Prediction., , and . Bisociative Knowledge Discovery, volume 7250 of Lecture Notes in Computer Science, Springer, (2012)The Most Reliable Subgraph Problem.. PKDD, volume 4702 of Lecture Notes in Computer Science, page 471-478. Springer, (2007)Finding Reliable Subgraphs from Large Probabilistic Graphs., and . ECML/PKDD (1), volume 5211 of Lecture Notes in Computer Science, page 15. Springer, (2008)