2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/124580Monotonicity 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.Appeared in ICDM 2005Data Structures and AlgorithmsDatabasesAn Optimal Linear Time Algorithm for Quasi-Monotonic Segmentationtext