Sciweavers

NIPS
2001
13 years 11 months ago
The Intelligent surfer: Probabilistic Combination of Link and Content Information in PageRank
The PageRank algorithm, used in the Google search engine, greatly improves the results of Web search by taking into account the link structure of the Web. PageRank assigns to a pa...
Matthew Richardson, Pedro Domingos
NIPS
2001
13 years 11 months ago
On the Convergence of Leveraging
We give an unified convergence analysis of ensemble learning methods including e.g. AdaBoost, Logistic Regression and the Least-SquareBoost algorithm for regression. These methods...
Gunnar Rätsch, Sebastian Mika, Manfred K. War...
NIPS
2001
13 years 11 months ago
Infinite Mixtures of Gaussian Process Experts
We present an extension to the Mixture of Experts (ME) model, where the individual experts are Gaussian Process (GP) regression models. Using an input-dependent adaptation of the ...
Carl Edward Rasmussen, Zoubin Ghahramani
NIPS
2001
13 years 11 months ago
Scaling Laws and Local Minima in Hebbian ICA
We study the dynamics of a Hebbian ICA algorithm extracting a single non-Gaussian component from a high-dimensional Gaussian background. For both on-line and batch learning we fin...
Magnus Rattray, Gleb Basalyga
NIPS
2001
13 years 11 months ago
MIME: Mutual Information Minimization and Entropy Maximization for Bayesian Belief Propagation
Bayesian belief propagation in graphical models has been recently shown to have very close ties to inference methods based in statistical physics. After Yedidia et al. demonstrate...
Anand Rangarajan, Alan L. Yuille
NIPS
2001
13 years 11 months ago
Learning a Gaussian Process Prior for Automatically Generating Music Playlists
This paper presents AutoDJ: a system for automatically generating music playlists based on one or more seed songs selected by a user. AutoDJ uses Gaussian Process Regression to le...
John C. Platt, Christopher J. C. Burges, S. Swenso...
NIPS
2001
13 years 11 months ago
Matching Free Trees with Replicator Equations
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
Marcello Pelillo
NIPS
2001
13 years 11 months ago
Grammatical Bigrams
Unsupervised learning algorithms have been derived for several statistical models of English grammar, but their computational complexity makes applying them to large data sets int...
Mark A. Paskin
NIPS
2001
13 years 11 months ago
Speech Recognition with Missing Data using Recurrent Neural Nets
In the `missing data' approach to improving the robustness of automatic speech recognition to added noise, an initial process identifies spectraltemporal regions which are do...
S. Parveen, P. Green