Sciweavers

440 search results - page 71 / 88
» A Fast Algorithm for Learning a Ranking Function from Large-...
Sort
View
140
Voted
ICAI
2004
15 years 4 months ago
A Comparison of Resampling Methods for Clustering Ensembles
-- Combination of multiple clusterings is an important task in the area of unsupervised learning. Inspired by the success of supervised bagging algorithms, we propose a resampling ...
Behrouz Minaei-Bidgoli, Alexander P. Topchy, Willi...
CIDM
2009
IEEE
15 years 9 months ago
Ensemble member selection using multi-objective optimization
— Both theory and a wealth of empirical studies have established that ensembles are more accurate than single predictive models. Unfortunately, the problem of how to maximize ens...
Tuve Löfström, Ulf Johansson, Henrik Bos...
117
Voted
ICML
2005
IEEE
16 years 3 months ago
High speed obstacle avoidance using monocular vision and reinforcement learning
We consider the task of driving a remote control car at high speeds through unstructured outdoor environments. We present an approach in which supervised learning is first used to...
Jeff Michels, Ashutosh Saxena, Andrew Y. Ng
156
Voted
JMLR
2008
148views more  JMLR 2008»
15 years 2 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
135
Voted
BMCBI
2007
145views more  BMCBI 2007»
15 years 2 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...