A new Automatic Density Cluster
文献类型：会议论文
| 作者 | Zhang T(张涛) ; Li S(李帅); Liu C(刘昶); Zhou XF(周晓锋)
|
| 出版日期 | 2017 |
| 会议名称 | IEEE 2nd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC) |
| 会议日期 | December 15-17, 2017 |
| 会议地点 | Chengdu, CHINA |
| 关键词 | density clusters merge automatic asymmetry |
| 页码 | 1539-1543 |
| 通讯作者 | Zhang T(张涛) |
| 中文摘要 | Clustering is an important unsupervised learning approach with wide application in data mining, pattern recognition and intelligent information processing. Density clustering is a classical clustering method for handling with non-spherical clusters, besides density clustering could operate by itself without setting the number of clusters, so it is extensive used by us. But there are some avoidless defects, such as, for asymmetry density data the effect is unsatisfactory. This paper introduce a new automatic density cluster algorithm, it brings the neighborhood radius on behalf of the density, then it abandons "minPts", so change the way to grabble clusters, the Clustering Results have a phanerous improvement. |
| 收录类别 | EI ; CPCI（ISTP） |
| 产权排序 | 1 |
| 会议主办者 | IEEE PRESS |
| 会议录 | PROCEEDINGS OF 2017 IEEE 2ND INFORMATION TECHNOLOGY, NETWORKING, ELECTRONIC AND AUTOMATION CONTROL CONFERENCE (ITNEC)
 |
| 会议录出版者 | IEEE |
| 会议录出版地 | NEW YORK |
| 语种 | 英语 |
| ISBN号 | 978-1-5090-6414-4 |
| WOS记录号 | WOS:000426941100305 |
| 源URL | [http://ir.sia.cn/handle/173321/21740]  |
| 专题 | 沈阳自动化研究所_数字工厂研究室 |
| 作者单位 | 1.University of Chinese Academy of Sciences, Beijing, China 2.Shenyang Institute of Automation, Chinese Academy of Sciences, Liaoning Province Shenyang, China 3.Key Laboratory of Network Control System, Chinese Academy of Sciences, Liaoning Province Shenyang, China |
| 推荐引用方式 GB/T 7714 | Zhang T,Li S,Liu C,et al. A new Automatic Density Cluster[C]. 见:IEEE 2nd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC). Chengdu, CHINA. December 15-17, 2017. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。