On algorithm for constructing of decision trees with minimal depth

被引:0
|
作者
机构
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [21] Enhancing Navigability: An Algorithm for Constructing Tag Trees
    Chong Chen
    Pengcheng Luo
    [J]. Journal of Data and Information Science, 2017, 2 (02) : 56 - 75
  • [22] An Efficient Algorithm for Constructing Controller Trees in SDN
    Yang, Ze
    Yeung, Kwan L.
    [J]. GLOBECOM 2017 - 2017 IEEE GLOBAL COMMUNICATIONS CONFERENCE, 2017,
  • [23] Approach for constructing decision trees based on dispersion degrees
    Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, College of Computer Science and Technology, Jilin University, Changchun 130012, China
    不详
    [J]. Kongzhi yu Juece Control Decis, 2008, 1 (51-55): : 51 - 55
  • [24] Constructing conjunctions using systematic search on decision trees
    Zheng, ZJ
    [J]. KNOWLEDGE-BASED SYSTEMS, 1998, 10 (07) : 421 - 430
  • [25] Decision Trees Constructing over Multiple Data Streams
    Martyna, Jerzy
    [J]. MAN-MACHINE INTERACTIONS, 2009, 59 : 191 - 199
  • [26] Constructing minimal spanning/Steiner trees with bounded path length
    Univ of Southern California, Los Angeles, United States
    [J]. Integr VLSI J, 1-2 (137-163):
  • [27] An algorithm for constructing a minimal-volume ellipsoid
    Rubl'ov B.V.
    [J]. Journal of Mathematical Sciences, 2001, 107 (2) : 3799 - 3801
  • [28] Constructing minimal spanning/Steiner trees with bounded path length
    Oh, J
    Pyo, I
    Pedram, M
    [J]. INTEGRATION-THE VLSI JOURNAL, 1997, 22 (1-2) : 137 - 163
  • [29] Ant Colony Decision Trees - A New Method for Constructing Decision Trees Based on Ant Colony Optimization
    Boryczka, Urszula
    Kozak, Jan
    [J]. COMPUTATIONAL COLLECTIVE INTELLIGENCE: TECHNOLOGIES AND APPLICATIONS, PT I, 2010, 6421 : 373 - 382
  • [30] Constructing minimal spanning Steiner trees with bounded path length
    Pyo, I
    Oh, J
    Pedram, M
    [J]. EUROPEAN DESIGN & TEST CONFERENCE 1996 - ED&TC 96, PROCEEDINGS, 1996, : 244 - 249