| US20070219990A1 | 2007-09-20 | |||
| US20110125477A1 | 2011-05-26 |
BAASITH ABDUL: "Decision Tree to predict Attrition of Machine Learning", MEDIUM, 21 September 2021 (2021-09-21), pages 1 - 24, XP093132498, Retrieved from the Internet
MORROW ANNE S., VILLODAS MIGUEL T., CUNIUS MOIRA K.: "Prospective Risk and Protective Factors for Juvenile Arrest Among Youth At Risk for Maltreatment", CHILD MALTREATMENT, vol. 24, no. 3, 1 August 2019 (2019-08-01), pages 286 - 298, XP093132503, ISSN: 1077-5595, DOI: 10.1177/1077559519828819
CHAUHAN N. S.: "Decision Tree Algorithm, Explained", KDNUGGETS, 9 February 2022 (2022-02-09), pages 1 - 16, XP093132507, Retrieved from the Internet
| CLAIMS What is claimed are: 1. Decision Tree Algorithms comprising: Trains on innovation datasets containing Categories and Classifications that can be non-data and data types; Target Variables defining key attributes of innovations that can be non-data and data types; Proximal Variables are approximated attributes of Target Variables; and Nodes that are configured to train and create predictive models. 2. Decision Tree Algorithms in claim 1 , wherein Target Variables are innovations in categories. 3. Decision Tree Algorithms in claim 1 , wherein Target V ariables are innovations in classifications. 4. Decision Tree Algorithms in claim 1, wherein Proximal Variables are innovations in categories. 5. Decision Tree Algorithms in claim 1 , wherein Proximal Variables are innovations in classifications. 6. Decision Tree Algorithms in claim 1, wherein Proximal Variables share attributes with Target Variables. 7. Decision Tree Algorithms in claim 1, wherein predictive models can be combined. 8. Decision Tree Algorithms in claim 1, wherein Nodes have defined parameters. 9. Decision Tree Algorithms in claim 1 , wherein Nodes have approximated parameters. 10. Decision Tree Algorithms in claim 1, wherein Nodes are in a specific order of operation. 11. Decision Tree Algorithms in claim 1, wherein Nodes maintain specific order throughout cycles. 12. Decision Tree Algorithms in claim 1, further comprising Nodes that are configured to multiple decision tree algorithms. 13. Decision Tree Algorithms in claim 1, further comprising Nodes that are configured to follow a specific pattern. 14. Decision Tree Algorithms in claim 1, further comprising Nodes that are configured to multiple decision tree algorithms. 15. Decision Tree Algorithms in claim 1, further comprising Nodes that intersect Target Variables and Proximal Variables. 16. Decision Tree Algorithms in claim 1, further comprising Nodes that can be independent. 17. Decision Tree Algorithms in claim 1, further comprising Nodes that can be conditional. 18. Decision Tree Algorithms in claim 1, further comprising an encoder that encrypts the datasets and models. 19. Decision Tree Algorithms in claim 1, further comprising a decoder configured to decipher the encoder. 20. Decision Tree Algorithms in claim 1, further comprising reinforced learning and training on datasets. 21. Decision Tree Algorithms in claim 1, further comprising deep learning and practicing on datasets. 22. Decision Tree Algorithms in claim 1, therein perform their functionalities in a digital platform business model. 23. Decision Tree Algorithms in claim 14, further comprising a digital platform business model with multiple parties interacting. 24. Decision Tree Algorithms in claim 14, further comprising a digital platform business model with networked ecosystems of parties interacting. ision Tree Algorithms comprising: Categories and Classifications of innovation information received through ports; Target Variables defining key attributes of innovations that can be non-data and data types; Proximal Variables are approximated attributes of Target Variables; and Nodes that are configured to train and create predictive models. 26. Decision Tree Algorithms in claim 25, wherein Target Variables are innovations in categories. 27. Decision Tree Algorithms in claim 25, wherein Target Variables are innovations in classifications. 28. Decision Tree Algorithms in claim 25, wherein Proximal Variables are innovations in categories. 29. Decision Tree Algorithms in claim 25, wherein Proximal Variables are innovations in classifications. 30. Decision Tree Algorithms in claim 25, wherein Proximal Variables share attributes with Target Variables. 31. Decision Tree Algorithms in claim 25, wherein predictive models can be combined. 32. Decision Tree Algorithms in claim 25, wherein Nodes have defined parameters. 33. Decision Tree Algorithms in claim 25, wherein Nodes have approximated parameters. 34. Decision Tree Algorithms in claim 25, wherein Nodes are in a specific order of operation. 35. Decision Tree Algorithms in claim 25, wherein Nodes maintain specific order throughout cycles. 36. Decision Tree Algorithms in claim 25, further comprising Nodes that are configured to multiple decision tree algorithms. 37. Decision Tree Algorithms in claim 25, further comprising Nodes that are configured to follow a specific pattern. 38. Decision Tree Algorithms in claim 25, further comprising Nodes that are configured to multiple decision tree algorithms. 39. Decision Tree Algorithms in claim 25, further comprising Nodes that intersect Target Variables and Proximal Variables. 40. Decision Tree Algorithms in claim 25, further comprising Nodes that can be independent. 41. Decision Tree Algorithms in claim 25, further comprising Nodes that can be conditional. 42. Decision Tree Algorithms in claim 25, further comprising an encoder that encrypts the datasets and models. 43. Decision Tree Algorithms in claim 25, further comprising a decoder configured to decipher the encoder. 44. Decision Tree Algorithms in claim 25, further comprising reinforced learning and training on datasets. 45. Decision Tree Algorithms in claim 25, further comprising deep learning and practicing on datasets. 46. Decision Tree Algorithms in claim 25, therein perform their functionalities in a digital platform business model. 47. Decision Tree Algorithms in claim 36, further comprising a digital platform business model with multiple parties interacting. 48. Decision Tree Algorithms in claim 36, further comprising a digital platform business model with networked ecosystems of parties interacting. |
Innovation is a nonlinear iterative process that lacks a unifying system — a repeatable lifecycle. Because of this, innovation seems happenstance. It appears to be triggered by serendipitous moments. But it is only a lack of understanding that creates the mystery. Innovation has a repeatable lifecycle with iterative attributes - key customer expectations - that define when innovations are most likely to be viable and have an increase chance of being marketable for success. In the book, Disruptive Innovation and Digital Transformation, authored by Marguerite L. Johnson (first inventor of this PCT application), she documented observed phenomenon from her research on products, services, and business models. She identified six attributes - key customer expectations - that systematically drive innovations in a pattern: accessible, dependable, reliable, usable, delightful, and meaningfulness. Johnson labeled them as “disrupters”. They were present in innovations in the 19 th -cenfury and in the 21 st -century, across several product offerings and business models. Johnson defined and illustrated them in a Pattern of
Disruptions.
Meaningfulness: targets Accessible: Furthermore, Johnson demonstrated how her Patern of Disruptions behave inside a model, Disruptive Innovation Customers' Expectations (DICE).
D.I.C.E. Model. Dimensions
It is based on Johnson’s observed phenomenon research on innovation attributes, defined as disrupters, that is the foundation for this PCT application on Decision-Tree Algorithms in Machine Learning to Learn and to Predict Innovations.
Johnson designed the Decision Tree Algorithms in this PCT application to learn about the Categories, Classifications, Target and Proximal Attributes, Nodes, and Parameters of innovation datasets and models based on the Pattern of Disruptions for the purposes of predicting innovation viability.