monk1.dt

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

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

/*----------------------------------------------------------------------
  decision tree
----------------------------------------------------------------------*/
dtree(class) =
{ (att5)
  1:{ 1: 29 },
  2,3,4:{ (att1)
      1,2:{ (att2)
          1,2:{ (att4)
              1,3:{ (att1)
                  1:{ (att2)
                      1:{ 1: 6 },
                      2:{ 0: 9 }},
                  2:{ (att2)
                      1:{ 0: 8 },
                      2:{ 1: 10 }}},
              2:{ (att3)
                  1:{ 0: 7, 1: 1 },
                  2:{ (att6)
                      1:{ 0: 2, 1: 3 },
                      2:{ 0: 3 }}}},
          3:{ 0: 22 }},
      3:{ (att2)
          1,2:{ 0: 11 },
          3:{ 1: 13 }}}};

/*----------------------------------------------------------------------
  number of attributes: 7
  tree height         : 7
  number of nodes     : 21
  number of tuples    : 124
----------------------------------------------------------------------*/