Sciweavers

272 search results - page 25 / 55
» Lazy tree splitting
Sort
View
MCS
2009
Springer
14 years 6 days ago
Random Ordinality Ensembles A Novel Ensemble Method for Multi-valued Categorical Data
Abstract. Data with multi-valued categorical attributes can cause major problems for decision trees. The high branching factor can lead to data fragmentation, where decisions have ...
Amir Ahmad, Gavin Brown
JAIR
2008
120views more  JAIR 2008»
13 years 7 months ago
Anytime Induction of Low-cost, Low-error Classifiers: a Sampling-based Approach
Machine learning techniques are gaining prevalence in the production of a wide range of classifiers for complex real-world applications with nonuniform testing and misclassificati...
Saher Esmeir, Shaul Markovitch
ENTCS
2002
90views more  ENTCS 2002»
13 years 7 months ago
Inorder traversal of splay trees
Splay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the early 1980s. Their main use is to store ordered lists. The idea is to keep the tree...
Colm Ó'Dúnlaing
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
13 years 11 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
BROADNETS
2007
IEEE
14 years 2 months ago
Online broadcasting and multicasting in WDM networks with shared light splitter bank
— In this paper we deal with online broadcasting and multicasting in a WDM optical network with shared light splitter bank. Our objective is to maximize the network throughput. S...
Weifa Liang, Yuzhen Liu