forked from statsmodels/statsmodels
-
Notifications
You must be signed in to change notification settings - Fork 0
/
linbin.pyx
38 lines (33 loc) · 1.12 KB
/
linbin.pyx
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
#cython profile=True
"""
cython -a fast_linbin.pyx
gcc -shared -pthread -fPIC -fwrapv -O2 -Wall -fno-strict-aliasing -I/usr/include/python2.7 -I/usr/local/lib/python2.7/dist-packages/numpy/core/include/ -o fast_linbin.so fast_linbin.c
"""
cimport cython
cimport numpy as np
import numpy as np
ctypedef np.float64_t DOUBLE
ctypedef np.int_t INT
@cython.boundscheck(False)
@cython.wraparound(False)
@cython.cdivision(True)
def fast_linbin(np.ndarray[DOUBLE] X, double a, double b, int M, int trunc=1):
"""
Linear Binning as described in Fan and Marron (1994)
"""
cdef:
Py_ssize_t i, li_i
int nobs = X.shape[0]
double delta = (b - a)/(M - 1)
np.ndarray[DOUBLE] gcnts = np.zeros(M, np.float)
np.ndarray[DOUBLE] lxi = (X - a)/delta
np.ndarray[INT] li = lxi.astype(int)
np.ndarray[DOUBLE] rem = lxi - li
for i in range(nobs):
li_i = li[i]
if li_i > 1 and li_i < M:
gcnts[li_i] = gcnts[li_i] + 1 - rem[i]
gcnts[li_i+1] = gcnts[li_i+1] + rem[i]
if li_i > M and trunc == 0:
gcnts[M] = gcnts[M] + 1
return gcnts