By Topic

Text clustering algorithm based on spectral graph seriation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Guo Wensheng ; Dept. of Comput. Sci. & Technol., China Univ. of Pet.-Beijing, Changping, China ; Li Guohe

In the field of information processing, most of the existing text clustering algorithm is based on vector space model (VSM). However, VSM can not effectively express the structure of the text so that it can not fully express the semantic information of the text. In order to improve the ability of expression in the semantic information, this paper presents a new text structure graph model. With the weighted graph, this model expresses the characteristics term of the text and its associated location information. On this basis of spectral graph seriation, a spectral clustering algorithm is put forward. This algorithm replace solving common subgraph with matrix computation, then reduce the computational complexity of graph clustering. There are also algorithm analysis and experiment in the paper. The results of the study show that the text clustering algorithm based on spectral graph seriation is effective and feasible.

Published in:

Control and Decision Conference, 2009. CCDC '09. Chinese

Date of Conference:

17-19 June 2009