Representing Document as Dependency Graph for Document Clustering

In traditional clustering methods, a document is often represented as "bag of words" (in BOW model) or n-grams (in surfix tree document model) without considering the natural language relationships between the words. In this paper, we propose a novel approach DGDC (Dependency Graph based Document Clustering algorithm) to address this issue. In our algorithm, each document is represented as a dependency graph where the nodes correspond to words which can be seen as meta-descriptions of the document; where as the edges stand for the relations between pairs of words. A new similarity measure is proposed to compute the pairwise similarity of documents based on their corresponding dependency graphs. By applying the new similarity measure in the Group-average Agglomerative Hierarchial Clustering (GAHC) algorithm, the final clusters of documents can be obtained. The experiments were carried out on five public document datasets. The empirical results have indicated that the DGDC algorithm can achieve better performance in document clustering tasks compared with other approaches based on the BOW model and suffix tree document model.

In  20th ACM Conference on Information and Knowledge Management (CIKM)

Publisher  ACM

Details

TypeInproceedings
> Publications > Representing Document as Dependency Graph for Document Clustering