Sciweavers

264 search results - page 37 / 53
» Factorial Learning and the EM Algorithm
Sort
View
ACL
2008
13 years 9 months ago
Learning Bigrams from Unigrams
Traditional wisdom holds that once documents are turned into bag-of-words (unigram count) vectors, word orders are completely lost. We introduce an approach that, perhaps surprisi...
Xiaojin Zhu, Andrew B. Goldberg, Michael Rabbat, R...
PR
2007
96views more  PR 2007»
13 years 7 months ago
Weighted and robust learning of subspace representations
A reliable system for visual learning and recognition should enable a selective treatment of individual parts of input data and should successfully deal with noise and occlusions....
Danijel Skocaj, Ales Leonardis, Horst Bischof
ICASSP
2011
IEEE
12 years 11 months ago
Maximum marginal likelihood estimation for nonnegative dictionary learning
We describe an alternative to standard nonnegative matrix factorisation (NMF) for nonnegative dictionary learning. NMF with the Kullback-Leibler divergence can be seen as maximisa...
Onur Dikmen, Cédric Févotte
TIST
2011
136views more  TIST 2011»
13 years 2 months ago
Probabilistic models for concurrent chatting activity recognition
Recognition of chatting activities in social interactions is useful for constructing human social networks. However, the existence of multiple people involved in multiple dialogue...
Jane Yung-jen Hsu, Chia-chun Lian, Wan-rong Jih
ICML
2004
IEEE
14 years 8 months ago
Leveraging the margin more carefully
Boosting is a popular approach for building accurate classifiers. Despite the initial popular belief, boosting algorithms do exhibit overfitting and are sensitive to label noise. ...
Nir Krause, Yoram Singer