Re: Programmatically finding "significant" data points

erikcw wrote:

I have a collection of ordered numerical data in a list. The numbers
when plotted on a line chart make a low-high-low-high-high-low (random)
pattern. I need an algorithm to extract the "significant" high and low
points from this data.

....

How do I sort through this data and pull out these points of
significance?

Get a book on statistics. One idea is as follows. If you expect the points
to be centred around a single value, you can calculate the median or mean
of the points, calculate their standard deviation (aka spread), and remove
points which are more than N-times the standard deviation from the median.

Jeremy

--
Jeremy Sanders
http://www.jeremysanders.net/
.

Relevant Pages

  • Re: Median algorithm
    ... only 4 elements just sort the 4 of them. ... Using recursion, find the exact median entry of the middle part, ... If the position is less than k, then recurse on the ... partitioning mechanism for quicksort it would easily be outrun by ...
    (comp.programming)
  • Re: Selection sort and bubble sort
    ... quicksort as a library function for the qsort() interface. ... median is estimated using the sample. ... selection sort, or a modified bubble sort), which is why I had not done so ...
    (comp.programming)
  • Re: any relation between median and mean?
    ... But there is in fact no need to sort the array: ... > median, and advance in from either end of the array swapping elements when ... The algorithm sketched above would be O. ...
    (sci.math.num-analysis)
  • Re: Standard deviation?
    ... of with probabilities and the deviation. ... Assume that the standard deviation is 0.5 for some ... If the median is 0.001 then the data is very ... summarize. ...
    (sci.math)
  • Re: Pascal Compiler
    ... if one has var parameters. ... {find the median of three values from the data array} ... {sort part of the array} ...
    (comp.lang.logo)