原创力文档- 1、本文档共33页，可阅读全部内容。
- 2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
- 3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
查看更多
CHAMELEON A Hierarchical Clustering Algorithm ：变色龙的层次聚类算法
2001/12/18 CHAMELEON CHAMELEON: A Hierarchical Clustering Algorithm Using Dynamic Modeling Paper presentation in data mining class Presenter : 許明壽 ; 蘇建仲 Data : 2001/12/18 About this paper … Department of Computer Science and Engineering , University of Minnesota George Karypis Eui-Honh (Sam) Han Vipin Kumar IEEE Computer Journal - Aug. 1999 Outline Problems definition Main algorithm Keys features of CHAMELEON Experiment and related worked Conclusion and discussion Problems definition Clustering Intracluster similarity is maximized Intercluster similarity is minimized Problems of existing clustering algorithms Static model constrain Breakdown when clusters that are of diverse shapes，densities，and sizes Susceptible to noise , outliers , and artifacts Static model constrain Data space constrain K means , PAM … etc Suitable only for data in metric spaces Cluster shape constrain K means , PAM , CLARANS Assume cluster as ellipsoidal or globular and are similar sizes Cluster density constrain DBScan Points within genuine cluster are density-reachable and point across different clusters are not Similarity determine constrain CURE , ROCK Use static model to determine the most similar cluster to merge Partition techniques problem Hierarchical technique problem (1/2) The {(c) , (d)} will be choose to merge when we only consider closeness Hierarchical technique problem (2/2) Main algorithm Two phase algorithm PHASE I Use graph partitioning algorithm to cluster the data items into a large number of relatively small sub-clusters. PHASE II Uses an agglomerative hierarchical clustering algorithm to find the genuine clusters by repeatedly combining together these sub-clusters. Framework Keys features of CHAMELEON Modeling the data Modeling the cluster similarity Partition algorithms Merge schemes Terms Arguments needed K K-nearest neighbor graph MINSIZE The minima size of initial cluster TRI Threshold of related inter-connectivity TRC Threshold of related intra-connectivity α
文档评论（0）