Sciweavers

481 search results - page 88 / 97
» Learning relational probability trees
Sort
View
CLEF
2007
Springer
14 years 1 months ago
Unsupervised Acquiring of Morphological Paradigms from Tokenized Text
This paper describes a rather simplistic method of unsupervised morphological analysis of words in an unknown language. All what is needed is a raw text corpus in the given langua...
Daniel Zeman
PKDD
2005
Springer
164views Data Mining» more  PKDD 2005»
14 years 29 days ago
Clustering and Prediction of Mobile User Routes from Cellular Data
Location-awareness and prediction of future locations is an important problem in pervasive and mobile computing. In cellular systems (e.g., GSM) the serving cell is easily availabl...
Kari Laasonen
IDA
2006
Springer
13 years 7 months ago
Structural hidden Markov models: An application to handwritten numeral recognition
We introduce in this paper a generalization of the widely used hidden Markov models (HMM's), which we name "structural hidden Markov models" (SHMM). Our approach is ...
Djamel Bouchaffra, Jun Tan
TASLP
2008
124views more  TASLP 2008»
13 years 7 months ago
Semantic Annotation and Retrieval of Music and Sound Effects
We present a computer audition system that can both annotate novel audio tracks with semantically meaningful words and retrieve relevant tracks from a database of unlabeled audio c...
Douglas Turnbull, Luke Barrington, D. Torres, Gert...
JMLR
2010
140views more  JMLR 2010»
13 years 2 months ago
Mean Field Variational Approximation for Continuous-Time Bayesian Networks
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact r...
Ido Cohn, Tal El-Hay, Nir Friedman, Raz Kupferman