Sciweavers

1661 search results - page 198 / 333
» Decision Tree Fields
Sort
View
JMLR
2010
141views more  JMLR 2010»
15 years 1 months ago
FastInf: An Efficient Approximate Inference Library
The FastInf C++ library is designed to perform memory and time efficient approximate inference in large-scale discrete undirected graphical models. The focus of the library is pro...
Ariel Jaimovich, Ofer Meshi, Ian McGraw, Gal Elida...
ICDM
2009
IEEE
124views Data Mining» more  ICDM 2009»
16 years 1 months ago
Rule Ensembles for Multi-target Regression
—Methods for learning decision rules are being successfully applied to many problem domains, especially where understanding and interpretation of the learned model is necessary. ...
Timo Aho, Bernard Zenko, Saso Dzeroski
BMCBI
2008
115views more  BMCBI 2008»
15 years 6 months ago
Improving peptide-MHC class I binding prediction for unbalanced datasets
Background: Establishment of peptide binding to Major Histocompatibility Complex class I (MHCI) is a crucial step in the development of subunit vaccines and prediction of such bin...
Ana Paula Sales, Georgia D. Tomaras, Thomas B. Kep...
POPL
2011
ACM
14 years 9 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
GBRPR
2007
Springer
15 years 10 months ago
An Efficient Ontology-Based Expert Peering System
Abstract. This paper proposes an expert peering system for information exchange. Our objective is to develop a real-time search engine for an online community where users can ask e...
Tansu Alpcan, Christian Bauckhage, Sachin Agarwal