基于迁移学习的最大熵聚类

Shouwei Sun, Yizhang Jiang, Pengjiang Qian
{"title":"基于迁移学习的最大熵聚类","authors":"Shouwei Sun, Yizhang Jiang, Pengjiang Qian","doi":"10.1109/ICIST.2014.6920605","DOIUrl":null,"url":null,"abstract":"The classical maximum entropy clustering (MEC) algorithm can only work on a single dataset, which might result in poor effectiveness in the condition that the capacity of the dataset is insufficient. To resolve this problem, using the strategy of transfer learning, this paper proposed the novel transfer learning based maximum entropy clustering (TL_MEC) algorithm. TL_MEC employs the historical cluster centers and membership of the past data as the references to guide the clustering on the current data, which promotes its performance distinctly from three aspects: clustering effectiveness, anti-noise, as well as privacy protection. Thus TL_MEC can work well on those small dataset if enough historical data are available. The experimental studies verified and demonstrated the contributions of this study.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Transfer learning based maximum entropy clustering\",\"authors\":\"Shouwei Sun, Yizhang Jiang, Pengjiang Qian\",\"doi\":\"10.1109/ICIST.2014.6920605\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The classical maximum entropy clustering (MEC) algorithm can only work on a single dataset, which might result in poor effectiveness in the condition that the capacity of the dataset is insufficient. To resolve this problem, using the strategy of transfer learning, this paper proposed the novel transfer learning based maximum entropy clustering (TL_MEC) algorithm. TL_MEC employs the historical cluster centers and membership of the past data as the references to guide the clustering on the current data, which promotes its performance distinctly from three aspects: clustering effectiveness, anti-noise, as well as privacy protection. Thus TL_MEC can work well on those small dataset if enough historical data are available. The experimental studies verified and demonstrated the contributions of this study.\",\"PeriodicalId\":306383,\"journal\":{\"name\":\"2014 4th IEEE International Conference on Information Science and Technology\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-04-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 4th IEEE International Conference on Information Science and Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIST.2014.6920605\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 4th IEEE International Conference on Information Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIST.2014.6920605","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

经典的最大熵聚类(MEC)算法只能在单个数据集上工作,在数据集容量不足的情况下,可能会导致有效性较差。为了解决这一问题,本文采用迁移学习策略,提出了一种基于迁移学习的最大熵聚类(TL_MEC)算法。TL_MEC采用过去数据的历史聚类中心和隶属度作为参考来指导对当前数据的聚类,从聚类有效性、抗噪声性和隐私保护三个方面明显提升了其性能。因此,如果有足够的历史数据,TL_MEC可以很好地处理这些小数据集。实验研究验证了本研究的贡献。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Transfer learning based maximum entropy clustering
The classical maximum entropy clustering (MEC) algorithm can only work on a single dataset, which might result in poor effectiveness in the condition that the capacity of the dataset is insufficient. To resolve this problem, using the strategy of transfer learning, this paper proposed the novel transfer learning based maximum entropy clustering (TL_MEC) algorithm. TL_MEC employs the historical cluster centers and membership of the past data as the references to guide the clustering on the current data, which promotes its performance distinctly from three aspects: clustering effectiveness, anti-noise, as well as privacy protection. Thus TL_MEC can work well on those small dataset if enough historical data are available. The experimental studies verified and demonstrated the contributions of this study.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信