QQ客服 官方微博 反馈留言

	Segmentation Region Density Clustering Algorithm Based on Minimum Spanning Tree [基于最小生成树的分割区域密度聚类算法]
	Li, Jitao; Liang, Yongquan
刊名	Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics
	2019
卷号	31期号:9页码:1628-1635
关键词	Density clustering Imbalanced data set Minimum spanning tree
DOI	10.3724/SP.J.1089.2019.17716
URL标识	查看原文
公开日期	[db:dc_date_available]
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/4550363
专题	山东大学
作者单位	1.College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 2.266590, China 3.[Lian
推荐引用方式 GB/T 7714	Li, Jitao,Liang, Yongquan. Segmentation Region Density Clustering Algorithm Based on Minimum Spanning Tree [基于最小生成树的分割区域密度聚类算法][J]. Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics,2019,31(9):1628-1635.
APA	Li, Jitao,&Liang, Yongquan.(2019).Segmentation Region Density Clustering Algorithm Based on Minimum Spanning Tree [基于最小生成树的分割区域密度聚类算法].Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics,31(9),1628-1635.
MLA	Li, Jitao,et al."Segmentation Region Density Clustering Algorithm Based on Minimum Spanning Tree [基于最小生成树的分割区域密度聚类算法]".Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics 31.9(2019):1628-1635.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。