Sciweavers

2912 search results - page 195 / 583
» Logistic Model Trees
Sort
View
CLASSIFICATION
2004
59views more  CLASSIFICATION 2004»
15 years 3 months ago
Oscillation Heuristics for the Two-group Classification Problem
: We propose a new nonparametric family of oscillation heuristics for improving linear classifiers in the two-group discriminant problem. The heuristics are motivated by the intuit...
Ognian Asparouhov, Paul A. Rubin
163
Voted
JMLR
2010
143views more  JMLR 2010»
15 years 2 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
162
Voted
ICPR
2010
IEEE
15 years 1 months ago
Multiple Kernel Learning with High Order Kernels
Previous Multiple Kernel Learning approaches (MKL) employ different kernels by their linear combination. Though some improvements have been achieved over methods using single kerne...
Shuhui Wang, Shuqiang Jiang, Qingming Huang, Qi Ti...
127
Voted
RECOMB
2005
Springer
16 years 4 months ago
Reconstruction of Reticulate Networks from Gene Trees
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
Daniel H. Huson, Tobias H. Klöpper, Pete J. L...
136
Voted
QEST
2008
IEEE
15 years 10 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...