Document Clustering with K-tree

Details Document Clustering with K-tree Document Clustering with K-tree

2010-01-06

arxiv.org/abs/1001.0827v1

Computer Science

Information Retrieval

12 pages, INEX 2008

Scientific paper

10.1007/978-3-642-03761-0_43

This paper describes the approach taken to the XML Mining track at INEX 2008 by a group at the Queensland University of Technology. We introduce the K-tree clustering algorithm in an Information Retrieval context by adapting it for document clustering. Many large scale problems exist in document clustering. K-tree scales well with large inputs due to its low complexity. It offers promising results both in terms of efficiency and quality. Document classification was completed using Support Vector Machines.

Affiliated with

Also associated with

No associations

Rating

Document Clustering with K-tree 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 Document Clustering with K-tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Document Clustering with K-tree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-163928