Re: [R] Packages for Learning Algorithm Independent Branch and Bound for Feature Selection

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

Re: [R] How to replace match words whith colum name of data frame?

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), + "

[R] The R Journal, Volume 9, Issue 1

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 Be

Re: [R] Packages for Learning Algorithm Independent Branch and Bound for Feature Selection

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