The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
The Effects of Singular Value Decomposition on Collaborative Filtering
The Effects of Singular Value Decomposition on Collaborative Filtering
ACM SIGKDD Explorations Newsletter
Introduction to Statistical Relational Learning (Adaptive Computation and Machine Learning)
Introduction to Statistical Relational Learning (Adaptive Computation and Machine Learning)
Trust Region Newton Method for Logistic Regression
The Journal of Machine Learning Research
Factorization meets the neighborhood: a multifaceted collaborative filtering model
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Evaluation Measures for Ordinal Regression
ISDA '09 Proceedings of the 2009 Ninth International Conference on Intelligent Systems Design and Applications
Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
k-nearest neighbors in uncertain graphs
Proceedings of the VLDB Endowment
Distance-constraint reachability computation in uncertain graphs
Proceedings of the VLDB Endowment
Improving the accuracy of similarity measures by using link information
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
Second workshop on information heterogeneity and fusion in recommender systems (HetRec2011)
Proceedings of the fifth ACM conference on Recommender systems
| Hi-index | 0.00 |
The probabilistic graphs framework models the uncertainty inherent in real-world domains by means of probabilistic edges whose value quantifies the likelihood of the edge existence or the strength of the link it represents. The goal of this paper is to provide a learning method to compute the most likely relationship between two nodes in a framework based on probabilistic graphs. In particular, given a probabilistic graph we adopted the language-constrained reachability method to compute the probability of possible interconnections that may exists between two nodes. Each of these connections may be viewed as feature, or factor, between the two nodes and the corresponding probability as its weight. Each observed link is considered as a positive instance for its corresponding link label. Given the training set of observed links a L2-regularized Logistic Regression has been adopted to learn a model able to predict unobserved link labels.