Sciweavers

INFOCOM
2011
IEEE
13 years 2 months ago
Bayesian-inference based recommendation in online social networks
—In this paper, we propose a Bayesian-inference based recommendation system for online social networks. In our system, users share their content ratings with friends. The rating ...
Xiwang Yang, Yang Guo, Yong Liu
ASMTA
2011
Springer
295views Mathematics» more  ASMTA 2011»
13 years 3 months ago
Performance Evaluation of a Single Node with General Arrivals and Service
Queueing delays experienced by packets buffered at a node are among the most difficult to predict when considering the performance of a flow in a network. The arrivals of packets a...
Alexandre Brandwajn, Thomas Begin
MMM
2011
Springer
368views Multimedia» more  MMM 2011»
13 years 3 months ago
Correlated PLSA for Image Clustering
Probabilistic Latent Semantic Analysis (PLSA) has become a popular topic model for image clustering. However, the traditional PLSA method considers each image (document) independen...
Peng Li, Jian Cheng, Zechao Li, Hanqing Lu
JMLR
2010
129views more  JMLR 2010»
13 years 10 months ago
On Finding Predictors for Arbitrary Families of Processes
The problem is sequence prediction in the following setting. A sequence x1, . . . , xn, . . . of discrete-valued observations is generated according to some unknown probabilistic ...
Daniil Ryabko
NN
2000
Springer
165views Neural Networks» more  NN 2000»
13 years 11 months ago
Learning non-stationary conditional probability distributions
While sophisticated neural networks and graphical models have been developed for predicting conditional probabilities in a non-stationary environment, major improvements in the tr...
Dirk Husmeier
JAPLL
2007
83views more  JAPLL 2007»
13 years 11 months ago
Nonmonotonic conditionals that behave like conditional probabilities above a threshold
I’ll describe a range of systems for nonmonotonic conditionals that behave like conditional probabilities above a threshold. The rules that govern each system are probabilistical...
James Hawthorne
IJCAI
1989
14 years 18 days ago
Maximum Entropy in Nilsson's Probabilistic Logic
Nilsson's Probabilistic Logic is a set theoretic mechanism for reasoning with uncertainty. We propose a new way of looking at the probability constraints enforced by the fram...
Thomas B. Kane
FLAIRS
1998
14 years 24 days ago
Propagating Probabilities in System P
In this paper wesuggest a wayof using the rules of System P to propagate lower bounds on conditional probabilities. Usinga knowledgebase of default rules whichart, consideredto be...
Rachel A. Bourne, Simon Parsons
UAI
2004
14 years 24 days ago
Dependent Dirichlet Priors and Optimal Linear Estimators for Belief Net Parameters
A Bayesian belief network is a model of a joint distribution over a finite set of variables, with a DAG structure representing immediate dependencies among the variables. For each...
Peter Hooper
UAI
2004
14 years 24 days ago
Maximum Entropy for Collaborative Filtering
Within the task of collaborative filtering two challenges for computing conditional probabilities exist. First, the amount of training data available is typically sparse with resp...
C. Lawrence Zitnick, Takeo Kanade