Sciweavers

CSDA
2006
91views more  CSDA 2006»
13 years 4 months ago
Maximum a posteriori pruning on decision trees and its application to bootstrap BUMPing
The cost-complexity pruning generates nested subtrees and selects the best one. However, its computational cost is large since it uses holdout sample or cross-validation. On the o...
Jinseog Kim, Yongdai Kim
ICASSP
2010
IEEE
13 years 5 months ago
The effect of lattice pruning on MMIE training
In discriminative training, such as Maximum Mutual Information Estimation (MMIE) training, a word lattice is usually used as a compact representation of many different sentence hy...
Long Qin, Alexander I. Rudnicky
UAI
2004
13 years 6 months ago
Region-Based Incremental Pruning for POMDPs
We present a major improvement to the incremental pruning algorithm for solving partially observable Markov decision processes. Our technique targets the cross-sum step of the dyn...
Zhengzhu Feng, Shlomo Zilberstein
IPCO
2001
117views Optimization» more  IPCO 2001»
13 years 6 months ago
Pruning by Isomorphism in Branch-and-Cut
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...
François Margot
FLAIRS
2006
13 years 6 months ago
Fast Generation of a Sequence of Trained and Validated Feed-Forward Networks
In this paper, three approaches are presented for generating and validating sequences of different size neural nets. First, a growing method is given along with several weight ini...
Pramod Lakshmi Narasimha, Walter Delashmit, Michae...
AAAI
2006
13 years 6 months ago
Properties of Forward Pruning in Game-Tree Search
Forward pruning, or selectively searching a subset of moves, is now commonly used in game-playing programs to reduce the number of nodes searched with manageable risk. Forward pru...
Yew Jin Lim, Wee Sun Lee
ECIR
2007
Springer
13 years 6 months ago
Static Pruning of Terms in Inverted Files
This paper addresses the problem of identifying collection dependent stop-words in order to reduce the size of inverted files. We present four methods to automatically recognise s...
Roi Blanco, Alvaro Barreiro
ICPR
2002
IEEE
13 years 9 months ago
Tree Pruning for Output Coded Ensembles
Output Coding is a method of converting a multiclass problem into several binary subproblems and gives an ensemble of binary classifiers. Like other ensemble methods, its perform...
Terry Windeatt, Gholamreza Ardeshir
PADL
2004
Springer
13 years 10 months ago
Pruning in the Extended Andorra Model
One of the major problems that actual logic programming systems have to address is whether and how to prune undesirable parts of the search space. A region of the search space woul...
Ricardo Lopes, Vítor Santos Costa, Fernando...
CP
2005
Springer
13 years 10 months ago
Search and Inference in AI Planning
While Planning has been a key area in Artificial Intelligence since its beginnings, significant changes have occurred in the last decade as a result of new ideas and a more estab...
Hector Geffner