monk1.pdt

来自「it is tree Dtree algorithm. so see it. i」· PDT 代码 · 共 35 行

/*----------------------------------------------------------------------
  domains
----------------------------------------------------------------------*/
dom(att1) = { 1, 2, 3 };
dom(att2) = { 1, 2, 3 };
dom(att5) = { 1, 2, 3, 4 };
dom(class) = { 0, 1 };

/*----------------------------------------------------------------------
  decision tree
----------------------------------------------------------------------*/
dtree(class) =
{ (att5)
  1:{ 1: 29 },
  2,3,4:{ (att1)
      1,2:{ (att2)
          1,2:{ (att1)
              1:{ (att2)
                  1:{ 1: 8 },
                  2:{ 0: 15 }},
              2:{ (att2)
                  1:{ 0: 14 },
                  2:{ 1: 12 }}},
          3:{ 0: 22 }},
      3:{ (att2)
          1,2:{ 0: 11 },
          3:{ 1: 13 }}}};

/*----------------------------------------------------------------------
  number of attributes: 4
  tree height         : 6
  number of nodes     : 15
  number of tuples    : 124
----------------------------------------------------------------------*/