1 ! Copyright (C) 2008 Doug Coleman, Michael Judge.
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: assocs combinators generalizations kernel locals math
4 math.functions math.order math.vectors sequences
5 sequences.private sorting fry arrays grouping sets ;
8 : power-mean ( seq p -- x )
9 [ '[ _ ^ ] map-sum ] [ [ length / ] [ recip ^ ] bi* ] 2bi ;
12 [ sum ] [ length ] bi / ;
14 : quadratic-mean ( seq -- x ) ! root-mean-square
15 [ [ sq ] map-sum ] [ length ] bi / sqrt ;
17 : geometric-mean ( seq -- x )
18 [ length ] [ product ] bi nth-root ;
20 : harmonic-mean ( seq -- x )
21 [ recip ] map-sum recip ;
23 : contraharmonic-mean ( seq -- x )
24 [ [ sq ] map-sum ] [ sum ] bi / ;
28 :: ((kth-object)) ( seq k nth-quot exchange-quot quot: ( x y -- ? ) -- elt )
29 #! Wirth's method, Algorithm's + Data structues = Programs p. 84
30 #! The algorithm modifiers seq, so we clone it
31 k seq bounds-check 2drop
44 [ i seq nth-quot call x quot call ] [ i 1 + i! ] while
45 [ x j seq nth-quot call quot call ] [ j 1 - j! ] while
47 i j seq exchange-quot call
58 : (kth-object) ( seq k nth-quot exchange-quot quot: ( x y -- ? ) -- elt )
59 [ clone ] 4dip ((kth-object)) ; inline
61 : kth-object-unsafe ( seq k quot: ( x y -- ? ) -- elt )
62 [ [ nth-unsafe ] [ exchange-unsafe ] ] dip (kth-object) ; inline
64 : kth-objects-unsafe ( seq kths quot: ( x y -- ? ) -- elts )
66 '[ [ nth-unsafe ] [ exchange-unsafe ] _ ((kth-object)) ] with map ; inline
70 : kth-object ( seq k quot: ( x y -- ? ) -- elt )
71 [ [ nth ] [ exchange ] ] dip (kth-object) ; inline
73 : kth-objects ( seq kths quot: ( x y -- ? ) -- elts )
75 '[ [ nth ] [ exchange ] _ ((kth-object)) ] with map ; inline
77 : kth-smallests ( seq kths -- elts ) [ < ] kth-objects-unsafe ;
79 : kth-smallest ( seq k -- elt ) [ < ] kth-object-unsafe ;
81 : kth-largests ( seq kths -- elts ) [ > ] kth-objects-unsafe ;
83 : kth-largest ( seq k -- elt ) [ > ] kth-object-unsafe ;
85 : count-relative ( seq k -- lt eq gt )
88 { +lt+ [ [ 1 + ] 2dip ] }
90 { +eq+ [ [ 1 + ] dip ] }
94 : minmax-relative ( seq k -- lt eq gt lt-max gt-min )
95 [ 0 0 0 -1/0. 1/0. ] 2dip '[
97 { +lt+ [ [ 1 + ] 5 ndip '[ _ max ] dip ] }
98 { +gt+ [ [ 1 + ] 3dip min ] }
99 { +eq+ [ [ 1 + ] 4dip drop ] }
103 : lower-median-index ( seq -- n )
105 [ length odd? [ 1 - ] unless ] bi ;
107 : lower-median ( seq -- elt )
108 [ ] [ lower-median-index ] bi kth-smallest ;
110 : upper-median ( seq -- elt )
111 dup midpoint@ kth-smallest ;
113 : medians ( seq -- lower upper )
115 [ [ lower-median-index ] [ midpoint@ ] bi 2array ]
116 bi kth-smallests first2 ;
118 : median ( seq -- x )
120 [ lower-median ] [ medians + 2 / ] if ;
122 ! quantile can be any n-tile. quartile is n = 4, percentile is n = 100
123 ! a,b,c,d parameters, N - number of samples, q is quantile (1/2 for median, 1/4 for 1st quartile)
124 ! http://mathworld.wolfram.com/Quantile.html
126 ! could subtract 1 from a
128 : quantile-x ( a b N q -- x )
129 [ + ] dip * + 1 - ; inline
133 >fraction [ /mod nip ] keep / ; inline
135 :: quantile-indices ( seq qs a b c d -- seq )
136 qs [ [ a b seq length ] dip quantile-x ] map ;
138 :: qabcd ( y-floor y-ceiling x c d -- qabcd )
139 y-floor y-ceiling y-floor - c d x frac * + * + ;
141 :: quantile-abcd ( seq qs a b c d -- quantile )
142 seq qs a b c d quantile-indices :> indices
143 indices [ [ floor ] [ ceiling ] bi 2array ] map
144 concat :> index-pairs
146 seq index-pairs kth-smallests
147 2 group indices [ [ first2 ] dip c d qabcd ] 2map ;
149 : quantile1 ( seq qs -- seq' )
150 0 0 1 0 quantile-abcd ;
152 : quantile3 ( seq qs -- seq' )
153 1/2 0 0 0 quantile-abcd ;
155 : quantile4 ( seq qs -- seq' )
156 0 0 0 1 quantile-abcd ;
158 : quantile5 ( seq qs -- seq' )
159 1/2 0 0 1 quantile-abcd ;
161 : quantile6 ( seq qs -- seq' )
162 0 1 0 1 quantile-abcd ;
164 : quantile7 ( seq qs -- seq' )
165 1 -1 0 1 quantile-abcd ;
167 : quantile8 ( seq qs -- seq' )
168 1/3 1/3 0 1 quantile-abcd ;
170 : quantile9 ( seq qs -- seq' )
171 3/8 1/4 0 1 quantile-abcd ;
173 : quartile ( seq -- seq' )
174 { 1/4 1/2 3/4 } quantile5 ;
178 : (sequence>assoc) ( seq map-quot: ( x -- ..y ) insert-quot: ( ..y assoc -- ) assoc -- assoc )
179 [ swap curry compose each ] keep ; inline
183 : sequence>assoc! ( assoc seq map-quot: ( x -- ..y ) insert-quot: ( ..y assoc -- ) -- assoc )
184 4 nrot (sequence>assoc) ; inline
186 : sequence>assoc ( seq map-quot: ( x -- ..y ) insert-quot: ( ..y assoc -- ) exemplar -- assoc )
187 clone (sequence>assoc) ; inline
189 : sequence>hashtable ( seq map-quot: ( x -- ..y ) insert-quot: ( ..y assoc -- ) -- hashtable )
190 H{ } sequence>assoc ; inline
192 : histogram! ( hashtable seq -- hashtable )
193 [ ] [ inc-at ] sequence>assoc! ;
195 : histogram-by ( seq quot: ( x -- bin ) -- hashtable )
196 [ inc-at ] sequence>hashtable ; inline
198 : histogram ( seq -- hashtable )
201 : sorted-histogram ( seq -- alist )
202 histogram sort-values ;
204 : collect-pairs ( seq quot: ( x -- v k ) -- hashtable )
205 [ push-at ] sequence>hashtable ; inline
207 : collect-by ( seq quot: ( x -- x' ) -- hashtable )
208 [ dup ] prepose collect-pairs ; inline
212 [ ] [ [ [ second ] bi@ > ] most ] map-reduce first ;
214 ERROR: empty-sequence ;
216 : minmax ( seq -- min max )
220 [ first dup ] keep [ [ min ] [ max ] bi-curry bi* ] each
226 : sample-var ( seq -- x )
231 [ [ mean ] keep [ - sq ] with map-sum ]
235 : full-var ( seq -- x )
239 [ [ mean ] keep [ - sq ] with map-sum ]
243 ALIAS: var sample-var
245 : sample-std ( seq -- x ) sample-var sqrt ;
247 : full-std ( seq -- x ) full-var sqrt ;
249 ALIAS: std sample-std
251 : mean-dev ( seq -- x ) dup mean v-n vabs mean ;
253 : median-dev ( seq -- x ) dup median v-n vabs mean ;
255 : sample-ste ( seq -- x ) [ sample-std ] [ length ] bi sqrt / ;
257 : full-ste ( seq -- x ) [ full-std ] [ length ] bi sqrt / ;
259 ALIAS: ste sample-ste
261 : ((r)) ( mean(x) mean(y) {x} {y} -- (r) )
262 ! finds sigma((xi-mean(x))(yi-mean(y))
263 0 [ [ [ pick ] dip swap - ] bi@ * + ] 2reduce 2nip ;
265 : (r) ( mean(x) mean(y) {x} {y} sx sy -- r )
266 * recip [ [ ((r)) ] keep length 1 - / ] dip * ;
268 : [r] ( {{x,y}...} -- mean(x) mean(y) {x} {y} sx sy )
269 first2 [ [ [ mean ] bi@ ] 2keep ] 2keep [ std ] bi@ ;
271 : r ( {{x,y}...} -- r )
274 : r^2 ( {{x,y}...} -- r )
277 : least-squares ( {{x,y}...} -- alpha beta )
278 [r] { [ 2dup ] [ ] [ ] [ ] [ ] } spread
279 ! stack is mean(x) mean(y) mean(x) mean(y) {x} {y} sx sy
280 [ (r) ] 2keep ! stack is mean(x) mean(y) r sx sy
281 swap / * ! stack is mean(x) mean(y) beta
284 : cov ( {x} {y} -- cov )
285 [ dup mean v-n ] bi@ v* mean ;
287 : sample-corr ( {x} {y} -- corr )
288 [ cov ] [ [ sample-var ] bi@ * sqrt ] 2bi / ;
290 : full-corr ( {x} {y} -- corr )
291 [ cov ] [ [ full-var ] bi@ * sqrt ] 2bi / ;
293 ALIAS: corr sample-corr
295 : cum-sum ( seq -- seq' )
296 0 swap [ + dup ] map nip ;
298 : cum-product ( seq -- seq' )
299 1 swap [ * dup ] map nip ;
301 : cum-min ( seq -- seq' )
302 [ ?first ] keep [ min dup ] map nip ;
304 : cum-max ( seq -- seq' )
305 [ ?first ] keep [ max dup ] map nip ;
307 : entropy ( seq -- n )
308 dup members [ [ = ] curry count ] with map
309 dup sum v/n dup [ log ] map v* sum neg ;
311 : binary-entropy ( p -- h )
312 [ dup log * ] [ 1 swap - dup log * ] bi + neg 2 log / ;
314 : standardize ( u -- v )
315 [ dup mean v-n ] [ std ] bi v/n ;
317 : differences ( u -- v )
318 [ 1 tail-slice ] keep [ - ] 2map ;
321 dup minmax over - [ v-n ] [ v/n ] bi* ;