Sciweavers

84 search results - page 11 / 17
» Optimal Hebbian Learning: A Probabilistic Point of View
Sort
View
AAAI
2006
13 years 9 months ago
Mechanisms for Partial Information Elicitation: The Truth, but Not the Whole Truth
We examine a setting in which a buyer wishes to purchase probabilistic information from some agent. The seller must invest effort in order to gain access to the information, and m...
Aviv Zohar, Jeffrey S. Rosenschein
ICCV
2005
IEEE
14 years 1 months ago
Priors for People Tracking from Small Training Sets
We advocate the use of Scaled Gaussian Process Latent Variable Models (SGPLVM) to learn prior models of 3D human pose for 3D people tracking. The SGPLVM simultaneously optimizes a...
Raquel Urtasun, David J. Fleet, Aaron Hertzmann, P...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
WSDM
2012
ACM
301views Data Mining» more  WSDM 2012»
12 years 3 months ago
Learning evolving and emerging topics in social media: a dynamic nmf approach with temporal regularization
As massive repositories of real-time human commentary, social media platforms have arguably evolved far beyond passive facilitation of online social interactions. Rapid analysis o...
Ankan Saha, Vikas Sindhwani
ICML
2007
IEEE
14 years 8 months ago
Conditional random fields for multi-agent reinforcement learning
Conditional random fields (CRFs) are graphical models for modeling the probability of labels given the observations. They have traditionally been trained with using a set of obser...
Xinhua Zhang, Douglas Aberdeen, S. V. N. Vishwanat...