Sciweavers

3185 search results - page 479 / 637
» Graphical models for data mining
Sort
View
ICDM
2008
IEEE
150views Data Mining» more  ICDM 2008»
14 years 4 months ago
Pseudolikelihood EM for Within-network Relational Learning
In this work, we study the problem of within-network relational learning and inference, where models are learned on a partially labeled relational dataset and then are applied to ...
Rongjing Xiang, Jennifer Neville
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
12 years 23 days ago
Learning from crowds in the presence of schools of thought
Crowdsourcing has recently become popular among machine learning researchers and social scientists as an effective way to collect large-scale experimental data from distributed w...
Yuandong Tian, Jun Zhu
KDD
2009
ACM
224views Data Mining» more  KDD 2009»
14 years 2 months ago
Issues in evaluation of stream learning algorithms
Learning from data streams is a research area of increasing importance. Nowadays, several stream learning algorithms have been developed. Most of them learn decision models that c...
João Gama, Raquel Sebastião, Pedro P...
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 6 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
NIPS
2008
13 years 11 months ago
Non-stationary dynamic Bayesian networks
Abstract: Structure learning of dynamic Bayesian networks provide a principled mechanism for identifying conditional dependencies in time-series data. This learning procedure assum...
Joshua W. Robinson, Alexander J. Hartemink