首页|'Optimal Constrained Multiway Split Classification Tree' in Patent Application A pproval Process (USPTO 20240070476)
'Optimal Constrained Multiway Split Classification Tree' in Patent Application A pproval Process (USPTO 20240070476)
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
This patent application has not been assigned to a company or institution. The following quote was obtained by the news editors from the background informa tion supplied by the inventors: “ “Technical Field “The present disclosure generally relates to optimal decision tree learning, and more particularly, to the used of mixed integer programs (MIPS) in decision tre e learning. “Description of the Related Art “Decision trees are one of the more popular machine learning models because the tree structure is visually easy to comprehend. The learning of an optimal decisi on tree is Non-deterministic Polynomialtime hard (NP-hard). Popular algorithms rely on greedy heuristic-based methods that are challenging to incorporate const raints. MIP methods, which build on an arc-based formulation, are used to handle sample-level constraints and linear metrics.”
NETL
NSTL
