关键词: 数据挖掘, 树挖掘, 频繁子树, 非确定树, 有序树

Abstract: Uncertain tree mining has become an important research subject and has been caused concerns to more and more scholars.In this paper，an uncertain tree mining algorithm is proposed.Uncertain tree mining is an algorithm which can effectively deal with uncertain problems in practical application，the main idea of the algorithm is as follows：The algorithm proposes conceptions of uncertain tree inclusive set，uncertain tree probability and uncertain tree expectation support etc.It raises uncertain tree expectation support as tree support，and gives the calculation method of uncertain tree support.The algorithm utilizes the characteristics of hash table to reduce tree isomorphism hours when calculating expectation support.It brings forward the level search space for uncertain tree mining，which makes uncertain tree mining fast and accurate.The final adoption of a large number of experiments shows that uncertain tree mining proposed in this article is effective and feasible and has significant operating efficiency.

Key words: data mining, tree mining, frequent subtree, uncertain tree, order tree