关键词: 有序分类, 模糊有序互信息, 有序决策树

Abstract: Ordinal classification tasks widely exist in real life. Rank entropy based ordinal decision tree is one of the most important ways of dealing with ordinal classification problems. This decision tree algorithm selects rank mutual information as a heuristic. This paper introduces fuzzy rank entropy to construct an algorithm for building a fuzzy ordinal decision tree, which is an extension of ordinal decision tree. Both of them have been applied to dispose the ordinal classification tasks in a wide range. This paper compares the two algorithms based on four aspects, and shows their comparative advantages and disadvantages.

Key words: ordinal classification, fuzzy rank mutual information, ordinal decision tree