A Novelty-based Clustering Method for On-line Documents

  • Authors:
  • Sophoin Khy;Yoshiharu Ishikawa;Hiroyuki Kitagawa

  • Affiliations:
  • Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba, Japan 305-8573;Information Technology Center, Nagoya University, Chikusa-ku, Japan 464-8601;Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba, Japan 305-8573 and Center for Computational Sciences, University of Tsukuba, Tsukuba, Japan 305-8573

  • Venue:
  • World Wide Web
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we describe a document clustering method called novelty-based document clustering. This method clusters documents based on similarity and novelty. The method assigns higher weights to recent documents than old ones and generates clusters with the focus on recent topics. The similarity function is derived probabilistically, extending the conventional cosine measure of the vector space model by incorporating a document forgetting model to produce novelty-based clusters. The clustering procedure is a variation of the K-means method. An additional feature of our clustering method is an incremental update facility, which is applied when new documents are incorporated into a document repository. Performance of the clustering method is examined through experiments. Experimental results show the efficiency and effectiveness of our method.