{"title":"基于LPP和SVM的高效Web文档分类算法","authors":"Ziqiang Wang, Yuxun Liu, Xia Sun","doi":"10.1109/CCPR.2008.91","DOIUrl":null,"url":null,"abstract":"With the explosive growth of World Wide Web, it is of great importance to develop methods for the automatic classifying of large collections of documents. To efficiently tackle this problem, a novel document classification algorithm based on locality pursuit projection (LPP) and SVM is proposed in this paper. The high-dimensional document space are first mapped into lower-dimensional space with LPP, the SVM is then used to classify the documents into semantically different classes. Experimental results show that the proposed algorithm achieves much better performance than other classification algorithms.","PeriodicalId":292956,"journal":{"name":"2008 Chinese Conference on Pattern Recognition","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Efficient Web Document Classification Algorithm Based on LPP and SVM\",\"authors\":\"Ziqiang Wang, Yuxun Liu, Xia Sun\",\"doi\":\"10.1109/CCPR.2008.91\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the explosive growth of World Wide Web, it is of great importance to develop methods for the automatic classifying of large collections of documents. To efficiently tackle this problem, a novel document classification algorithm based on locality pursuit projection (LPP) and SVM is proposed in this paper. The high-dimensional document space are first mapped into lower-dimensional space with LPP, the SVM is then used to classify the documents into semantically different classes. Experimental results show that the proposed algorithm achieves much better performance than other classification algorithms.\",\"PeriodicalId\":292956,\"journal\":{\"name\":\"2008 Chinese Conference on Pattern Recognition\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Chinese Conference on Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCPR.2008.91\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Chinese Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCPR.2008.91","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Efficient Web Document Classification Algorithm Based on LPP and SVM
With the explosive growth of World Wide Web, it is of great importance to develop methods for the automatic classifying of large collections of documents. To efficiently tackle this problem, a novel document classification algorithm based on locality pursuit projection (LPP) and SVM is proposed in this paper. The high-dimensional document space are first mapped into lower-dimensional space with LPP, the SVM is then used to classify the documents into semantically different classes. Experimental results show that the proposed algorithm achieves much better performance than other classification algorithms.