Constructing an Optimal Decision Tree for FAST Corner Point Detection

Author:

Alkhalid Abdulaziz,Chikalov Igor,Moshkov Mikhail

Publisher

Springer Berlin Heidelberg

Reference13 articles.

1. Breiman, L., et al.: Classification and Regression Trees. Chapman & Hall, New York (1984)

2. Breitbart, Y., Reiter, A.: A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic boolean functions. Acta Inf. 4, 311–319 (1975)

3. Chakaravarthy, V.T., et al.: Decision trees for entity identification: approximation algorithms and hardness results. In: Proceedings of the 26-th ACM Symposium on Principles of Database Systems, pp. 53–62. ACM, New York (2007)

4. Garey, M.R.: Optimal binary identification procedures. SIAM Journal on Applied Mathematics 23, 173–186 (1972)

5. Heeringa, B., Adler, M.: Approximating optimal binary decision trees. Tech. Rep. 05-25, University of Massachusetts, Amherst (2005)

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Bi-criteria Optimization Problem for Decision Trees: Cost Versus Cost;Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining;2018-05-23

2. Bi-criteria optimization of decision trees with applications to data analysis;European Journal of Operational Research;2018-04

3. Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables;Procedia Computer Science;2013

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3