Clustering Rooted Ordered Trees

Author

Chehreghani, Mostafa Haghir ; Rahgozar, Masoud ; Lucas, Craig

Author_Institution

Fac. of Electron. in Commun. Eng., Tehran Univ.

fYear

2007

fDate

March 1 2007-April 5 2007

Firstpage

450

Lastpage

455

Abstract

Tree structures have gained popularity for storing data from different domains such as XML documents, bio informatics and so on. Clustering these data can facilitate different operations. In this paper, we propose TreeCluster, a novel and heuristic algorithm for clustering tree structured data. This algorithm considers a representative tree for each cluster. For each input tree T, TreeCluster computes the composition of the tree T and each of the clusters. Tree T belongs to the cluster which its composed tree gains the best score. After adding a tree to a cluster the representative tree of that cluster is updated. We evaluate the accuracy of the TreeCluster algorithm in comparison to the previous works

Keywords

pattern clustering; tree data structures; TreeCluster; data storage; heuristic algorithm; rooted ordered tree clustering; tree structured data; Bioinformatics; Classification tree analysis; Clustering algorithms; Computational intelligence; Data mining; Heuristic algorithms; Information retrieval; Partitioning algorithms; Tree data structures; XML;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence and Data Mining, 2007. CIDM 2007. IEEE Symposium on

Conference_Location

Honolulu, HI

Print_ISBN

1-4244-0705-2

Type

conf

DOI

10.1109/CIDM.2007.368909

Filename

4221333