Sciweavers

65 search results - page 12 / 13
» Mixing Time of Exponential Random Graphs
Sort
View
ML
2007
ACM
156views Machine Learning» more  ML 2007»
13 years 5 months ago
Active learning for logistic regression: an evaluation
Which active learning methods can we expect to yield good performance in learning binary and multi-category logistic regression classifiers? Addressing this question is a natural ...
Andrew I. Schein, Lyle H. Ungar
CPAIOR
2007
Springer
13 years 12 months ago
Best-First AND/OR Search for 0/1 Integer Programming
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
Radu Marinescu 0002, Rina Dechter
ATAL
2006
Springer
13 years 9 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
NIPS
2008
13 years 7 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
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
14 years 6 months ago
A probabilistic framework for relational clustering
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu