最小生成树-Minimum Spanning Trees and Single Linkage Cluster Analysis-841.pdf

最小生成树-Minimum Spanning Trees and Single Linkage Cluster Analysis-841.pdf

  1. 1、本文档共12页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
最小生成树-Minimum Spanning Trees and Single Linkage Cluster Analysis-841

Minimum Spanning Trees and Single Linkage Cluster Analysis Author(s): J. C. Gower and G. J. S. Ross Source: Journal of the Royal Statistical Society. Series C (Applied Statistics), Vol. 18, No. 1 (1969), pp. 54-64 Published by: Wiley for the Royal Statistical Society Stable URL: /stable/2346439 Accessed: 03-11-2017 14:11 UTC REFERENCES Linked references are available on JSTOR for this article: /stable/2346439?seq=1cid=pdf-reference#references_tab_contents You may need to log in to JSTOR to access the linked references. JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@. Your use of the JSTOR archive indicates your acceptance of the Terms Conditions of Use, available at /terms Royal Statistical Society, Wiley are collaborating with JSTOR to digitize, preserve and extend access to Journal of the Royal Statistical Society. Series C (Applied Statistics) This content downloaded from 5 on Fri, 03 Nov 2017 14:11:03 UTC All use subject to /terms Minimum Spanning Trees and Single Linkage Cluster Analysis By J. C. GOWER and G. J. S. Ross Rothamsted Experimental Station SUMMARY Minimum spanning trees (MST) and single linkage cluster analysis (SLCA) are explained and it is shown that all the information required for the SLCA of a set of points is contained in their MST. Known algorithms for finding the MST are discussed. They are efficient even when there

文档评论(0)

ctuorn0371 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档