Results 1  10
of
15,844
Decision Tree Induction Based on Efficient Tree Restructuring
 Machine Learning
, 1996
"... . The ability to restructure a decision tree efficiently enables a variety of approaches to decision tree induction that would otherwise be prohibitively expensive. Two such approaches are described here, one being incremental tree induction (ITI), and the other being nonincremental tree induction ..."
Abstract

Cited by 141 (5 self)
 Add to MetaCart
, missing value, tree transposition, installed test, virtual pruning, update cost. 1. Introduction Decision tree induction offers a highly practical method for generalizing from examples whose class membership is known. The most common approach to inducing a decision tree is to partition the labelled
Generating Binary Trees by Transpositions
 Journal of Algorithms
, 1995
"... Let T(n) denote the set of all bitstrings with n 1's and n 0's that satisfy the property that in every prefix the number of 0's does not exceed the number of 1's. This is a well known representation of binary trees. We consider algorithms for generating the elements of T(n) that ..."
Abstract

Cited by 23 (4 self)
 Add to MetaCart
Let T(n) denote the set of all bitstrings with n 1's and n 0's that satisfy the property that in every prefix the number of 0's does not exceed the number of 1's. This is a well known representation of binary trees. We consider algorithms for generating the elements of T
Transpositions and Move Groups in Monte Carlo Tree Search
"... contributed to a significant improvement in the game of Go and has received considerable attention in other applications. This article investigates two enhancements to the UCT algorithm. First, we consider the possible adjustments to UCT when the search tree is treated as a graph (and information am ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
amongst transpositions are shared). The second modification introduces move groupings, which may reduce the effective branching factor. Experiments with both enhancements were performed using artificial trees and in the game of Go. From the experimental results we conclude that both exploiting the graph
Transposition invariant string matching
, 2003
"... Given strings A = a1a2...am and B = b1b2...bn over an alphabet Σ ⊆ U, whereU is some numerical universe closed under addition and subtraction, and a distance function d(A,B) that gives the score of the best (partial) matching of A and B, the transposition invariant distance is ..."
Abstract

Cited by 29 (8 self)
 Add to MetaCart
Given strings A = a1a2...am and B = b1b2...bn over an alphabet Σ ⊆ U, whereU is some numerical universe closed under addition and subtraction, and a distance function d(A,B) that gives the score of the best (partial) matching of A and B, the transposition invariant distance is
ProofNumber Search and Transpositions
, 1993
"... Contents Preface iii 1 Introduction 1 2 Search trees 3 3 Trees and proofnumber search 5 3.1 Informal description : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 3.2 Definitions : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 3.3 Algorithms : : : : : ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
Contents Preface iii 1 Introduction 1 2 Search trees 3 3 Trees and proofnumber search 5 3.1 Informal description : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 3.2 Definitions : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 3.3 Algorithms
Replacement Schemes for Transposition Tables
 ICCA Journal
"... Almost every chess program makes use of a transposition table, typically implemented as a large hash table. Even though this table is usually made as large as possible, subject to memory constraints, collisions occur. Then a choice has to be made which position to retain or to replace in the table, ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
as transpositions. When encountering a position again, the size of the search tree can be reduced conside...
Information in Transposition Tables
"... Due to transpositions a search tree can be considered as a search graph. The transpositions are stored with information about previous searches in a transposition table. Although the use of transposition tables is standard practice, it is still an open question how large the overall reduction is and ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Due to transpositions a search tree can be considered as a search graph. The transpositions are stored with information about previous searches in a transposition table. Although the use of transposition tables is standard practice, it is still an open question how large the overall reduction
Efficient sampling of transpositions and inverted transpositions for Bayesian MCMC
"... Abstract. The evolutionary distance between two organisms can be determined by comparing the order of appearance of orthologous genes in their genomes. Above the numerous parsimony approaches that try to obtain the shortest sequence of rearrangement operations sorting one genome into the other, Baye ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
MCMC step can reduce the mixing time of an MCMC in terms of computer running time. We introduce two efficient algorithms for characterizing and sampling transpositions and inverted transpositions for Bayesian MCMC. The first algorithm characterizes the transpositions and inverted transpositions
Results 1  10
of
15,844