版权说明 操作指南
首页 > 成果 > 详情

Improved Deep Embedded K-Means Clustering with Implicit Orthogonal Space Transformation

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
会议论文
作者:
Liu, Xinrui;Liu, Wenzheng;Li, Yuxiang;Tang, Xiaoyong;Deng, Tan;...
通讯作者:
Liu, WZ
作者机构:
[Liu, Wenzheng; Deng, Tan; Li, Yuxiang; Liu, Xinrui; Tang, Xiaoyong; Liu, WZ; Cao, Ronghui] Changsha Univ Sci & Technol, Sch Comp & Commun Engn, Changsha, Peoples R China.
[Liu, Xinrui] Changsha Univ Sci & Technol, Hunan Int Sci & Technol Innovat Cooperat Base Adv, Changsha, Hunan, Peoples R China.
通讯机构:
[Liu, WZ ] C
Changsha Univ Sci & Technol, Sch Comp & Commun Engn, Changsha, Peoples R China.
语种:
英文
关键词:
deep clustering;implicit transformation;K-means;orthogonal transformation matrix
期刊:
Proceedings - IEEE Computer Society's International Computer Software and Applications Conference
ISSN:
0730-3157
年:
2023
页码:
304-309
会议名称:
47th IEEE-Computer-Society Annual International Conference on Computers, Software, and Applications (COMPSAC)
会议论文集名称:
Proceedings International Computer Software and Applications Conference
会议时间:
JUN 27-29, 2023
会议地点:
Univ Torino, Torino, ITALY
会议主办单位:
Univ Torino
主编:
Shahriar, H Teranishi, Y Cuzzocrea, A Sharmin, M Towey, D Majumder, AKMJA Kashiwazaki, H Yang, JJ Takemoto, M Sakib, N Banno, R Ahamed, SI
出版地:
10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
出版者:
IEEE COMPUTER SOC
ISBN:
979-8-3503-2697-0
基金类别:
Open Fund of Hunan International Scientific and Technological Innovation Cooperation Base of Advanced Construction and Maintenance Technology of Highway (Changsha University of Science and Technology) [kfj210801]
机构署名:
本校为第一且通讯机构
院系归属:
计算机与通信工程学院
摘要:
The deep clustering algorithm can learn the latent embedded features of the data through the autoencoder, and cluster the data according to the similarity of the latent features. However, the feature information obtained by the autoencoder may not have a better value for the clustering algorithm and is not suitable for clustering, which greatly reduces the clustering effect. This paper proposes a deep K-means clustering algorithm with implicitly embedded space transformation to answer this question. We implicitly transform the latent feature space into a new type of space that is more friendly...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com