deskit 1.2.3__tar.gz → 1.2.4__tar.gz

{deskit-1.2.3/src/deskit.egg-info → deskit-1.2.4}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: deskit
-Version: 1.2.3
+Version: 1.2.4
 Summary: A Python library for Dynamic Ensemble Selection
 Author: Tikhon Vodyanov
 License-Expression: MIT

{deskit-1.2.3 → deskit-1.2.4}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "deskit"
-version = "1.2.3"
+version = "1.2.4"
 description = "A Python library for Dynamic Ensemble Selection"
 readme = "README.md"
 license = "MIT"

{deskit-1.2.3 → deskit-1.2.4}/src/deskit/des/dewsiv.py

@@ -94,7 +94,7 @@ class DEWSIV(KNNBase):
              (0.5 if self.mode == 'min' else 1.0))
         th = threshold if threshold is not None else self.threshold
 
-        distances, indices = self.model.kneighbors(x, k=k, loo=loo)                # both (batch, k)
+        distances, indices = self.model._kneighbors(x, k=k, loo=loo)                # both (batch, k)
 
         # Inverse-distance weights
         inv_dist   = 1.0 / np.maximum(distances, 1e-8)               # (batch, k)

{deskit-1.2.3 → deskit-1.2.4}/src/deskit/des/dewst.py

@@ -97,7 +97,7 @@ class DEWST(KNNBase):
         th    = threshold    if threshold    is not None else self.threshold
         r2_th = r2_threshold if r2_threshold is not None else self.r2_threshold
 
-        distances, indices = self.model.kneighbors(x, k=k, loo=loo)          # (batch, k)
+        distances, indices = self.model._kneighbors(x, k=k, loo=loo)          # (batch, k)
         k = distances.shape[1]
 
         # Inverse-distance weights

{deskit-1.2.3 → deskit-1.2.4}/src/deskit/des/dewsu.py

@@ -75,7 +75,7 @@ class DEWSU(KNNBase):
              (0.5 if self.mode == 'min' else 1.0))
         th = threshold if threshold is not None else self.threshold
 
-        _, indices = self.model.kneighbors(x, k=k, loo=loo)                        # (batch, k)
+        _, indices = self.model._kneighbors(x, k=k, loo=loo)                        # (batch, k)
 
         # Average each model's scores over the K neighbors
         avg_scores = self.matrix[indices].mean(axis=1)               # (batch, n_models)

{deskit-1.2.3 → deskit-1.2.4}/src/deskit/des/dewsv.py

@@ -94,7 +94,7 @@ class DEWSV(KNNBase):
              (0.5 if self.mode == 'min' else 1.0))
         th = threshold if threshold is not None else self.threshold
 
-        _, indices = self.model.kneighbors(x, k=k, loo=loo)                        # (batch, k)
+        _, indices = self.model._kneighbors(x, k=k, loo=loo)                        # (batch, k)
 
         # Uniform average of each model's scores over K neighbors
         neighbor_scores = self.matrix[indices]                        # (batch, k, n_models)

{deskit-1.2.3 → deskit-1.2.4}/src/deskit/des/knorae.py

@@ -64,7 +64,7 @@ class KNORAE(KNNBase):
         th       = threshold if threshold is not None else self.threshold
         n_models = len(self.models)
 
-        _, indices      = self.model.kneighbors(x, k=k, loo=loo)
+        _, indices      = self.model._kneighbors(x, k=k, loo=loo)
         k               = indices.shape[1]
         neighbor_scores = self.matrix[indices]                        # (batch, k, n_models)
 

{deskit-1.2.3 → deskit-1.2.4}/src/deskit/des/knoraiu.py

@@ -64,7 +64,7 @@ class KNORAIU(KNNBase):
         """
         th = threshold if threshold is not None else self.threshold
 
-        distances, indices = self.model.kneighbors(x, k=k, loo=loo)                # both (batch, k)
+        distances, indices = self.model._kneighbors(x, k=k, loo=loo)                # both (batch, k)
         neighbor_scores    = self.matrix[indices]                     # (batch, k, n_models)
 
         # Normalize per neighbor: best model = 1.0, worst = 0.0

{deskit-1.2.3 → deskit-1.2.4}/src/deskit/des/knorau.py

@@ -64,7 +64,7 @@ class KNORAU(KNNBase):
         """
         th = threshold if threshold is not None else self.threshold
 
-        _, indices      = self.model.kneighbors(x, k=k, loo=loo)
+        _, indices      = self.model._kneighbors(x, k=k, loo=loo)
         neighbor_scores = self.matrix[indices]                        # (batch, k, n_models)
 
         # Normalize per neighbor: best model = 1.0, worst = 0.0

{deskit-1.2.3 → deskit-1.2.4}/src/deskit/des/lwsei.py

@@ -87,7 +87,7 @@ class LWSEI(PredictBase):
         n_models   = len(self.models)
         uniform    = np.full(n_models, 1.0 / n_models)
 
-        distances, indices = self._finder.kneighbors(x, k=k, loo=loo)              # (batch, k)
+        distances, indices = self._finder._kneighbors(x, k=k, loo=loo)              # (batch, k)
         weights_out        = np.empty((batch_size, n_models))
 
         for b in range(batch_size):

{deskit-1.2.3 → deskit-1.2.4}/src/deskit/des/lwseu.py

@@ -87,7 +87,7 @@ class LWSEU(PredictBase):
         n_models   = len(self.models)
         uniform    = np.full(n_models, 1.0 / n_models)
 
-        distances, indices = self._finder.kneighbors(x, k=k, loo=loo)              # (batch, k)
+        distances, indices = self._finder._kneighbors(x, k=k, loo=loo)              # (batch, k)
         weights_out        = np.empty((batch_size, n_models))
 
         for b in range(batch_size):

{deskit-1.2.3 → deskit-1.2.4}/src/deskit/des/ola.py

@@ -63,7 +63,7 @@ class OLA(KNNBase):
         """
         batch_size = x.shape[0]
 
-        _, indices  = self.model.kneighbors(x, k=k, loo=loo)
+        _, indices  = self.model._kneighbors(x, k=k, loo=loo)
         avg_scores  = self.matrix[indices].mean(axis=1)               # (batch, n_models)
         best_indices = np.argmax(avg_scores, axis=1)
 

{deskit-1.2.3 → deskit-1.2.4/src/deskit.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: deskit
-Version: 1.2.3
+Version: 1.2.4
 Summary: A Python library for Dynamic Ensemble Selection
 Author: Tikhon Vodyanov
 License-Expression: MIT