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-defined size that maximizes a distance criteria such as those stated above. Can anyone give some suggestions? -- View this message in context: http://r.789695.n4.nabble.com/Packages-for-Learning-Algorithm-Independent-Branch-and-Bound-for-Feature-Selection-tp4740605.html Sent from the datatable-help mailing list archive at Nabble.com. _______________________________________________ datatable-help mailing list [email protected] https://lists.r-forge.r-project.org/cgi-bin/mailman/listinfo/datatable-help
