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,
Hola Jesús,
Te comento varios detalles, aunque son muchos los matices...
- Desde el punto de vista de algoritmos, H2O tiene ventajas sobre Spark
tanto de performance como de variedad. H2O incorpora ya un algoritmo propio
de deeplearning y recientemente ya es compatible con Keras,
Dear ?,
I'm sure that there are many ways to do what you want; here's one:
> cbind(concept_df, category=
+ ifelse(apply(
+ sapply(chemical_df$chemical,
+ function(x) grepl(x, concept_df$concept)),
+ 1, any),
+
Dear all,
The latest issue of The R Journal is now available at:
https://journal.r-project.org/archive/2017-1/.
Many thanks to all contributors - especially reviewers and authors.
Regards,
Bettina
--
Roger Bivand
Department of Economics, Norwegian School of Economics,
Helleveien 30, N-5045
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
5 matches
Mail list logo