Sciweavers

481 search results - page 91 / 97
» Learning relational probability trees
Sort
View
NIPS
1998
13 years 8 months ago
An Entropic Estimator for Structure Discovery
We introduce a novel framework for simultaneous structure and parameter learning in hidden-variable conditional probability models, based on an entropic prior and a solution for i...
Matthew Brand
INFOCOM
2010
IEEE
13 years 5 months ago
Reliable Wireless Broadcasting with Near-Zero Feedback
We examine the problem of minimizing feedbacks in reliable wireless broadcasting, by pairing rateless coding with extreme value theory. Our key observation is that, in a broadcast ...
Weiyao Xiao, Sachin Agarwal, David Starobinski, Ar...
BMCBI
2008
130views more  BMCBI 2008»
13 years 7 months ago
A database of phylogenetically atypical genes in archaeal and bacterial genomes, identified using the DarkHorse algorithm
Background: The process of horizontal gene transfer (HGT) is believed to be widespread in Bacteria and Archaea, but little comparative data is available addressing its occurrence ...
Sheila Podell, Terry Gaasterland, Eric E. Allen
ESANN
2006
13 years 8 months ago
Random Forests Feature Selection with K-PLS: Detecting Ischemia from Magnetocardiograms
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
14 years 2 months ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr