Sciweavers

3658 search results - page 400 / 732
» An Approach To Data Distributions in Chapel
Sort
View
PAMI
2011
15 years 1 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
KDD
2012
ACM
179views Data Mining» more  KDD 2012»
13 years 9 months ago
Transparent user models for personalization
Personalization is a ubiquitous phenomenon in our daily online experience. While such technology is critical for helping us combat the overload of information we face, in many cas...
Khalid El-Arini, Ulrich Paquet, Ralf Herbrich, Jur...
AAAI
2008
15 years 9 months ago
Maximum Entropy Inverse Reinforcement Learning
Recent research has shown the benefit of framing problems of imitation learning as solutions to Markov Decision Problems. This approach reduces learning to the problem of recoveri...
Brian Ziebart, Andrew L. Maas, J. Andrew Bagnell, ...
ICPR
2006
IEEE
16 years 8 months ago
Dissimilarity-based classification for vectorial representations
General dissimilarity-based learning approaches have been proposed for dissimilarity data sets [11, 10]. They arise in problems in which direct comparisons of objects are made, e....
Elzbieta Pekalska, Robert P. W. Duin
WWW
2005
ACM
16 years 7 months ago
WAND: a meta-data maintenance system over the internet
WAND is a meta-data management system that provides a file-system tree for users of an internet based P2P network. The tree is robust and retains its structure even when nodes (pe...
Anubhav Bhatia, Saikat Mukherjee, Saugat Mitra, Sr...