metacountregressor 0.1.108__py3-none-any.whl → 0.1.116__py3-none-any.whl

metacountregressor/metaheuristics.py

@@ -72,7 +72,7 @@ def dict_mean(dict_list,
             mean_dict[key] = sum(d[key] for d in dict_list) / len(dict_list)
         return mean_dict
     else:
-
+        mean_dict = {}
         for key in dict_list[0].keys():
             if key in ignore:
                 continue
@@ -402,6 +402,7 @@ class DifferentialEvolution(object):
             self._obj_fun._obj_1 = 'bic'
 
         self._pop_size = kwargs.get('_pop_size', 20)
+        print('Population size is', self._pop_size)
         if not isinstance(self._pop_size, int):
             raise ValueError("_pop_size must be an integer")
         elif self._pop_size <= 3:
@@ -618,7 +619,7 @@ class DifferentialEvolution(object):
                                                                                      1)
 
                     if len(self._pareto_population) == 1:
-                        print('the size of the population is only 1')
+                        print('Pareto Population Size is only 1')
                     if self.pf.check_dominance([obj_trial[self.pf.obj_key_1], obj_trial[self.pf.obj_key_2]],
                                                [self._population[j][self.pf.obj_key_1], self._population[j][
                                                    self.pf.obj_key_2]]):  # if solution dominates existing #FIXME some error here true but not entering
@@ -787,7 +788,7 @@ class SimulatedAnnealing(object):
         self.accept = 0
         self.profiler = []
         self.update_t = self.cooling_linear_m
-        self.get_direcotory()
+        self.get_directory()
         self._crossover_perc = float(kwargs.get('_crossover_perc', 0.2)) or float(kwargs.get('_cr', 0.2))
         self._obj_fun = objective_function
         if objective_function.is_multi:  # TODO Define more specific objectives in the intialiser
@@ -801,7 +802,7 @@ class SimulatedAnnealing(object):
             self.pf = Pareto(self.obj_1, self.obj_2, False)
             self._sa_memory = list()
 
-    def get_direcotory(self):
+    def get_directory(self):
         # checking if the directory demo_folder2 
         # exist or not.
         if not os.path.isdir(self.instance_number):
@@ -1004,7 +1005,7 @@ class SimulatedAnnealing(object):
                     elif num_of_changeablePARMs == 0:
                         rdm_i = random.choice(range(len(prmVect)))
                         if self._obj_fun.get_num_discrete_values(rdm_i) <= 1:
-                            print('hold gimct')
+                            print('retry')
 
                     while self._obj_fun.get_num_discrete_values(rdm_i) <= 1:
                         rdm_i = random.randint(0, self._obj_fun.get_num_parameters() - 1)
@@ -1046,7 +1047,7 @@ class SimulatedAnnealing(object):
                             get_rdm_j = random.randint(0, self._obj_fun.get_num_discrete_values(rdm_i) - 1)
                             if (self._obj_fun.get_num_discrete_values(
                                     rdm_i) - 1) < 1:  # TODO: remove this is just a test
-                                print('fucking fix this sln algorithm')
+                               
                                 break
                             new_nbr_i = self._obj_fun.get_value(rdm_i, get_rdm_j)
                             neighbour[rdm_i] = new_nbr_i
@@ -1237,15 +1238,25 @@ class HarmonySearch(object):
             Initialize HS with the specified objective function. Note that this objective function must implement ObjectiveFunctionInterface.
         """
         self._obj_fun = objective_function
+        ## NEW CODE, TRYING TO EXCTACT OUT THE PARAMATERS
+        self._hms = kwargs.get('_hms', 20)
+        self._par = kwargs.get('_par', .30)
+        self.F = kwargs.get('_AI', 2)  # mutation scale
+        self.iter = kwargs.get('_max_iter', 10000)
+        self.cr = kwargs.get('_crossover_perc') or kwargs.get('_cr', 0.2)
+        self.instance_number = str(kwargs.get('instance_number', 1))
+
+
+
         # for printing basics metrics
-        self.print_verbose = True
+        self.print_verbose = kwargs.get('verbose', False)
         # harmony_memory stores the best hms harmonies
         self._harmony_memory = list()
         # harmony_history stores all hms harmonies every nth improvisations (i.e., one 'generation')
         self._harmony_history = list()
         # saves the best fitness
         self.instance_number = str(objective_function.instance_number)
-        self.get_direcotory()
+        self.get_directory()
         self._harmony_trace_best = list()
         self._harmony_trace_incumbent = list()
         if self._obj_fun.is_multi:  # TODO Define more specific objectives in the intialiser
@@ -1261,7 +1272,7 @@ class HarmonySearch(object):
 
             self.pf = Pareto(self.obj_1, self.obj_2, False)
 
-    def get_direcotory(self):
+    def get_directory(self):
         # checking if the directory demo_folder2 
         # exist or not.
         if not os.path.isdir(self.instance_number):

metacountregressor/setup.py

@@ -8,7 +8,7 @@ with codecs.open("README.rst", encoding='utf8') as fh:
 setuptools.setup(name='metacountregressor',
                  version='0.1.63',
                  description='Extensions for a Python package for \
-                              GPU-accelerated estimation of mixed logit models.',
+                             estimation of data count models.',
                  long_description=long_description,
                  long_description_content_type="text/x-rst",
                  url='https://github.com/zahern/CountDataEstimation',
@@ -20,5 +20,6 @@ setuptools.setup(name='metacountregressor',
                  python_requires='>=3.10',
                  install_requires=[
                      'numpy>=1.13.1',
-                     'scipy>=1.0.0'
+                     'scipy>=1.0.0',
+                     'latextable'
                  ])