Data structures and network algorithms
Data structures and network algorithms
An interactive system for finding complementary literatures: a stimulus to scientific discovery
Artificial Intelligence - Special issue on scientific discovery
SIAM Journal on Computing
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Unsupervised Link Discovery in Multi-relational Data via Rarity Analysis
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
The link prediction problem for social networks
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Fast discovery of connection subgraphs
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
ACM SIGKDD Explorations Newsletter
Discovering informative connection subgraphs in multi-relational graphs
ACM SIGKDD Explorations Newsletter
Compressing probabilistic Prolog programs
Machine Learning
Finding reliable subgraphs from large probabilistic graphs
Data Mining and Knowledge Discovery
Probabilistic Explanation Based Learning
ECML '07 Proceedings of the 18th European conference on Machine Learning
The Most Reliable Subgraph Problem
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
Parameter Learning in Probabilistic Databases: A Least Squares Approach
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
On the Efficient Execution of ProbLog Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
ProbLog: a probabilistic prolog and its application in link discovery
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Local query mining in a probabilistic prolog
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
CIBCB'09 Proceedings of the 6th Annual IEEE conference on Computational Intelligence in Bioinformatics and Computational Biology
Mining preorder relation between knowledge units from text
Proceedings of the 2010 ACM Symposium on Applied Computing
Supporting creativity: towards associative discovery of new insights
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
What is frequent in a single graph?
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
The community-search problem and how to plan a successful cocktail party
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Supporting retrieval of diverse biomedical data using evidence-aware queries
Journal of Biomedical Informatics
k-nearest neighbors in uncertain graphs
Proceedings of the VLDB Endowment
Variable compression in ProbLog
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
On the implementation of the probabilistic logic programming language problog
Theory and Practice of Logic Programming
Mining learning-dependency between knowledge units from text
The VLDB Journal — The International Journal on Very Large Data Bases
Fast discovery of reliable k-terminal subgraphs
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
A framework for path-oriented network simplification
IDA'10 Proceedings of the 9th international conference on Advances in Intelligent Data Analysis
From information networks to bisociative information networks
Bisociative Knowledge Discovery
Patterns and logic for reasoning with networks
Bisociative Knowledge Discovery
Review of bisonet abstraction techniques
Bisociative Knowledge Discovery
Simplification of networks by edge pruning
Bisociative Knowledge Discovery
Finding representative nodes in probabilistic graphs
Bisociative Knowledge Discovery
Biomine: a network-structured resource of biological entities for link prediction
Bisociative Knowledge Discovery
Semantic subgroup discovery and cross-context linking for microarray data analysis
Bisociative Knowledge Discovery
Modelling a biological system: network creation by triplet extraction from biological literature
Bisociative Knowledge Discovery
MCINTYRE: A Monte Carlo System for Probabilistic Logic Programming
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
| Hi-index | 0.00 |
Public biological databases contain vast amounts of rich data that can also be used to create and evaluate new biological hypothesis. We propose a method for link discovery in biological databases, i.e., for prediction and evaluation of implicit or previously unknown connections between biological entities and concepts. In our framework, information extracted from available databases is represented as a graph, where vertices correspond to entities and concepts, and edges represent known, annotated relationships between vertices. A link, an (implicit and possibly unknown) relation between two entities is manifested as a path or a subgraph connecting the corresponding vertices. We propose measures for link goodness that are based on three factors: edge reliability, relevance, and rarity. We handle these factors with a proper probabilistic interpretation. We give practical methods for finding and evaluating links in large graphs and report experimental results with Alzheimer genes and protein interactions.