BIRCH A New Data Clustering Algorithm and Its Applications.pptVIP

下载本文档

8
0
约1.26万字
约 33页
2016-03-12 发布于广东
举报
版权申诉

BIRCH A New Data Clustering Algorithm and Its Applications.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

BIRCH A New Data Clustering Algorithm and Its Applications.ppt

* * Exam Questions What is the main limitation of BIRCH? Since each node in a CF tree can hold only a limited number of entries due to the size, a CF tree node doesn’t always correspond to what a user may consider a nature cluster. Moreover, if the clusters are not spherical in shape, it doesn’t perform well because it uses the notion of radius or diameter to control the boundary of a cluster. * * Exam Questions Name the two algorithms in BIRCH clustering: CF-Tree Insertion CF-Tree Rebuilding What is the purpose of phase 4 in BIRCH? Do additional passes over the dataset and reassign data points to the closest centroid . QA Thank you for your patience Good luck for final exam! * * * Data Mining and Knowledge Discovery, Volume 1, Issue 2, 1997, pp. 141-182 * Partitioning clustering, especially k-means algorithm, is widely used, and is regarded as a benchmark clustering algorithm. Hierarchical clustering is the algorithm on which Birch algorithm based. * Given the number of clusters, chose the initial centers randomly * Assign every data instance to the closest cluster based on the distance between the data and the center of the cluster and compute the new centers of the k clusters * * 1. Calculate the similarity between all possible combinations of two data instances * * * 2. Two most similar clusters are grouped together to form a new cluster * 3. Calculate the similarity between the new cluster and all remaining clusters. * 1.The time complexity of computing the distance between every pair of data instances is O(n2). 2. The time complexity to create the sorted list of inter-cluster distances is O(n2log n). Obviously, the algorithms in these regards are failed to effectively handle large datasets that space and time are considered. * * * * N is the number of data points LS is the linear sum of the N points SS is the square sum of the N points * CF Additivity Theorem: if CF_1 and CF_2 are disjoint, merging them is equal to the sum of their parts * CF tree c