1291 search results - page 197 / 259 » Learning Rules from Distributed Data |
139
click to vote
NIPS
2001
15 years 3 months ago
2001
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
120
click to vote
ECML
2004
Springer
15 years 7 months ago
2004
Springer
It has been observed that traditional decision trees produce poor probability estimates. In many applications, however, a probability estimation tree (PET) with accurate probabilit...
120
Voted
ICDM
2007
IEEE
15 years 8 months ago
2007
IEEE
Probabilistic latent semantic indexing (PLSI) represents documents of a collection as mixture proportions of latent topics, which are learned from the collection by an expectation...
119
click to vote
DAWAK
2007
Springer
15 years 8 months ago
2007
Springer
We propose a privacy-preserving protocol for computing aggregation queries over the join of private tables. In this problem, several parties wish to share aggregated information ov...
102
click to vote
NIPS
2003
15 years 3 months ago
2003
We address the problem of learning topic hierarchies from data. The model selection problem in this domain is daunting—which of the large collection of possible trees to use? We...