{"title":"多文档摘要的近似动态规划改进","authors":"Yihui Luo, Shuchu Xiong","doi":"10.1109/SPAC.2014.6982716","DOIUrl":null,"url":null,"abstract":"A new improved approximate dynamic programming for multi-document summarization is presented. Our proposed algorithm improves the state-of-art approximate dynamic programming algorithm for multi-document summarization in [1]. The improvement of our method is attributed to the adding search in the backward direction at each sequential step of the dynamic programming procedure. The experimental results for multi-document summarization tasks on DUC2002 and DUC2004 data sets validate the effectiveness of our proposed method.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An improvement on approximate dynamic programming for multi-document summarization\",\"authors\":\"Yihui Luo, Shuchu Xiong\",\"doi\":\"10.1109/SPAC.2014.6982716\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new improved approximate dynamic programming for multi-document summarization is presented. Our proposed algorithm improves the state-of-art approximate dynamic programming algorithm for multi-document summarization in [1]. The improvement of our method is attributed to the adding search in the backward direction at each sequential step of the dynamic programming procedure. The experimental results for multi-document summarization tasks on DUC2002 and DUC2004 data sets validate the effectiveness of our proposed method.\",\"PeriodicalId\":326246,\"journal\":{\"name\":\"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPAC.2014.6982716\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAC.2014.6982716","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An improvement on approximate dynamic programming for multi-document summarization
A new improved approximate dynamic programming for multi-document summarization is presented. Our proposed algorithm improves the state-of-art approximate dynamic programming algorithm for multi-document summarization in [1]. The improvement of our method is attributed to the adding search in the backward direction at each sequential step of the dynamic programming procedure. The experimental results for multi-document summarization tasks on DUC2002 and DUC2004 data sets validate the effectiveness of our proposed method.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
