| Summary: | 碩士 === 中華大學 === 資訊工程學系碩士班 === 91 === Construction of evaluation tree is the most basic and important tool to analyze the evaluated process among objects. In this paper, our research topic put on the unrooted distance evaluation trees.
We design two algorithms in the thesis. First we select four popular evaluation tree tools, use RF method to measure their distances among evaluation trees, and suggest one tree is the most average shortest distance among others.
And then, we design one algorithm to construct one new evaluation tree. Using MAST concept, and appending other nodes into MAST, finally we obtain one new evaluation tree. Measuring this tree via RF method, we find that it is as good as other popular evaluation trees.
|
|---|
