基于特征关系树的Splog检测算法

Yong-gong Ren, Xue Yang, Ming-fei Yin
{"title":"基于特征关系树的Splog检测算法","authors":"Yong-gong Ren, Xue Yang, Ming-fei Yin","doi":"10.1109/WISA.2012.39","DOIUrl":null,"url":null,"abstract":"Blogosphere has become a hot research field in recent years. As the existing detection algorithm has problems of inefficient feature selection and weak correlation, we propose an algorithm of splog detection based on features relation tree. We could construct the tree according to the correlation of the features, reserving the strong relevance features and removing the weak ones, then prune the redundant and irrelevance features by using the secondary features selection method and retain the best feature subset. The experimental results conducted in the Libsvm platform show that the algorithm based on the features of relation tree has higher precision and covering rate compared to the traditional ones. The precision of the algorithm on simulated training remains at about 90%, which has better generalization ability.","PeriodicalId":313228,"journal":{"name":"2012 Ninth Web Information Systems and Applications Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Detection Splog Algorithm Based on Features Relation Tree\",\"authors\":\"Yong-gong Ren, Xue Yang, Ming-fei Yin\",\"doi\":\"10.1109/WISA.2012.39\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Blogosphere has become a hot research field in recent years. As the existing detection algorithm has problems of inefficient feature selection and weak correlation, we propose an algorithm of splog detection based on features relation tree. We could construct the tree according to the correlation of the features, reserving the strong relevance features and removing the weak ones, then prune the redundant and irrelevance features by using the secondary features selection method and retain the best feature subset. The experimental results conducted in the Libsvm platform show that the algorithm based on the features of relation tree has higher precision and covering rate compared to the traditional ones. The precision of the algorithm on simulated training remains at about 90%, which has better generalization ability.\",\"PeriodicalId\":313228,\"journal\":{\"name\":\"2012 Ninth Web Information Systems and Applications Conference\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Ninth Web Information Systems and Applications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WISA.2012.39\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Ninth Web Information Systems and Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WISA.2012.39","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

近年来,博客圈已成为一个研究热点。针对现有检测算法存在特征选择效率低、相关性弱的问题,提出了一种基于特征关系树的splog检测算法。我们可以根据特征的相关性构造树,保留强相关特征,去除弱相关特征,然后使用二次特征选择方法对冗余和不相关特征进行修剪,保留最佳特征子集。在Libsvm平台上进行的实验结果表明,与传统算法相比,基于关系树特征的算法具有更高的准确率和覆盖率。算法在模拟训练上的准确率保持在90%左右,具有较好的泛化能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Detection Splog Algorithm Based on Features Relation Tree
Blogosphere has become a hot research field in recent years. As the existing detection algorithm has problems of inefficient feature selection and weak correlation, we propose an algorithm of splog detection based on features relation tree. We could construct the tree according to the correlation of the features, reserving the strong relevance features and removing the weak ones, then prune the redundant and irrelevance features by using the secondary features selection method and retain the best feature subset. The experimental results conducted in the Libsvm platform show that the algorithm based on the features of relation tree has higher precision and covering rate compared to the traditional ones. The precision of the algorithm on simulated training remains at about 90%, which has better generalization ability.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Evolutionary Analysis of Operation System-of-Systems (SoS) Network Based on Simulated Data Research of Cache Mechanism in Mobile Data Management OpinMiner: Extracting Feature-Opinion Pairs with Dependency Grammar from Chinese Product Reviews A Deep Web Database Sampling Method Based on High Correlation Keywords Richly Semantical Keyword Searching over Relational Databases
×
引用
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