no code implementations • 1 Jun 2021 • Jason Bernard, Ranil Sonnadara, Anthony N. Saraco, Josh P. Mitchell, Alex B. Bak, Ilana Bayer, Bruce C. Wainman
Ninety percent of the data set was used in a 10-fold validation algorithm to train a DT for each of the 54 questions.
no code implementations • 29 Jan 2020 • Jason Bernard, Ian McQuillan
Lindenmayer systems (L-systems) are a grammar system that consist of string rewriting rules.
no code implementations • 15 May 2019 • Jason Bernard, Ian McQuillan
The inductive inference problem attempts to infer an L-system from such a sequence of strings generated by an unknown system; this can be thought of as an intermediate step to inferring from a sequence of images.
no code implementations • 1 Dec 2017 • Jason Bernard, Ian McQuillan
Indeed, while existing approaches are limited to L-systems with a total sum of 20 combined symbols in the productions, PMIT can infer almost all L-systems tested where the total sum is 140 symbols.