Clustering and Classification in Text Collections Using Graph Modularity

Details Clustering and Classification in Text Collections Using Graph Modularity Clustering and Classification in Text Collections Using Graph Modularity

2011-05-29

arxiv.org/abs/1105.5789v1

Computer Science

Information Retrieval

11 pages, submitted to JMLR

Scientific paper

A new fast algorithm for clustering and classification of large collections of text documents is introduced. The new algorithm employs the bipartite graph that realizes the word-document matrix of the collection. Namely, the modularity of the bipartite graph is used as the optimization functional. Experiments performed with the new algorithm on a number of text collections had shown a competitive quality of the clustering (classification), and a record-breaking speed.

Affiliated with

Also associated with

No associations

Rating

Clustering and Classification in Text Collections Using Graph Modularity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Clustering and Classification in Text Collections Using Graph Modularity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clustering and Classification in Text Collections Using Graph Modularity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-289777