Sciweavers

3718 search results - page 666 / 744
» On learning with dissimilarity functions
Sort
View
ICAI
2004
13 years 9 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...
ICETE
2004
101views Business» more  ICETE 2004»
13 years 9 months ago
Protecting Legacy Applications from Unicode
: While XML-based Web Service architectures are successfully turning the Web into an infrastructure for cooperating applications, not all problems with respect to interoperability ...
Erik Wilde
ICMLA
2004
13 years 9 months ago
Two new regularized AdaBoost algorithms
AdaBoost rarely suffers from overfitting problems in low noise data cases. However, recent studies with highly noisy patterns clearly showed that overfitting can occur. A natural s...
Yijun Sun, Jian Li, William W. Hager
ECSCW
2001
13 years 9 months ago
PolyLens: A recommender system for groups of user
We present PolyLens, a new collaborative filtering recommender system designed to recommend items for groups of users, rather than for individuals. A group recommender is more appr...
Mark O'Connor, Dan Cosley, Joseph A. Konstan, John...
NIPS
2004
13 years 9 months ago
Worst-Case Analysis of Selective Sampling for Linear-Threshold Algorithms
We provide a worst-case analysis of selective sampling algorithms for learning linear threshold functions. The algorithms considered in this paper are Perceptron-like algorithms, ...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...