Sciweavers

141 search results - page 13 / 29
» Spectral Clustering and Embedding with Hidden Markov Models
Sort
View
ICMCS
2006
IEEE
344views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Pattern Mining in Visual Concept Streams
Pattern mining algorithms are often much easier applied than quantitatively assessed. In this paper we address the pattern evaluation problem by looking at both the capability of ...
Lexing Xie, Shih-Fu Chang
INTERSPEECH
2010
13 years 2 months ago
Efficient HMM-based estimation of missing features, with applications to packet loss concealment
In this paper, we present efficient HMM-based techniques for estimating missing features. By assuming speech features to be observations of hidden Markov processes, we derive a mi...
Bengt J. Borgström, Per Henrik Borgström...
NIPS
2003
13 years 9 months ago
Fast Algorithms for Large-State-Space HMMs with Applications to Web Usage Analysis
In applying Hidden Markov Models to the analysis of massive data streams, it is often necessary to use an artificially reduced set of states; this is due in large part to the fac...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher, Jon...
ICML
2007
IEEE
14 years 8 months ago
Statistical predicate invention
We propose statistical predicate invention as a key problem for statistical relational learning. SPI is the problem of discovering new concepts, properties and relations in struct...
Stanley Kok, Pedro Domingos
INTERSPEECH
2010
13 years 2 months ago
Synthesis of fast speech with interpolation of adapted HSMMs and its evaluation by blind and sighted listeners
In this paper we evaluate a method for generating synthetic speech at high speaking rates based on the interpolation of hidden semi-Markov models (HSMMs) trained on speech data re...
Michael Pucher, Dietmar Schabus, Junichi Yamagishi