Quoting Alex Byrley :
See, I have built my own genetic algorithm already and tested it on this
problem. I have a solution, but due to the heuristic nature of GA, I cannot
guarantee that it is the optimal subset.
If I was simply doing this for a company project, you are spot on with the
type of
See, I have built my own genetic algorithm already and tested it on this
problem. I have a solution, but due to the heuristic nature of GA, I cannot
guarantee that it is the optimal subset.
If I was simply doing this for a company project, you are spot on with the
type of algorithm I would use, bu
On Thu, 29 Jun 2017, Alex Byrley writes:
> I am looking for packages that can run a branch-and-bound algorithm to
> maximize a distance measure (such as Bhattacharyya or Mahalanobis) on a set
> of features.
>
> I would like this to be learning algorithm independent, so that the method
> just looks
I am looking for packages that can run a branch-and-bound algorithm to
maximize a distance measure (such as Bhattacharyya or Mahalanobis) on a set
of features.
I would like this to be learning algorithm independent, so that the method
just looks at the features, and selects the subset of a user-de
4 matches
Mail list logo
