Sciweavers

8575 search results - page 1428 / 1715
» A Model of Learning Using the Internet
Sort
View
ICML
2009
IEEE
16 years 5 months ago
Information theoretic measures for clusterings comparison: is a correction for chance necessary?
Information theoretic based measures form a fundamental class of similarity measures for comparing clusterings, beside the class of pair-counting based and set-matching based meas...
Xuan Vinh Nguyen, Julien Epps, James Bailey
ICML
2009
IEEE
16 years 5 months ago
Robust bounds for classification via selective sampling
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
Nicolò Cesa-Bianchi, Claudio Gentile, Franc...
ICML
2004
IEEE
16 years 5 months ago
Solving cluster ensemble problems by bipartite graph partitioning
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
Xiaoli Zhang Fern, Carla E. Brodley
ICML
2004
IEEE
16 years 5 months ago
Robust feature induction for support vector machines
The goal of feature induction is to automatically create nonlinear combinations of existing features as additional input features to improve classification accuracy. Typically, no...
Rong Jin, Huan Liu
ICML
2004
IEEE
16 years 5 months ago
Approximate inference by Markov chains on union spaces
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
Max Welling, Michal Rosen-Zvi, Yee Whye Teh
« Prev « First page 1428 / 1715 Last » Next »