An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation

Details An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation

2007-02-24

arxiv.org/abs/cs/0702142v1

Computer Science

Data Structures and Algorithms

Appeared in ICDM 2005

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-582176