Sciweavers

2030 search results - page 392 / 406
» Estimation of Chaotic Probabilities
Sort
View
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
13 years 9 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
NIPS
1990
13 years 8 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro
GECCO
2010
Springer
186views Optimization» more  GECCO 2010»
13 years 8 months ago
Genetic rule extraction optimizing brier score
Most highly accurate predictive modeling techniques produce opaque models. When comprehensible models are required, rule extraction is sometimes used to generate a transparent mod...
Ulf Johansson, Rikard König, Lars Niklasson
ATAL
2010
Springer
13 years 7 months ago
A probabilistic model for trust and reputation
This paper concerns the problem of agent trust in an electronic market place. We maintain that agent trust involves making decisions under uncertainty and therefore the phenomenon...
George Vogiatzis, Ian MacGillivray, Maria Chli
CVPR
2010
IEEE
13 years 7 months ago
Label propagation in video sequences
This paper proposes a probabilistic graphical model for the problem of propagating labels in video sequences, also termed the label propagation problem. Given a limited amount of ...
Vijay Badrinarayanan, Fabio Galasso, Roberto Cipol...