Sciweavers

2990 search results - page 188 / 598
» Hidden Markov processes
Sort
View
KDD
2005
ACM
160views Data Mining» more  KDD 2005»
16 years 7 months ago
Optimizing time series discretization for knowledge discovery
Knowledge Discovery in time series usually requires symbolic time series. Many discretization methods that convert numeric time series to symbolic time series ignore the temporal ...
Alfred Ultsch, Fabian Mörchen
WEBDB
2009
Springer
124views Database» more  WEBDB 2009»
16 years 1 months ago
Bridging the Terminology Gap in Web Archive Search
Web archives play an important role in preserving our cultural heritage for future generations. When searching them, a serious problem arises from the fact that terminology evolve...
Klaus Berberich, Srikanta J. Bedathur, Mauro Sozio...
CIARP
2009
Springer
16 years 1 months ago
Learning Relational Grammars from Sequences of Actions
Many tasks can be described by sequences of actions that normally exhibit some form of structure and that can be represented by a grammar. This paper introduces FOSeq, an algorithm...
Blanca Vargas-Govea, Eduardo F. Morales
ISM
2008
IEEE
136views Multimedia» more  ISM 2008»
16 years 1 months ago
Multimodal Speaker Segmentation in Presence of Overlapped Speech Segments
We propose a multimodal speaker segmentation algorithm with two main contributions: First, we suggest a hidden Markov model architecture that performs fusion of the three modaliti...
Viktor Rozgic, Kyu Jeong Han, Panayiotis G. Georgi...
FOCI
2007
IEEE
16 years 28 days ago
Almost All Learning Machines are Singular
— A learning machine is called singular if its Fisher information matrix is singular. Almost all learning machines used in information processing are singular, for example, layer...
Sumio Watanabe