Sciweavers

528 search results - page 67 / 106
» Causal inference using the algorithmic Markov condition
Sort
View
TMC
2008
125views more  TMC 2008»
14 years 9 months ago
Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
Hong-Yen Yang, Chia-Hung Lin, Ming-Jer Tsai
NIPS
2008
14 years 11 months ago
Stochastic Relational Models for Large-scale Dyadic Data using MCMC
Stochastic relational models (SRMs) [15] provide a rich family of choices for learning and predicting dyadic data between two sets of entities. The models generalize matrix factor...
Shenghuo Zhu, Kai Yu, Yihong Gong
ISMIR
2005
Springer
142views Music» more  ISMIR 2005»
15 years 3 months ago
A Probabilistic Model for Chord Progressions
Chord progressions are the building blocks from which tonal music is constructed. Inferring chord progressions is thus an essential step towards modeling long term dependencies in...
Jean-François Paiement, Douglas Eck, Samy B...
UAI
2003
14 years 11 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
BMCBI
2007
152views more  BMCBI 2007»
14 years 10 months ago
Difference-based clustering of short time-course microarray data with replicates
Background: There are some limitations associated with conventional clustering methods for short time-course gene expression data. The current algorithms require prior domain know...
Jihoon Kim, Ju Han Kim