基于优化LDA和熵的网络用户分类模型

Peng Liu, Fang Liu, Yinan Dou, Zhenming Lei
{"title":"基于优化LDA和熵的网络用户分类模型","authors":"Peng Liu, Fang Liu, Yinan Dou, Zhenming Lei","doi":"10.1109/ICNIDC.2009.5360869","DOIUrl":null,"url":null,"abstract":"The classification of Network users is very important in user behavior analysis. The algorithm which was based entropy and latent Dirichlet allocation (LDA) was used in this paper. It is important but difficult to select an appropriate number of topics for a specific dataset. Entropy was first used to solve the problem. A concept named difference-entropy was built to determine the number of topics. Experiments show that the proposed method can achieve performance matching the best of LDA without manually tuning the number of topics.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Classification model of network users based on optimized LDA and entropy\",\"authors\":\"Peng Liu, Fang Liu, Yinan Dou, Zhenming Lei\",\"doi\":\"10.1109/ICNIDC.2009.5360869\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The classification of Network users is very important in user behavior analysis. The algorithm which was based entropy and latent Dirichlet allocation (LDA) was used in this paper. It is important but difficult to select an appropriate number of topics for a specific dataset. Entropy was first used to solve the problem. A concept named difference-entropy was built to determine the number of topics. Experiments show that the proposed method can achieve performance matching the best of LDA without manually tuning the number of topics.\",\"PeriodicalId\":127306,\"journal\":{\"name\":\"2009 IEEE International Conference on Network Infrastructure and Digital Content\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Conference on Network Infrastructure and Digital Content\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNIDC.2009.5360869\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Network Infrastructure and Digital Content","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNIDC.2009.5360869","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

网络用户分类是用户行为分析的重要内容。本文采用了基于熵和潜狄利克雷分配(LDA)的算法。为特定的数据集选择适当数量的主题很重要,但也很困难。熵首先被用来解决这个问题。建立了一个名为差异熵的概念来确定主题的数量。实验表明,该方法可以在不需要手动调整主题数量的情况下达到LDA的最佳性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Classification model of network users based on optimized LDA and entropy
The classification of Network users is very important in user behavior analysis. The algorithm which was based entropy and latent Dirichlet allocation (LDA) was used in this paper. It is important but difficult to select an appropriate number of topics for a specific dataset. Entropy was first used to solve the problem. A concept named difference-entropy was built to determine the number of topics. Experiments show that the proposed method can achieve performance matching the best of LDA without manually tuning the number of topics.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信