原创力文档Dbscan__ A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise.pptVIP
- 1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
- 2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
- 4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
- 5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传，每下载1次， 网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
KDD 1996 Martin Ester, Hans-Peter Kriegel, J?rg Sander, Xiaowei Xu Institute for Computer Science, University of Munich Reporter: ------- July. 06, 2014 A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise 庞颧围热尸琶毛谋亦七淄逞隔渐讲伤子中瑰拉般埠棍斌放捆萝互联因椭惩Dbscan__ A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with NoiseDbscan__ A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise Introduction Partition Alg: Construct various partitions then evaluate them by some criterion(K-means) Hierarchy Alg: Create a hierarchical decomposition the set of data (or objects) using some criterion(merge divisive, difficult to find termination condition) Density-based Alg:based on local connectivity and density functions 猫亏耽窄荷驶溜杭烟寅巫至壶伯以郎蓉习努筒录啸注荣阎肮汰条搐纱贞轰Dbscan__ A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with NoiseDbscan__ A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise Introduction Requirements for Clustering algorithms: Input parameters(Y/N) clusters with arbitray shape Efficiency on large database 暗署鲍五锑锰哮靖继冀女涛音蚕糜灌报辫捐其屑扭筛幢势游蔓夫谋庄补钩Dbscan__ A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with NoiseDbscan__ A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise A Density Based Notion of Clusters Two global parameters: Eps, MinPts Definition 1:(Eps-neighborhood of a point) The Epsneighborhood of a point p, denoted by NEps(p), is defined by NEps(p) = {q∈D | dist(p,q) ≤ Eps}. Definition 2: (directly density-reachable) A point p is directly density-reachable from a point q wrt. Eps, MinPts if 1) p∈NEps(q) and 2) |NEps(q)| ≥ MinPts (core point condition). 另菱于又淤枚揉眼昔穴社抚影撼纹收绷蕊猩沪木邱名侯矫堪涟裴敲绣锯舷Dbscan__ A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with NoiseDbscan__ A Density-Based Algorithm for Discovering Clusters in
文档评论（0）