Sciweavers

57 search results - page 3 / 12
» Learning Decision Trees with log Conditional Likelihood
Sort
View
UAI
2008
13 years 7 months ago
Bayesian Out-Trees
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown p...
Tony Jebara
AAAI
2006
13 years 7 months ago
A Fast Decision Tree Learning Algorithm
There is growing interest in scaling up the widely-used decision-tree learning algorithms to very large data sets. Although numerous diverse techniques have been proposed, a fast ...
Jiang Su, Harry Zhang
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
13 years 10 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
ICMLA
2007
13 years 7 months ago
Machine learned regression for abductive DNA sequencing
We construct machine learned regressors to predict the behaviour of DNA sequencing data from the fluorescent labelled Sanger method. These predictions are used to assess hypothes...
David Thornley, Maxim Zverev, Stavros Petridis
ICML
2010
IEEE
13 years 7 months ago
Detecting Large-Scale System Problems by Mining Console Logs
Surprisingly, console logs rarely help operators detect problems in large-scale datacenter services, for they often consist of the voluminous intermixing of messages from many sof...
Wei Xu, Ling Huang, Armando Fox, David Patterson, ...