Sciweavers

219 search results - page 31 / 44
» Optimal dyadic decision trees
Sort
View
JMLR
2010
129views more  JMLR 2010»
13 years 5 months ago
Learning Polyhedral Classifiers Using Logistic Function
In this paper we propose a new algorithm for learning polyhedral classifiers. In contrast to existing methods for learning polyhedral classifier which solve a constrained optimiza...
Naresh Manwani, P. S. Sastry
AAAI
2010
13 years 12 months ago
Symbolic Dynamic Programming for First-order POMDPs
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
Scott Sanner, Kristian Kersting

Book
688views
15 years 8 months ago
Database Management Systems
A set of presentations covering the book, which includes the following topics ER Model and Conceptual Design, The Relational Model and SQL DDL, Relational Algebra, SQL, Database Ap...
Raghu Ramakrishnan, Johannes Gehrke
ICDE
2002
IEEE
104views Database» more  ICDE 2002»
14 years 11 months ago
Efficient Evaluation of Queries with Mining Predicates
Modern relational database systems are beginning to support ad hoc queries on mining models. In this paper, we explore novel techniques for optimizing queries that apply mining mo...
Surajit Chaudhuri, Vivek R. Narasayya, Sunita Sara...
ICPR
2006
IEEE
14 years 11 months ago
ECOC-ONE: A Novel Coding and Decoding Strategy
Error correcting output codes (ECOC) represent a classification technique that allows a successful extension of binary classifiers to address the multiclass problem. In this paper...
Oriol Pujol, Sergio Escalera