Sciweavers

1531 search results - page 257 / 307
» Learning probabilistic models of the Web
Sort
View
ELPUB
1999
ACM
15 years 9 months ago
Learning Curves: Managing Smooth Product Development Cycles in Non-Print Environments
and abstract entry. But since the burgeoning of the scholarly literature since World War II, these processes had become well-known and expertly done by most organizations in the pu...
Jill O'Neill, Chris Leonard
ICCV
2009
IEEE
16 years 10 months ago
Scene Shape Priors for Superpixel Segmentation
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Superpixels are used as both regions of support for feat...
Alastair P. Moore, Simon J. D. Prince, Jonathan Wa...
ICML
2004
IEEE
16 years 6 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
RECSYS
2009
ACM
15 years 12 months ago
Collaborative prediction and ranking with non-random missing data
A fundamental aspect of rating-based recommender systems is the observation process, the process by which users choose the items they rate. Nearly all research on collaborative ļ¬...
Benjamin M. Marlin, Richard S. Zemel
MLDM
2005
Springer
15 years 11 months ago
SSC: Statistical Subspace Clustering
Subspace clustering is an extension of traditional clustering that seeks to find clusters in different subspaces within a dataset. This is a particularly important challenge with...
Laurent Candillier, Isabelle Tellier, Fabien Torre...