autofuzzts 0.1.2__py3-none-any.whl → 0.1.3__py3-none-any.whl

autofuzzts/partition/fuzzy_clust_fun_orig.py

@@ -1,129 +0,0 @@
-## Functions for fuzzy clustering
-import numpy as np
-import pandas as pd
-
-
-def fuzzy_partition_cosine(X: pd.Series, n:float):
-    '''
-
-    Midsteps of the calculation:
-
-    D - distance vector (D) represents the relative position of each data point within the partition
-    h - height, spread of the fuzzy sets 
-
-    '''
-
-    n_rows = len(X)
-    x_spread = X.max() - X.min() # spread of the data
-
-    D = np.zeros((n,1))
-    for i in range(0,n):
-        D[i] = i/(n-1)*x_spread   # D is adjusted by the x_spread
-    h = (D[-1]-D[0])/(n-1)
- 
-    A = np.zeros((n_rows,n))
-
-    x_sorted = np.sort(X) # sort the data
-
-    for k in range(0,n_rows):
-        if (D[0] <= x_sorted[k]) and (x_sorted[k] <= D[1]):
-            A[k, 0] = 0.5*(np.cos(np.pi*(x_sorted[k]-D[0])/h)+1)
-        else:
-            if (D[n - 2] <= x_sorted[k]) and (x_sorted[k] <= D[n-1]):
-                A[k, n-1] = 0.5*(np.cos(np.pi*(x_sorted[k]-D[n-1])/h)+1)
-        for j in range(1,n-1):
-            if (D[j - 1] <= x_sorted[k]) and (x_sorted[k] <= D[j+1]):
-                A[k,j]=0.5*(np.cos(np.pi*(x_sorted[k]-D[j])/h)+1)
-
-    return D,A
-
-
-
-
-
-def fuzzy_partition_triangle(X: pd.Series, n:float):
-    '''
-
-    Midsteps of the calculation:
-
-    D - distance vector (D) represents the relative position of each data point within the partition
-    h - height, spread of the fuzzy sets 
-
-    '''
-
-    n_rows = len(X)
-    x_spread = X.max() - X.min() # spread of the data
-
-    D = np.zeros((n,1))
-    for i in range(0,n):
-        D[i] = i/(n-1)*x_spread   # D is adjusted by the x_spread
-    h = (D[-1]-D[0])/(n-1)
- 
-    A = np.zeros((n_rows,n))
-
-    x_sorted = np.sort(X) # sort the data
-
-    for k in range(0,n_rows):
-
-        # First column
-        if (D[0] <= x_sorted[k]) and (x_sorted[k] <= D[1]):
-            A[k, 0] = (D[1]-x_sorted[k])/h
-
-        # Last column   
-        else:
-            if (D[n - 2] <= x_sorted[k]) and (x_sorted[k] <= D[n-1]):
-                A[k, n-1] =  (x_sorted[k]-D[n-2])/h
-
-        # All other columns
-        for j in range(1,n-1):
-            if (D[j - 1] <= x_sorted[k]) and (x_sorted[k]<= D[j]):
-                A[k,j] =  (x_sorted[k]-D[j-1])/h
-
-            if (D[j] <= x_sorted[k]) and (x_sorted[k] <= D[j+1]):
-                A[k,j] =  (D[j+1]-x_sorted[k])/h 
-
-    return D,A
-
-
-def fuzzy_partition_gauss(X: pd.Series, n:float, sigma:float = 1):
-    '''
-
-    Midsteps of the calculation:
-
-    D - distance vector (D) represents the relative position of each data point within the partition
-    h - height, spread of the fuzzy sets 
-
-    '''
-    
-    n_rows = len(X)
-    x_spread = X.max() - X.min() # spread of the data
-
-    D = np.zeros((n,1))
-    for i in range(0,n):
-        D[i] = i/(n-1)*x_spread   # D is adjusted by the x_spread
-    h = (D[-1]-D[0])/(n-1)
- 
-    A = np.zeros((n_rows,n))
-
-    x_sorted = np.sort(X) # sort the data
-
-    for k in range(0,n_rows):
-
-            # First column
-            if (D[0] <= x_sorted[k]) and (x_sorted[k] <= D[1]):
-                A[k, 0] = np.exp(-(x_sorted[k] - D[0]) ** 2 / (2 * sigma ** 2))
-            
-            # Last column   
-            else:
-                if (D[n - 2] <= k) and (x_sorted[k] <= D[n-1]):
-                    A[k, n-1] =   np.exp(-(x_sorted[k] - D[n-1]) ** 2 / (2 * sigma ** 2))
-                    
-
-            # All other columns
-            for j in range(1,n-1):
-                if (D[j - 1] <= x_sorted[k]) and (x_sorted[k] <= D[j+1]):
-                    A[k,j] = np.exp(-(x_sorted[k] - D[j]) ** 2 / (2 * sigma ** 2))
-
-
-    return D,A
-

