{"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}
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.