forked from Gabinou/2DKS
-
Notifications
You must be signed in to change notification settings - Fork 0
/
KS2D.py
291 lines (276 loc) · 12.5 KB
/
KS2D.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
# Code créé par Gabriel Taillon le 7 Mai 2018
# Kolmogorov-Smyrnov Test extended to two dimensions.
# References:s
# [1] Peacock, J. A. (1983). Two-dimensional goodness-of-fit testing
# in astronomy. Monthly Notices of the Royal Astronomical Society,
# 202(3), 615-627.
# [2] Fasano, G., & Franceschini, A. (1987). A multidimensional version of
# the Kolmogorov–Smirnov test. Monthly Notices of the Royal Astronomical
# Society, 225(1), 155-170.
# [3] Flannery, B. P., Press, W. H., Teukolsky, S. A., & Vetterling, W.
# (1992). Numerical recipes in C. Press Syndicate of the University
# of Cambridge, New York, 24, 78.
import sys
import inspect
import numpy as np
import scipy.stats
def CountQuads(Arr2D, point):
""" Computes the probabilities of finding points in each 4 quadrant
defined by a vertical and horizontal lines crossing the point, by counting
the proportion of points in Arr2D in each quadrant.
:param list Arr2D: Array of points to be counted.
:param array point: A 2 element list, point, which is the center of
4 square quadrants.
:returns: a tuple of 4 floats. The probabilities of finding a point in
each quadrants, with point as the origin. p stands for positive, n for
negative, with the first and second positions meaning the x and y
directions respectively.
"""
if isinstance(point, list):
point = np.asarray((np.ravel(point)))
elif type(point).__module__+type(point).__name__ == 'numpyndarray':
point = np.ravel(point.copy())
else:
raise TypeError('Input point is neither list nor numpyndarray')
if len(point) != 2:
return
if isinstance(Arr2D, list):
Arr2D = np.asarray((Arr2D))
elif type(Arr2D).__module__+type(Arr2D).__name__ == 'numpyndarray':
pass
else:
raise TypeError('Input Arr2D is neither list nor numpyndarray')
if Arr2D.shape[1] > Arr2D.shape[0]: # Reshape to A[row,column]
Arr2D = Arr2D.copy().T
if Arr2D.shape[1] != 2:
raise TypeError('Input Arr2D is not 2D')
# The pp of Qpp refer to p for 'positive' and n for 'negative' quadrants.
# In order. first subscript is x, second is y.
Qpp = Arr2D[(Arr2D[:, 0] > point[0]) & (Arr2D[:, 1] > point[1]), :]
Qnp = Arr2D[(Arr2D[:, 0] < point[0]) & (Arr2D[:, 1] > point[1]), :]
Qpn = Arr2D[(Arr2D[:, 0] > point[0]) & (Arr2D[:, 1] < point[1]), :]
Qnn = Arr2D[(Arr2D[:, 0] < point[0]) & (Arr2D[:, 1] < point[1]), :]
# Normalized fractions:
ff = 1./len(Arr2D)
fpp = len(Qpp)*ff
fnp = len(Qnp)*ff
fpn = len(Qpn)*ff
fnn = len(Qnn)*ff
# NOTE: all the f's are supposed to sum to 1.0. Float representation
# cause SOMETIMES sum to 1.000000002 or something. I don't know how to
# test for that reliably, OR what to do about it yet. Keep in mind.
return(fpp, fnp, fpn, fnn)
def FuncQuads(func2D, point, xlim, ylim, rounddig=4):
""" Computes the probabilities of finding points in each 4 quadrant
defined by a vertical and horizontal lines crossing the point, by
integrating the density function func2D in each quadrant.
:param array func2D: Density function that takes 2 arguments: x and y.
:param list point: A 2 element list, point, which is the center of 4
square quadrants.
:param array xlim,ylim: Domain of numerical integration necessary to
compute the quadrant probabilities.
:returns: a tuple of 4 floats. The probabilities of finding a point in
each quadrants, with point as the origin. p stands for positive,
n for negative, with the first and second positions meaning the x and y
directions respectively.
"""
if callable(func2D):
if len(inspect.getfullargspec(func2D)[0]) != 2:
raise TypeError('Input func2D is not a function with 2 arguments')
pass
else:
raise TypeError('Input func2D is not a function')
# If xlim, ylim and point are not lists or ndarray, exit.
if isinstance(point, list):
point = np.asarray((np.ravel(point)))
elif type(point).__module__+type(point).__name__ == 'numpyndarray':
point = np.ravel(point.copy())
else:
raise TypeError('Input point is not a list or numpyndarray')
if len(point) != 2:
raise TypeError('Input point has not exactly 2 elements')
if isinstance(xlim, list):
xlim = np.asarray((np.sort(np.ravel(xlim))))
elif type(xlim).__module__+type(xlim).__name__ == 'numpyndarray':
xlim = np.sort(np.ravel(xlim.copy()))
else:
raise TypeError('Input xlim is not a list or ndarray')
if len(xlim) != 2:
raise TypeError('Input xlim has not exactly 2 elements')
if xlim[0] == xlim[1]:
raise TypeError('Input xlim[0] should be different to xlim[1]')
if isinstance(ylim, list):
ylim = np.asarray((np.sort(np.ravel(ylim))))
elif type(ylim).__module__+type(ylim).__name__ == 'numpyndarray':
ylim = np.sort(np.ravel(ylim.copy()))
else:
raise TypeError('Input ylim is not a list or ndarray')
if len(ylim) != 2:
raise TypeError('Input ylim has not exactly 2 elements')
if ylim[0] == ylim[1]:
raise TypeError('Input ylim[0] should be different to ylim[1]')
# Numerical integration to find the quadrant probabilities.
totInt = scipy.integrate.dblquad(func2D, *xlim,
lambda x: np.amin(ylim),
lambda x: np.amax(ylim))[0]
Qpp = scipy.integrate.dblquad(func2D, point[0], np.amax(xlim),
lambda x: point[1],
lambda x: np.amax(ylim))[0]
Qpn = scipy.integrate.dblquad(func2D, point[0], np.amax(xlim),
lambda x: np.amin(ylim),
lambda x: point[1])[0]
Qnp = scipy.integrate.dblquad(func2D, np.amin(xlim), point[0],
lambda x: point[1],
lambda x: np.amax(ylim))[0]
Qnn = scipy.integrate.dblquad(func2D, np.amin(xlim), point[0],
lambda x: np.amin(ylim),
lambda x: point[1])[0]
fpp = round(Qpp/totInt, rounddig)
fnp = round(Qnp/totInt, rounddig)
fpn = round(Qpn/totInt, rounddig)
fnn = round(Qnn/totInt, rounddig)
return(fpp, fnp, fpn, fnn)
def Qks(alam, iter=100, prec=1e-17):
""" Computes the value of the KS probability function, as a function of
alam, the D statistic. From *Numerical recipes in C* page 623: '[...]
the K–S statistic useful is that its distribution in the case of the null
hypothesis (data sets drawn from the same distribution) can be calculated,
at least to useful approximation, thus giving the significance of any
observed nonzero value of D.' (D being the KS statistic).
:param float alam: D statistic.
:param int iter: Number of iterations to be perfomed. On non-convergence,
returns 1.0.
:param float prec: Convergence criteria of the qks. Stops converging if
that precision is attained.
:returns: a float. The significance level of the observed D statistic.
"""
# If j iterations are performed, meaning that toadd
# is still 2 times larger than the precision.
if isinstance(alam, int) | isinstance(alam, float):
pass
else:
raise TypeError('Input alam is neither int nor float')
toadd = [1]
qks = 0.
j = 1
while (j < iter) & (abs(toadd[-1]) > prec*2):
toadd.append(2.*(-1.)**(j-1.)*np.exp(-2.*j**2.*alam**2.))
qks += toadd[-1]
j += 1
if (j == iter) | (qks > 1): # If no convergence after j iter, return 1.0
return(1.0)
if qks < prec:
return(0.)
else:
return(qks)
def ks2d2s(Arr2D1, Arr2D2):
""" ks stands for Kolmogorov-Smirnov, 2d for 2 dimensional,
2s for 2 samples.
KS test for goodness-of-fit on two 2D samples. Tests the hypothesis that
the two samples are from the same distribution.
:param array Arr2D1: 2D array of points/samples.
:param array Arr2D2: 2D array of points/samples.
:returns: a tuple of two floats. First, the two-sample K-S statistic.
If this value is higher than the significance level of the hypothesis,
it is rejected. Second, the significance level of *d*. Small values of
prob show that the two samples are significantly different.
"""
if type(Arr2D1).__module__+type(Arr2D1).__name__ == 'numpyndarray':
pass
else:
raise TypeError('Input Arr2D1 is neither list nor numpyndarray')
if Arr2D1.shape[1] > Arr2D1.shape[0]:
Arr2D1 = Arr2D1.copy().T
if type(Arr2D2).__module__+type(Arr2D2).__name__ == 'numpyndarray':
pass
else:
raise TypeError('Input Arr2D2 is neither list nor numpyndarray')
if Arr2D2.shape[1] > Arr2D2.shape[0]:
Arr2D2 = Arr2D2.copy().T
if Arr2D1.shape[1] != 2:
raise TypeError('Input Arr2D1 is not 2D')
if Arr2D2.shape[1] != 2:
raise TypeError('Input Arr2D2 is not 2D')
d1, d2 = 0., 0.
for point1 in Arr2D1:
fpp1, fmp1, fpm1, fmm1 = CountQuads(Arr2D1, point1)
fpp2, fmp2, fpm2, fmm2 = CountQuads(Arr2D2, point1)
d1 = max(d1, abs(fpp1-fpp2))
d1 = max(d1, abs(fpm1-fpm2))
d1 = max(d1, abs(fmp1-fmp2))
d1 = max(d1, abs(fmm1-fmm2))
for point2 in Arr2D2:
fpp1, fmp1, fpm1, fmm1 = CountQuads(Arr2D1, point2)
fpp2, fmp2, fpm2, fmm2 = CountQuads(Arr2D2, point2)
d2 = max(d2, abs(fpp1-fpp2))
d2 = max(d2, abs(fpm1-fpm2))
d2 = max(d2, abs(fmp1-fmp2))
d2 = max(d2, abs(fmm1-fmm2))
d = (d1+d2)/2.
sqen = np.sqrt(len(Arr2D1)*len(Arr2D2)/(len(Arr2D1)+len(Arr2D2)))
R1 = scipy.stats.pearsonr(Arr2D1[:, 0], Arr2D1[:, 1])[0]
R2 = scipy.stats.pearsonr(Arr2D2[:, 0], Arr2D2[:, 1])[0]
RR = np.sqrt(1.-(R1*R1+R2*R2)/2.)
prob = Qks(d*sqen/(1.+RR*(0.25-0.75/sqen)))
# Small values of prob show that the two samples are significantly
# different. Prob is the significance level of an observed value of d.
# NOT the same as the significance level that ou set and compare to D.
return(d, prob)
def ks2d1s(Arr2D, func2D, xlim=[], ylim=[]):
""" ks stands for Kolmogorov-Smirnov, 2d for 2 dimensional,
1s for 1 sample.
KS test for goodness-of-fit on one 2D sample and one 2D density
distribution. Tests the hypothesis that the data was generated
from the density distribution.
:param array Arr2D: 2D array of points/samples.
:param func2D: Density distribution. Could implement a function for
arrays in the future...
:param array xlim, ylim: Defines the domain for the numerical integration
necessary to compute the quadrant probabilities.
:returns: tuple of two floats. First, the two-sample K-S statistic.
If this value is higher than the significance level of the hypothesis,
it is rejected. Second, the significance level of *d*. Small values of
prob show that the two samples are significantly different.
"""
if callable(func2D):
if len(inspect.getfullargspec(func2D)[0]) != 2:
raise TypeError('Input func2D is not a function with 2 input arguments')
pass
else:
raise TypeError('Input func2D is not a function')
if type(Arr2D).__module__+type(Arr2D).__name__ == 'numpyndarray':
pass
else:
raise TypeError('Input Arr2D is neither list nor numpyndarray')
print(Arr2D.shape)
if Arr2D.shape[1] > Arr2D.shape[0]:
Arr2D = Arr2D.copy().T
if Arr2D.shape[1] != 2:
raise TypeError('Input Arr2D is not 2D')
if xlim == []:
xlim.append(np.amin(Arr2D[:, 0]) -
abs(np.amin(Arr2D[:, 0]) -
np.amax(Arr2D[:, 0]))/10)
xlim.append(np.amax(Arr2D[:, 0]) -
abs(np.amin(Arr2D[:, 0]) -
np.amax(Arr2D[:, 0]))/10)
if ylim == []:
ylim.append(np.amin(Arr2D[:, 1]) -
abs(np.amin(Arr2D[:, 1]) -
np.amax(Arr2D[:, 1]))/10)
ylim.append(np.amax(Arr2D[:, 1]) -
abs(np.amin(Arr2D[:, 1]) -
np.amax(Arr2D[:, 1]))/10)
d = 0
for point in Arr2D:
fpp1, fmp1, fpm1, fmm1 = FuncQuads(func2D, point, xlim, ylim)
fpp2, fmp2, fpm2, fmm2 = CountQuads(Arr2D, point)
d = max(d, abs(fpp1-fpp2))
d = max(d, abs(fpm1-fpm2))
d = max(d, abs(fmp1-fmp2))
d = max(d, abs(fmm1-fmm2))
sqen = np.sqrt(len(Arr2D))
R1 = scipy.stats.pearsonr(Arr2D[:, 0], Arr2D[:, 1])[0]
RR = np.sqrt(1.0-R1**2)
prob = Qks(d*sqen/(1.+RR*(0.25-0.75/sqen)))
return d, prob