Sciweavers

836 search results - page 35 / 168
» Online EM Algorithm for Latent Data Models
Sort
View
84
Voted
SIGIR
2006
ACM
15 years 4 months ago
Probabilistic latent query analysis for combining multiple retrieval sources
Combining the output from multiple retrieval sources over the same document collection is of great importance to a number of retrieval tasks such as multimedia retrieval, web retr...
Rong Yan, Alexander G. Hauptmann
ICDAR
2009
IEEE
14 years 8 months ago
Stochastic Model of Stroke Order Variation
A stochastic model of stroke order variation is proposed and applied to the stroke-order free on-line Kanji character recognition. The proposed model is a hidden Markov model (HMM...
Yoshinori Katayama, Seiichi Uchida, Hiroaki Sakoe
83
Voted
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
15 years 4 months ago
Latent Dirichlet Allocation and Singular Value Decomposition Based Multi-document Summarization
Multi-Document Summarization deals with computing a summary for a set of related articles such that they give the user a general view about the events. One of the objectives is th...
Rachit Arora, Balaraman Ravindran
100
Voted
CIKM
2009
Springer
15 years 2 months ago
Heterogeneous cross domain ranking in latent space
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
Bo Wang, Jie Tang, Wei Fan, Songcan Chen, Zi Yang,...
CLEF
2009
Springer
14 years 11 months ago
Unsupervised Word Decomposition with the Promodes Algorithm
We present Promodes, an algorithm for unsupervised word decomposition, which is based on a probabilistic generative model. The model considers segment boundaries as hidden variable...
Sebastian Spiegler, Bruno Golénia, Peter A....