deskit 1.3.2__tar.gz → 1.3.2.2__tar.gz
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- {deskit-1.3.2/src/deskit.egg-info → deskit-1.3.2.2}/PKG-INFO +2 -2
- {deskit-1.3.2 → deskit-1.3.2.2}/README.md +1 -1
- {deskit-1.3.2 → deskit-1.3.2.2}/pyproject.toml +1 -1
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/des/dewsi.py +1 -1
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/des/dewsiv.py +1 -1
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/des/dewst.py +1 -1
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/des/dewsu.py +1 -1
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/des/dewsv.py +1 -1
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/des/knorae.py +2 -2
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/des/knoraiu.py +1 -1
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/des/knorau.py +1 -1
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/des/lwsei.py +1 -1
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/des/lwseu.py +1 -1
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/des/ola.py +1 -1
- {deskit-1.3.2 → deskit-1.3.2.2/src/deskit.egg-info}/PKG-INFO +2 -2
- {deskit-1.3.2 → deskit-1.3.2.2}/LICENSE +0 -0
- {deskit-1.3.2 → deskit-1.3.2.2}/setup.cfg +0 -0
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/__init__.py +0 -0
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/_config.py +0 -0
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/base/__init__.py +0 -0
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/base/base.py +0 -0
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/base/knnbase.py +0 -0
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/base/predictbase.py +0 -0
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/des/__init__.py +0 -0
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/metrics.py +0 -0
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/neighbors.py +0 -0
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/norms.py +0 -0
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/router.py +0 -0
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit/utils.py +0 -0
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit.egg-info/SOURCES.txt +0 -0
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit.egg-info/dependency_links.txt +0 -0
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit.egg-info/requires.txt +0 -0
- {deskit-1.3.2 → deskit-1.3.2.2}/src/deskit.egg-info/top_level.txt +0 -0
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
Metadata-Version: 2.4
|
|
2
2
|
Name: deskit
|
|
3
|
-
Version: 1.3.2
|
|
3
|
+
Version: 1.3.2.2
|
|
4
4
|
Summary: A Python library for Dynamic Ensemble Selection
|
|
5
5
|
Author: Tikhon Vodyanov
|
|
6
6
|
License-Expression: MIT
|
|
@@ -59,7 +59,7 @@ concept that there are regions of feature space where certain models perform par
|
|
|
59
59
|
so every base model can be an expert in a different region.
|
|
60
60
|
Only the most competent, or an ensemble of the most competent models is selected for the prediction.
|
|
61
61
|
|
|
62
|
-
Through empirical studies, DES has been shown to perform best on
|
|
62
|
+
Through empirical studies, DES has been shown to perform best on representative, diverse, and
|
|
63
63
|
heterogeneous datasets, as well as non-stationary data (concept drift), models that haven't perfected a dataset,
|
|
64
64
|
and when used on an ensemble of models with differing architectures and perspectives.
|
|
65
65
|
|
|
@@ -28,7 +28,7 @@ concept that there are regions of feature space where certain models perform par
|
|
|
28
28
|
so every base model can be an expert in a different region.
|
|
29
29
|
Only the most competent, or an ensemble of the most competent models is selected for the prediction.
|
|
30
30
|
|
|
31
|
-
Through empirical studies, DES has been shown to perform best on
|
|
31
|
+
Through empirical studies, DES has been shown to perform best on representative, diverse, and
|
|
32
32
|
heterogeneous datasets, as well as non-stationary data (concept drift), models that haven't perfected a dataset,
|
|
33
33
|
and when used on an ensemble of models with differing architectures and perspectives.
|
|
34
34
|
|
|
@@ -44,7 +44,7 @@ class DEWSI(KNNBase):
|
|
|
44
44
|
"""
|
|
45
45
|
|
|
46
46
|
def __init__(self, task, metric='mae', mode='min', k=10,
|
|
47
|
-
threshold=0.5, temperature=None, preset='
|
|
47
|
+
threshold=0.5, temperature=None, preset='exact', distance_metric='euclidean', normalization='bestrel', **kwargs):
|
|
48
48
|
metric_name, metric_fn = resolve_metric(metric)
|
|
49
49
|
norm_name, norm_fn = resolve_norm(normalization)
|
|
50
50
|
finder = make_finder(preset, k, distance_metric=distance_metric, **kwargs)
|
|
@@ -46,7 +46,7 @@ class DEWSIV(KNNBase):
|
|
|
46
46
|
"""
|
|
47
47
|
|
|
48
48
|
def __init__(self, task, metric='mae', mode='min', k=10,
|
|
49
|
-
threshold=0.5, temperature=None, preset='
|
|
49
|
+
threshold=0.5, temperature=None, preset='exact', distance_metric='euclidean', normalization='bestrel', **kwargs):
|
|
50
50
|
metric_name, metric_fn = resolve_metric(metric)
|
|
51
51
|
norm_name, norm_fn = resolve_norm(normalization)
|
|
52
52
|
finder = make_finder(preset, k, distance_metric=distance_metric, **kwargs)
|
|
@@ -50,7 +50,7 @@ class DEWST(KNNBase):
|
|
|
50
50
|
|
|
51
51
|
def __init__(self, task, metric='mae', mode='min', k=10,
|
|
52
52
|
threshold=0.5, temperature=None, r2_threshold=0.7,
|
|
53
|
-
preset='
|
|
53
|
+
preset='exact', distance_metric='euclidean', normalization='bestrel', **kwargs):
|
|
54
54
|
metric_name, metric_fn = resolve_metric(metric)
|
|
55
55
|
norm_name, norm_fn = resolve_norm(normalization)
|
|
56
56
|
finder = make_finder(preset, k, distance_metric=distance_metric, **kwargs)
|
|
@@ -40,7 +40,7 @@ class DEWSU(KNNBase):
|
|
|
40
40
|
"""
|
|
41
41
|
|
|
42
42
|
def __init__(self, task, metric='mae', mode='min', k=10,
|
|
43
|
-
threshold=0.5, temperature=None, preset='
|
|
43
|
+
threshold=0.5, temperature=None, preset='exact', distance_metric='euclidean', normalization='bestrel', **kwargs):
|
|
44
44
|
metric_name, metric_fn = resolve_metric(metric)
|
|
45
45
|
norm_name, norm_fn = resolve_norm(normalization)
|
|
46
46
|
finder = make_finder(preset, k, distance_metric=distance_metric, **kwargs)
|
|
@@ -46,7 +46,7 @@ class DEWSV(KNNBase):
|
|
|
46
46
|
"""
|
|
47
47
|
|
|
48
48
|
def __init__(self, task, metric='mae', mode='min', k=10,
|
|
49
|
-
threshold=0.5, temperature=None, preset='
|
|
49
|
+
threshold=0.5, temperature=None, preset='exact', distance_metric='euclidean', normalization='bestrel', **kwargs):
|
|
50
50
|
metric_name, metric_fn = resolve_metric(metric)
|
|
51
51
|
norm_name, norm_fn = resolve_norm(normalization)
|
|
52
52
|
finder = make_finder(preset, k, distance_metric=distance_metric, **kwargs)
|
|
@@ -35,11 +35,11 @@ class KNORAE(KNNBase):
|
|
|
35
35
|
"""
|
|
36
36
|
|
|
37
37
|
def __init__(self, task, metric='mae', mode='min', k=10,
|
|
38
|
-
threshold=0.5, preset='
|
|
38
|
+
threshold=0.5, preset='exact', distance_metric='euclidean', normalization='bestrel', **kwargs):
|
|
39
39
|
metric_name, metric_fn = resolve_metric(metric)
|
|
40
40
|
norm_name, norm_fn = resolve_norm(normalization)
|
|
41
41
|
finder = make_finder(preset, k, distance_metric=distance_metric, **kwargs)
|
|
42
|
-
super().__init__(metric=metric_fn, mode=mode, neighbor_finder=finder,
|
|
42
|
+
super().__init__(metric=metric_fn, mode=mode, neighbor_finder=finder, task=task)
|
|
43
43
|
self.task = task
|
|
44
44
|
self.threshold = threshold
|
|
45
45
|
self._metric_name = metric_name
|
|
@@ -36,7 +36,7 @@ class KNORAIU(KNNBase):
|
|
|
36
36
|
"""
|
|
37
37
|
|
|
38
38
|
def __init__(self, task, metric='mae', mode='min', k=10,
|
|
39
|
-
threshold=0.5, preset='
|
|
39
|
+
threshold=0.5, preset='exact', distance_metric='euclidean', normalization='bestrel', **kwargs):
|
|
40
40
|
metric_name, metric_fn = resolve_metric(metric)
|
|
41
41
|
norm_name, norm_fn = resolve_norm(normalization)
|
|
42
42
|
finder = make_finder(preset, k, distance_metric=distance_metric, **kwargs)
|
|
@@ -36,7 +36,7 @@ class KNORAU(KNNBase):
|
|
|
36
36
|
"""
|
|
37
37
|
|
|
38
38
|
def __init__(self, task, metric='mae', mode='min', k=10,
|
|
39
|
-
threshold=0.5, preset='
|
|
39
|
+
threshold=0.5, preset='exact', distance_metric='euclidean', normalization='bestrel', **kwargs):
|
|
40
40
|
metric_name, metric_fn = resolve_metric(metric)
|
|
41
41
|
norm_name, norm_fn = resolve_norm(normalization)
|
|
42
42
|
finder = make_finder(preset, k, distance_metric=distance_metric, **kwargs)
|
|
@@ -28,7 +28,7 @@ class LWSEI(PredictBase):
|
|
|
28
28
|
Ignores closest neighbor with a negligible distance to avoid overfitting.
|
|
29
29
|
"""
|
|
30
30
|
|
|
31
|
-
def __init__(self, task, k=10, preset='
|
|
31
|
+
def __init__(self, task, k=10, preset='exact', distance_metric='euclidean', **kwargs):
|
|
32
32
|
self.task = task
|
|
33
33
|
self.k = k
|
|
34
34
|
self._finder = make_finder(preset, k, distance_metric=distance_metric, **kwargs)
|
|
@@ -28,7 +28,7 @@ class LWSEU(PredictBase):
|
|
|
28
28
|
Ignores closest neighbor with a negligible distance to avoid overfitting.
|
|
29
29
|
"""
|
|
30
30
|
|
|
31
|
-
def __init__(self, task, k=10, preset='
|
|
31
|
+
def __init__(self, task, k=10, preset='exact', distance_metric='euclidean', **kwargs):
|
|
32
32
|
self.task = task
|
|
33
33
|
self.k = k
|
|
34
34
|
self._finder = make_finder(preset, k, distance_metric=distance_metric, **kwargs)
|
|
@@ -31,7 +31,7 @@ class OLA(KNNBase):
|
|
|
31
31
|
"""
|
|
32
32
|
|
|
33
33
|
def __init__(self, task, metric='mae', mode='min', k=10,
|
|
34
|
-
preset='
|
|
34
|
+
preset='exact', threshold=None, distance_metric='euclidean', **kwargs):
|
|
35
35
|
metric_name, metric_fn = resolve_metric(metric)
|
|
36
36
|
finder = make_finder(preset, k, distance_metric=distance_metric, **kwargs)
|
|
37
37
|
super().__init__(metric=metric_fn, mode=mode, neighbor_finder=finder, task=task)
|
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
Metadata-Version: 2.4
|
|
2
2
|
Name: deskit
|
|
3
|
-
Version: 1.3.2
|
|
3
|
+
Version: 1.3.2.2
|
|
4
4
|
Summary: A Python library for Dynamic Ensemble Selection
|
|
5
5
|
Author: Tikhon Vodyanov
|
|
6
6
|
License-Expression: MIT
|
|
@@ -59,7 +59,7 @@ concept that there are regions of feature space where certain models perform par
|
|
|
59
59
|
so every base model can be an expert in a different region.
|
|
60
60
|
Only the most competent, or an ensemble of the most competent models is selected for the prediction.
|
|
61
61
|
|
|
62
|
-
Through empirical studies, DES has been shown to perform best on
|
|
62
|
+
Through empirical studies, DES has been shown to perform best on representative, diverse, and
|
|
63
63
|
heterogeneous datasets, as well as non-stationary data (concept drift), models that haven't perfected a dataset,
|
|
64
64
|
and when used on an ensemble of models with differing architectures and perspectives.
|
|
65
65
|
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|