Sciweavers

1683 search results - page 239 / 337
» Learning with Mixtures of Trees
Sort
View
KDD
2002
ACM
157views Data Mining» more  KDD 2002»
14 years 8 months ago
Exploiting unlabeled data in ensemble methods
An adaptive semi-supervised ensemble method, ASSEMBLE, is proposed that constructs classification ensembles based on both labeled and unlabeled data. ASSEMBLE alternates between a...
Kristin P. Bennett, Ayhan Demiriz, Richard Maclin
UAI
2000
13 years 9 months ago
The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...
Andrew W. Moore
ISMB
1993
13 years 9 months ago
Protein Structure Prediction: Selecting Salient Features from Large Candidate Pools
Weintroduce a parallel approach, "DT-SELECT," for selecting features used by inductive learning algorithms to predict protein secondary structure. DT-SELECTis able to ra...
Kevin J. Cherkauer, Jude W. Shavlik
JMLR
2008
111views more  JMLR 2008»
13 years 8 months ago
Ranking Categorical Features Using Generalization Properties
Feature ranking is a fundamental machine learning task with various applications, including feature selection and decision tree learning. We describe and analyze a new feature ran...
Sivan Sabato, Shai Shalev-Shwartz
ECCV
2002
Springer
14 years 10 months ago
Implicit Probabilistic Models of Human Motion for Synthesis and Tracking
Abstract. This paper addresses the problem of probabilistically modeling 3D human motion for synthesis and tracking. Given the high dimensional nature of human motion, learning an ...
Hedvig Sidenbladh, Michael J. Black, Leonid Sigal