挖掘海量数据集斯坦福大学mining massive datasets standford.pdfVIP

  • 20
  • 0
  • 约7.84千字
  • 约 19页
  • 2021-11-20 发布于北京
  • 举报

挖掘海量数据集斯坦福大学mining massive datasets standford.pdf

Mining of Massive Datasets Leskovec, Rajaraman, and Ullman Stanford University ¡  BFR [Bradley-Fayyad-Reina] is a variant of k- means for very large (disk-resident) data sets ¡  Assumes each cluster is normally distributed around a centroid in Euclidean space

文档评论(0)

1亿VIP精品文档

相关文档