{"title":"基于粒子群算法的部分内容检测的复制","authors":"Qingwei Ye, Dongxing Wu, Yu Zhou, Xiaodong Wang","doi":"10.1109/BICTA.2010.5645302","DOIUrl":null,"url":null,"abstract":"It is discussed how to detect the duplicated of partial contents between two documents in this paper. There are some algorithms which can detect similarity among documents. But these algorithms cannot detect the duplicated of partial contents in documents. A new effective algorithm of the duplicated of partial contents detection in documents is put forward in this paper. The new algorithm is using PSO algorithm to search the optimized partial contents which is the most similar in two documents. For PSO algorithm, it provides the encoding of the particles. A new related coefficient of strings is defined for strings similarity. And the new evaluation function of PSO is designed based on the related coefficient function. The hybrid mutation PSO algorithm is used for searching the most similar partial contents quickly and accurately. The simulation experiments indicate that the algorithm can search the most similar partial contents in two documents effectively.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"214 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"The duplicated of partial content detection based on PSO\",\"authors\":\"Qingwei Ye, Dongxing Wu, Yu Zhou, Xiaodong Wang\",\"doi\":\"10.1109/BICTA.2010.5645302\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is discussed how to detect the duplicated of partial contents between two documents in this paper. There are some algorithms which can detect similarity among documents. But these algorithms cannot detect the duplicated of partial contents in documents. A new effective algorithm of the duplicated of partial contents detection in documents is put forward in this paper. The new algorithm is using PSO algorithm to search the optimized partial contents which is the most similar in two documents. For PSO algorithm, it provides the encoding of the particles. A new related coefficient of strings is defined for strings similarity. And the new evaluation function of PSO is designed based on the related coefficient function. The hybrid mutation PSO algorithm is used for searching the most similar partial contents quickly and accurately. The simulation experiments indicate that the algorithm can search the most similar partial contents in two documents effectively.\",\"PeriodicalId\":302619,\"journal\":{\"name\":\"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)\",\"volume\":\"214 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BICTA.2010.5645302\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BICTA.2010.5645302","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The duplicated of partial content detection based on PSO
It is discussed how to detect the duplicated of partial contents between two documents in this paper. There are some algorithms which can detect similarity among documents. But these algorithms cannot detect the duplicated of partial contents in documents. A new effective algorithm of the duplicated of partial contents detection in documents is put forward in this paper. The new algorithm is using PSO algorithm to search the optimized partial contents which is the most similar in two documents. For PSO algorithm, it provides the encoding of the particles. A new related coefficient of strings is defined for strings similarity. And the new evaluation function of PSO is designed based on the related coefficient function. The hybrid mutation PSO algorithm is used for searching the most similar partial contents quickly and accurately. The simulation experiments indicate that the algorithm can search the most similar partial contents in two documents effectively.