Sciweavers

36 search results - page 2 / 8
» Gradient-based boosting for statistical relational learning:...
Sort
View
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
14 years 5 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
ROCAI
2004
Springer
13 years 10 months ago
Learning Mixtures of Localized Rules by Maximizing the Area Under the ROC Curve
We introduce a model class for statistical learning which is based on mixtures of propositional rules. In our mixture model, the weight of a rule is not uniform over the entire ins...
Tobias Sing, Niko Beerenwinkel, Thomas Lengauer
ECAI
2004
Springer
13 years 10 months ago
Exploiting Association and Correlation Rules - Parameters for Improving the K2 Algorithm
A Bayesian network is an appropriate tool to deal with the uncertainty that is typical of real-life applications. Bayesian network arcs represent statistical dependence between dif...
Evelina Lamma, Fabrizio Riguzzi, Sergio Storari
KDD
2008
ACM
259views Data Mining» more  KDD 2008»
14 years 5 months ago
Using ghost edges for classification in sparsely labeled networks
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
13 years 9 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman