Sciweavers

10 search results - page 2 / 2
» A Better Alternative to Piecewise Linear Time Series Segment...
Sort
View
ICML
2007
IEEE
14 years 6 months ago
Piecewise pseudolikelihood for efficient training of conditional random fields
Discriminative training of graphical models can be expensive if the variables have large cardinality, even if the graphical structure is tractable. In such cases, pseudolikelihood...
Charles A. Sutton, Andrew McCallum
ISAAC
2005
Springer
131views Algorithms» more  ISAAC 2005»
13 years 11 months ago
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
Xiao Zhou, Takao Nishizeki
ICASSP
2011
IEEE
12 years 9 months ago
A reversible jump MCMC algorithm for Bayesian curve fitting by using smooth transition regression models
This paper proposes a Bayesian algorithm to estimate the parameters of a smooth transition regression model. With in this model, time series are divided into segments and a linear...
Matthieu Sanquer, Florent Chatelain, Mabrouka El-G...
SIGMOD
2004
ACM
188views Database» more  SIGMOD 2004»
14 years 5 months ago
Online Event-driven Subsequence Matching over Financial Data Streams
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online s...
Huanmei Wu, Betty Salzberg, Donghui Zhang
JMLR
2012
11 years 8 months ago
Maximum Margin Temporal Clustering
Temporal Clustering (TC) refers to the factorization of multiple time series into a set of non-overlapping segments that belong to k temporal clusters. Existing methods based on e...
Minh Hoai Nguyen, Fernando De la Torre