
SPOT
 Referenced in 87 articles
[sw06347]
 sound statistical analysis of simulation and optimization algorithms. spot includes methods for tuning based ... classical regression and analysis of variance techniques; treebased models such as CART and random...

RRIA
 Referenced in 16 articles
[sw02558]
 rough set and rule tree based incremental knowledge acquisition algorithm. As a special ... many AI researchers to find an algorithm that can learn new knowledge quickly, based ... rough set and rule tree based incremental knowledge acquisition algorithm. It can learn from...

BiCePS
 Referenced in 9 articles
[sw06321]
 framework for implementing scalable, parallel algorithms based on tree search. ALPS is specifically designed ... support dataintensive algorithms, in which large amounts of data are required to describe ... each node in the search tree. Implementing such algorithms in a scalable manner is challenging ... search tree, but they pose further difficulties for designing scalable algorithms. The other library...

htd
 Referenced in 12 articles
[sw21112]
 free, opensource framework for (customized) tree decompositions and beyond. Decompositions of graphs play ... parameter tractable algorithms for problems that are NPhard in general. Tree decompositions ... tools for computing tree decompositions recently competed in the 1st Parameterized Algorithms and Computational Experiments ... judged without taking concrete algorithms that make use of tree decompositions into account. In fact...

STR
 Referenced in 11 articles
[sw41134]
 simple and efficient algorithm for Rtree packing. Presents the results from ... extensive comparison study of three Rtree packing algorithms: the Hilbert and nearestX packing...

NESL
 Referenced in 13 articles
[sw16627]
 suited for irregular algorithms, such as algorithms on trees, graphs or sparse matrices...

CDT
 Referenced in 12 articles
[sw00116]
 problems: The Fortran code CDT, implementing an algorithm for the asymmetric traveling salesman problem ... with the nodes of the branchdecision tree...

Blossom V
 Referenced in 28 articles
[sw04780]
 implementation of the Edmonds’s algorithm for computing a perfect matching of minimum cost ... nodes correspond to alternating trees in the Edmonds’s algorithm. While our use of priority...

FindSteinerTree
 Referenced in 12 articles
[sw08245]
 FindSteinerTree is a program for computing Steiner Trees in multiple dimensions, written by Christian Peter ... Steiner minimal trees in Euclidean dspace. Algorithmica 7:137–177). This algorithm uses ... algorithm uses Euclidean distance as the minimizing criterion. It therefore computes the tree that connects ... Squaredchange Steiner tree). This is an extension of Smith’s algorithm useful, for example...

mboost
 Referenced in 67 articles
[sw07331]
 mboost: ModelBased Boosting. Functional gradient descent algorithm (boosting) for optimizing general risk functions utilizing ... wise (penalised) least squares estimates or regression trees as baselearners for fitting generalized linear...

spheretree
 Referenced in 9 articles
[sw39489]
 algorithms for the construction of spheretrees. These algorithms include our new algorithms, which...

ORL
 Referenced in 8 articles
[sw28404]
 THEN rules. Unlike traditional decision tree algorithms like CART and C5.0, this method does...

DFLAT
 Referenced in 9 articles
[sw09895]
 FLAT: Declarative problem solving using tree decompositions and answerset programming. In this work ... rapid prototyping of dynamic programming algorithms based on tree decompositions. In fact, many such algorithms ... tree decomposition and (ii) provide an interface for declarative specifications of dynamic programming algorithms ... technical details concerned with parsing, tree decomposition, the handling of data structures, etc. Instead...

DECKARD
 Referenced in 8 articles
[sw09181]
 DECKARD: Scalable and Accurate TreeBased Detection of Code Clones. Detecting code clones has many ... this paper, we present an efficient algorithm for identifying similar subtrees ... apply it to tree representations of source code. Our algorithm is based on a novel ... considered similar. We have implemented our tree similarity algorithm as a clone detection tool called...

SqFreeEVAL
 Referenced in 11 articles
[sw07421]
 complexity analysis of adaptive algorithms (and this algorithm in particular) is a new challenge ... size of the subdivision tree for the SqFreeEVAL algorithm.The SqFreeEVAL algorithm is an evaluationbased ... wellknown in several communities. The algorithm itself is simple, but prior attempts to compute ... size of the subdivision tree for the SqFreeEVAL algorithm on the benchmark problem of isolating...

evtree
 Referenced in 11 articles
[sw14304]
 used classification and regression tree methods like the CART algorithm are recursive partitioning methods that ... efficient heuristic, the results of recursive tree methods are only locally optimal, as splits ... space of trees is to use global optimization methods like evolutionary algorithms. The evtree package ... implements an evolutionary algorithm for learning globally optimal classification and regression trees...

BinaryTrees
 Referenced in 22 articles
[sw14282]
 enumeration of trees avoiding a contiguous pattern. We provide an algorithm for computing the generating...

FNN
 Referenced in 14 articles
[sw14860]
 Fast Nearest Neighbor Search Algorithms and Applications. Covertree and kdtree fast knearest...

HHCART
 Referenced in 4 articles
[sw38489]
 class. The basic Classification and Regression Tree (CART) algorithm partitions the feature space using axis ... produce a complicated boundary structure. Oblique decision trees use oblique decision boundaries to potentially simplify ... this approach is that the tree induction algorithm is computationally expensive. Hence ... alternative, a new decision tree algorithm called HHCART is presented. The method uses a series...

BartPy
 Referenced in 83 articles
[sw40584]
 Bayesian “sumoftrees” model where each tree is constrained by a regularization prior ... accomplished via an iterative Bayesian backfitting MCMC algorithm that generates samples from a posterior. Effectively...