%A YANG Feng %T Symbolic Value Partition Algorithm Using Granular Computing %0 Journal Article %D 2018 %J Computer Science %R %P 445-452 %V 45 %N 11A %U {https://www.jsjkx.com/CN/abstract/article_18017.shtml} %8 2019-02-26 %X In the field of data mining,data preprocessing based on symbolic data packets is a very challenging issue.It provides people with a more simplified representation of data.In the past research,researchers proposed many solutions,such as using rough set approach to solve this problem.In this paper,a symbolic data grouping algorithm based on grain computing was proposed,which is divided into two stages:granularity generation and granularity selection.At the stage of particle size generation,for each attribute,the tree is constructed from the bottom of the leaf with the cluster of corresponding attribute values as a binary tree,forming a forest of attribute trees.In the stage of granularity selection,each tree is globally considered on the basis of information gain,and the optimal grain layer is selected.The result of layer selection is the grouping result of symbolic data.Experimental results show that compared with the existing algorithms,this algorithm presents a more balanced hierarchy and more excellent compression efficiency,and has better application value.