Mahout: Batch and online clustering

通过定期使用Canopy聚类算法快速分配新文章到已有主题集群,并周期性地进行全面聚类更新,确保网站上显示的文章能够及时反映最新的新闻话题。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Online news clustering

  • Cluster one million articles, as showed below, and save the cluster centroids for all clusters.



 

  • Periodically, for each new article, use canopy clustering to assign it to the cluster whose centroid is closest, based on a very small distance threshold. This ensures that articles on topics that occurred previously are associated with that topic cluster and are shown instantly on the website. These documents are removed from the new document list.
  • The leftover documents that aren’t associated with any old clusters form new canopies. These  canopies represent new topics that have appeared in the news and that have little or no match with any articles from the past.
  • Use the new canopy centroids, cluster the articles that aren’t associated with any of the old clusters, and add these temporary cluster centroids to the centroid list.
  • Less frequently, execute the full batch clustering to recluster the entire set of documents. While doing so, use all previous cluster centroids as input to the algorithm so that clustering achieves faster convergence.

 

 

 

 

 

 

 

 

 

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值