autofuzzts/utils.py

@@ -1 +0,0 @@
-# utils.py

autofuzzts-0.1.2.dist-info/RECORD

@@ -1,25 +0,0 @@
-autofuzzts/__init__.py,sha256=2k_ZeqU7FvqZMFqGm-EYRiV98uxUxmiy5wXygvIobPU,13
-autofuzzts/config.py,sha256=rzwULHfKKtf5Rdpm8pk-zwuXrkKc0dckF-xIfz1UVcY,392
-autofuzzts/pipeline.py,sha256=wwaVXBvnoAvd3MDvEaj4xKqPlBWMSyOHSR5TOTP2jTo,16189
-autofuzzts/utils.py,sha256=lywC_KhHuYgjUmXjj-ay9vZYTKUSxFgWXY2q6EdWf9s,10
-autofuzzts/data/__init__.py,sha256=2k_ZeqU7FvqZMFqGm-EYRiV98uxUxmiy5wXygvIobPU,13
-autofuzzts/data/data_loader.py,sha256=VO8V9O3WgXffyktUMSmbGTiXWBJ2kgN5wLqgFgvkE6w,266
-autofuzzts/data_validation/__init__.py,sha256=2k_ZeqU7FvqZMFqGm-EYRiV98uxUxmiy5wXygvIobPU,13
-autofuzzts/data_validation/validate.py,sha256=ttK3nnvfTfxFF_GKyfxuU168oqmA6MEemB1dP06mL7g,1453
-autofuzzts/evaluation/__init__.py,sha256=2k_ZeqU7FvqZMFqGm-EYRiV98uxUxmiy5wXygvIobPU,13
-autofuzzts/models/__init__.py,sha256=2k_ZeqU7FvqZMFqGm-EYRiV98uxUxmiy5wXygvIobPU,13
-autofuzzts/models/fuzzy_classifier.py,sha256=mU0t91n-8mTJQs-_XDYbrix9oa6EQP_3UvGDCw-GmJY,3363
-autofuzzts/models/mlp_nas.py,sha256=OCFtrd47IhesAqtaHpBTOwKPdFly9yjl7O-25msXXGE,3048
-autofuzzts/partition/__init__.py,sha256=2k_ZeqU7FvqZMFqGm-EYRiV98uxUxmiy5wXygvIobPU,13
-autofuzzts/partition/fuzzy_clust_fun.py,sha256=NlpkI8s7N4ebdHWbGECsQZqk1Xf8v0c15cA27JEMJ-A,3097
-autofuzzts/partition/fuzzy_clust_fun_orig.py,sha256=JlXYw-MxiNAcIasYTyWiQHaHhJuY8h_BRy3jLo2efOA,3653
-autofuzzts/partition/partition.py,sha256=f5nTHjrJJYKjtzMFxsdfPL_CGBb12HOR0hkGi4L_WLY,4410
-autofuzzts/partition/visualize_partition.py,sha256=F31yovGfosqa-EmtuQdIIuF61XejHEGGdALfHHAtDu0,909
-autofuzzts/preprocess/__init__.py,sha256=2k_ZeqU7FvqZMFqGm-EYRiV98uxUxmiy5wXygvIobPU,13
-autofuzzts/preprocess/prep_for_model.py,sha256=mp19PGo_p8YWezSny__qKnuTREhAldSlxCzIutrisGk,2565
-autofuzzts/preprocess/preprocess.py,sha256=QZ0h4bZslwOrjTUyvPQaXDT_lBlnL8nKdp545Qy3xdk,2786
-autofuzzts-0.1.2.dist-info/licenses/LICENSE,sha256=bjnZy7iTBVYeRcAPI9NVlXeQGx62R13_t8xwoLq44Ms,1087
-autofuzzts-0.1.2.dist-info/METADATA,sha256=XuLUJuUcurF9DZE0YLGwFzkdJbIEZMXdJ3MI2KFztNk,3764
-autofuzzts-0.1.2.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
-autofuzzts-0.1.2.dist-info/top_level.txt,sha256=YHgbVRUPg-x2WX7FKyJMUAeI9o46c8XFiR_eYKtXIxc,11
-autofuzzts-0.1.2.dist-info/RECORD,,