Based on the properties of the greedy algorithm for inducing decision rules, a new application of this algorithm has been proposed. Instead of constructing a single ordering of features, attributes were weighted multiple times. The input datasets were discretised with several algorithms representing ...
Lovász, Relations between subclasses of greedoids, Zeitschrift für Operations Research, Ser A: Theory, to appear. Google Scholar 24. B Korte, L Lovász Greedoids: A structural framework for the greedy algorithm Progress in Combinatorial OptimizationW.R Pulleyblank (Ed.), Proceeding...
Worst, average, and best-case complexity.Often, not all problem instances require the same amount of resources (space or time) to be solved by the same program/algorithm.Worst case complexityrefers to the cost of the worst (most expensive) instance of the problem when solved by the best pos...
We present an application of data analytics and supervised machine learning to allow accurate predictions of the macroscopic stiffness and yield strength of a unidirectional composite loaded in the transverse plane. Predictions are obtained from the analysis of an image of the material microstructure, as...
Greedoids, a structural framework for the greedy algorithm W.R. Pulleyblank (Ed.), Progress in Combinatorial Optimization, Academic Press, New York (1984), pp. 221-243 View PDFView articleGoogle Scholar Kurosh, 1935 A. Kurosh Durchschnittsdarstellungen mit irredu...
There are many different algorithms for generating a descriptor set of a specified size from a large pool. Since a brute force combinatorial search for the best set is often prohibitively expensive computationally, usually approximate methods are employed such as statistical tests, greedy forward ...
Chun J, Goodfellow M (1995) A phylogenetic analysis of the genus Nocardia with 16S rRNA gene sequences. Int J Syst Bacteriol 45:240–245 Article CAS PubMed Google Scholar Zhang Z, Schwartz S, Wagner L, Miller W (2000) A greedy algorithm for aligning DNA sequences. J Comput Biol 7:...
The closest approximation to π using three terms of the greedy Egyptian fraction algorithm. It is somewhat more accurate than this one but requires a larger denominator term. 3.141592653589... = π (pi) (π (pi), the best-known irrational constant) ...
Similarly, ./active_learning/pareto_greedy/OMG_train_batch_1_chemprop_with_reaction_id.csv contains quantum chemistry calculation results from Round 1. This directory also contains 200 RDKit features (./rdkit_features) used in training ML models to overcome the local nature of message passing in...
A greedy algorithm for block-sparse vectors is proposed in Ref. [30]. The atomic norm of hierarchically sparse vectors is the ℓ1-norm – hence, the analogous strategy does not directly carry over. Instead, hierarchical sparse vectors were introduced in a line of work [20], [37], [38...