Deep Clustering with Reinforcement Strategy

Chenxin Liu
{"title":"Deep Clustering with Reinforcement Strategy","authors":"Chenxin Liu","doi":"10.1145/3478301.3478311","DOIUrl":null,"url":null,"abstract":"Deep clustering learns deep feature representations that solve clustering tasks with a deep autoencoder. However, blurred clustering is inevitable due to the lack of overall clustering environment information, which means that no significant differences were observed between clusters. To address this issue, we propose a memory enhanced model for deep clustering with reinforcement strategy, where a Memory Cell is introduced as a storage unit for surrounding imformation. Specifically, the whole process of the model is divided into three parts. Firstly, the original high-dimensional image data is mapped to latent feature space thorugh the pre-training process, and the latent feature representation is obtained and stored in Memory Cell. Secondly, the traditional K-means algorithm is applied to initialize the clustering center on the latent representation. Finally, the reward regression strategy in reinforcement learning based on the Bernoulli distribution is adopted to fine-tune the results. ACC, ARI and NMI as evaluation metrics, the proposed model shows its competitiveness on MNIST and Fashion-MNIST dataset against recent state-of-art models.","PeriodicalId":338866,"journal":{"name":"The 2nd European Symposium on Computer and Communications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2nd European Symposium on Computer and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3478301.3478311","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Deep clustering learns deep feature representations that solve clustering tasks with a deep autoencoder. However, blurred clustering is inevitable due to the lack of overall clustering environment information, which means that no significant differences were observed between clusters. To address this issue, we propose a memory enhanced model for deep clustering with reinforcement strategy, where a Memory Cell is introduced as a storage unit for surrounding imformation. Specifically, the whole process of the model is divided into three parts. Firstly, the original high-dimensional image data is mapped to latent feature space thorugh the pre-training process, and the latent feature representation is obtained and stored in Memory Cell. Secondly, the traditional K-means algorithm is applied to initialize the clustering center on the latent representation. Finally, the reward regression strategy in reinforcement learning based on the Bernoulli distribution is adopted to fine-tune the results. ACC, ARI and NMI as evaluation metrics, the proposed model shows its competitiveness on MNIST and Fashion-MNIST dataset against recent state-of-art models.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于强化策略的深度聚类
深度聚类学习使用深度自编码器解决聚类任务的深度特征表示。然而,由于缺乏整体聚类环境信息,聚类模糊是不可避免的,这意味着聚类之间没有明显的差异。为了解决这个问题,我们提出了一个带有强化策略的深度聚类的记忆增强模型,其中引入了一个记忆单元作为周围信息的存储单元。具体来说,模型的整个过程分为三个部分。首先,通过预训练过程将原始高维图像数据映射到潜在特征空间,得到潜在特征表示并存储在Memory Cell中;其次,采用传统的K-means算法对潜在表示初始化聚类中心;最后,采用基于伯努利分布的强化学习奖励回归策略对结果进行微调。ACC, ARI和NMI作为评估指标,所提出的模型在MNIST和Fashion-MNIST数据集上与最近的最先进模型相比具有竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Analysis of Techniques for Data Mining Cross-Domain Guidance Positioning Method Based on Multi-Layer Network Structure The Effect of Gaming Habits on Achievement Motivation, Social Support, and Personal Achievements: A Structural Equation Modeling Approach The 2nd European Symposium on Computer and Communications Deep Clustering with Reinforcement Strategy
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1