Sciweavers

589 search results - page 5 / 118
» On the Use of Combining Rules in Relational Probability Tree...
Sort
View
CPC
2006
110views more  CPC 2006»
14 years 9 months ago
Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
József Balogh, Yuval Peres, Gábor Pe...
ML
2012
ACM
413views Machine Learning» more  ML 2012»
13 years 5 months ago
Gradient-based boosting for statistical relational learning: The relational dependency network case
Dependency networks approximate a joint probability distribution over multiple random variables as a product of conditional distributions. Relational Dependency Networks (RDNs) are...
Sriraam Natarajan, Tushar Khot, Kristian Kersting,...
JMLR
2010
146views more  JMLR 2010»
14 years 4 months ago
Accurate Ensembles for Data Streams: Combining Restricted Hoeffding Trees using Stacking
The success of simple methods for classification shows that is is often not necessary to model complex attribute interactions to obtain good classification accuracy on practical p...
Albert Bifet, Eibe Frank, Geoffrey Holmes, Bernhar...
CADE
1998
Springer
15 years 1 months ago
Strict Basic Superposition
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
Leo Bachmair, Harald Ganzinger
FLAIRS
2001
14 years 11 months ago
Decision Tree Rule Reduction Using Linear Classifiers in Multilayer Perceptron
It hasbeenshownthat a neuralnetworkis better thana direct applicationof inductiontrees in modelingcomplex relations of inputattributes in sampledata. We proposethat conciserules b...
DaeEun Kim, Sea Woo Kim