583 search results - page 27 / 117 » Efficient algorithms for constructing decision trees with co... |
115
click to vote
JMLR
2010
14 years 4 months ago
2010
Subgroup discovery aims at finding subsets of a population whose class distribution is significantly different from the overall distribution. A number of multi-class subgroup disc...
TCAD
2008
14 years 9 months ago
2008
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
BMCBI
2005
14 years 9 months ago
2005
Background: Structure-dependent substitution matrices increase the accuracy of sequence alignments when the 3D structure of one sequence is known, and are successful e.g. in fold ...
80
Voted
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper addresses the problem of detecting and segmenting partially occluded objects of a known category. We first define a part labelling which densely covers the object. Our ...
100
click to vote
DIS
2001
Springer
15 years 2 months ago
2001
Springer
In the context of classification problems, algorithms that generate multivariate trees are able to explore multiple representation languages by using decision tests based on a com...