全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Document Clustering with K-tree

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

Full-Text   Cite this paper   Add to My Lib

Abstract:

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.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133