文件名称:OPTICS-algorithm---Wikipedia--the-free-encycloped
下载
别用迅雷、360浏览器下载。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
介绍说明－－下载内容均来自于网络，请自行研究使用
OPTICS ("Ordering Points To Identify the Clustering Structure") is an algorithm for finding density-based clusters in spatial data. It was
presented by Mihael Ankerst, Markus M. Breunig, Hans-Peter Kriegel and Jö rg Sander[1]. Its basic idea is similar to DBSCAN,[2] but it
addresses one of DBSCAN s major weaknesses: the problem of detecting meaningful clusters in data of varying density. In order to do so, the
points of the database are (linearly) ordered such that points which are spatially closest become neighbors in the ordering. Additionally, a
special distance is stored for each point that represents the density that needs to be accepted for a cluster in order to have both points belong to
the same cluster. This is represented as a dendrogram.
presented by Mihael Ankerst, Markus M. Breunig, Hans-Peter Kriegel and Jö rg Sander[1]. Its basic idea is similar to DBSCAN,[2] but it
addresses one of DBSCAN s major weaknesses: the problem of detecting meaningful clusters in data of varying density. In order to do so, the
points of the database are (linearly) ordered such that points which are spatially closest become neighbors in the ordering. Additionally, a
special distance is stored for each point that represents the density that needs to be accepted for a cluster in order to have both points belong to
the same cluster. This is represented as a dendrogram.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
| 文件名 | 大小 | 更新时间 |
|---|---|---|
| OPTICS algorithm - Wikipedia | the free encyclopedia.pdf |