Tree Data Mining Algorithm for Dynamic Cloud Model
With rapid development of newly emergent applications in the real world,various kinds of data are sharply on the rise.Therefore,the traditional data mining mode is far from meeting the requirements of large number of dada. Faced w ith this,the paper aims at handling the algorithm of tree data mining on the basis of dynamic cloud model. First,the paper has simply illustrated some concepts concerning cloud computing,the cloud computing model,and operating process and so on. Then,a CDA-HT,Mainly dealing w ith random operation strategy of the task allocation in Hadoop,is put forw ard in order to minimize the consumption cost,In addition,under this condition,the author also quotes the concepts of LeastClosedTreeMine framew ork under the dynamic cloud model put forw ard by GenF1,F1List,GenPartFn,GenWholeFn. Lastly,after large number of experiments,the paper concludes that large quantities of data can be efficiently mined and analyzed in that the paralleled algorithm is feasible,highly efficient,expandable as w ell as soundly flexible.