output
20022013
most citedLearning When Training Data are Costly: The Effect of Class Distribution on Tree Induction

930 citations

Showing 2013Show all

12 papers · 1 filter

cs.AI2013

Value of Evidence on Influence Diagrams

Kazuo J. Ezawa

In this paper, we introduce evidence propagation operations on influence diagrams and a concept of value of evidence, which measures the value of experimentation. Evidence propagat…

cs.IT20136 cited

Exact-Repair Regenerating Codes Via Layered Erasure Correction and Block Designs

Chao Tian, Vaneet Aggarwal, Vinay A. Vaishampayan

A new class of exact-repair regenerating codes is constructed by combining two layers of erasure correction codes together with combinatorial block designs, e.g., Steiner systems,…

cs.DS20131 cited

On the Tradeoff between Stability and Fit

Edith Cohen, Graham Cormode, Nick Duffield +1

In computing, as in many aspects of life, changes incur cost. Many optimization problems are formulated as a one-time instance starting from scratch. However, a common case that ar…

cs.LG201313 cited

An Information-Theoretic Analysis of Hard and Soft Assignment Methods for Clustering

Michael Kearns, Yishay Mansour, Andrew Y. Ng

Assignment methods are at the heart of many algorithms for unsupervised learning and clustering - in particular, the well-known K-means and Expectation-Maximization (EM) algorithms…

cs.LG201339 cited

Update Rules for Parameter Estimation in Bayesian Networks

Eric Bauer, Daphne Koller, Yoram Singer

This paper re-examines the problem of parameter estimation in Bayesian networks with missing values and hidden variables from the perspective of recent work in on-line learning [Ki…

cs.LG201351 cited

Large Deviation Methods for Approximate Probabilistic Inference

Michael Kearns, Lawrence Saul

We study two-layer belief networks of binary random variables in which the conditional probabilities Pr[childlparents] depend monotonically on weighted sums of the parents. In larg…