An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation

Authors:
Daniel Lemire;Martin Brooks;Yuhong Yan
Affiliations:
University of Quebec at Montreal;National Research Council of Canada;National Research Council of Canada
Venue:
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Year:
2005

Citing 3
Cited 1

Wavelet-based relative prefix sum methods for range sum queries in data cubes

CASCON '02 Proceedings of the 2002 conference of the Centre for Advanced Studies on Collaborative research
Online Amnesic Approximation of Streaming Time Series

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Scale-based monotonicity analysis in qualitative modelling with flat segments

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Streaming maximum-minimum filter using no more than three comparisons per element

Nordic Journal of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting an array in up to K segments. We want segments to be as monotonic as possible and to alternate signs. We propose a quality metric for this problem, present an optimal linear time algorithm based on novel formalism, and compare experimentally its performance to a linear time top-down regression algorithm. We show that our algorithm is faster and more accurate. Applications include pattern recognition and qualitative modeling.