@@ -35,19 +35,20 @@ <h2>NOTES</h2>
35
35
are those of the number of breaks asked for.
36
36
37
37
< p > The < em > discont</ em > algorithm systematically searches discontinuities
38
- in the slope of the cumulated frequencies curve, by approximating this
38
+ in the slope of the cumulative frequencies curve, by approximating this
39
39
curve through straight line segments whose vertices define the class
40
40
breaks. The first approximation is a straight line which links the two
41
41
end nodes of the curve. This line is then replaced by a two-segmented
42
42
polyline whose central node is the point on the curve which is farthest
43
43
from the preceding straight line. The point on the curve furthest from
44
44
this new polyline is then chosen as a new node to create break up one of
45
- the two preceding segments, and so forth. The problem of the difference
46
- in terms of units between the two axes is solved by rescaling both
47
- amplitudes to an interval between 0 and 1. In the original algorithm,
48
- the process is stopped when the difference between the slopes of the two
49
- new segments is no longer significant (alpha = 0.05). As the slope is
50
- the ratio between the frequency and the amplitude of the corresponding
45
+ the two preceding segments, and so forth.
46
+
47
+ < p > The problem of the difference in terms of units between the two axes
48
+ is solved by rescaling both amplitudes to an interval between 0 and 1.
49
+ In the original algorithm, the process is stopped when the difference between
50
+ the slopes of the two new segments is no longer significant (alpha = 0.05). As
51
+ the slope is the ratio between the frequency and the amplitude of the corresponding
51
52
interval, i.e. its density, this effectively tests whether the frequencies
52
53
of the two newly proposed classes are different from those obtained by
53
54
simply distributing the sum of their frequencies amongst them in proportion
0 commit comments